Asahiro, Y., Gong, M., Jansson, J., Lin, G., Lu, S., Miyano, E., Ono, H., Saitoh, T., Tanaka, S., & Yuichi Asahiro and Mingyang Gong and Jesper Jansson and Guohui Lin and Sichen Lu and Eiji Miyano and Hirotaka Ono and Toshiki Saitoh and Shunichi Tanaka. (2025, Januar 1). Approximability of Longest Run Subsequence and Complementary Minimization Problems. Gehalten auf der. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.wabi.2025.3

ASAHIRO, Yuichi, GONG, Mingyang, JANSSON, Jesper, LIN, Guohui, LU, Sichen, MIYANO, Eiji, ONO, Hirotaka, SAITOH, Toshiki, TANAKA, Shunichi und YUICHI ASAHIRO AND MINGYANG GONG AND JESPER JANSSON AND GUOHUI LIN AND SICHEN LU AND EIJI MIYANO AND HIROTAKA ONO AND TOSHIKI SAITOH AND SHUNICHI TANAKA, 2025. Approximability of Longest Run Subsequence and Complementary Minimization Problems. In: [online]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. 1 Januar 2025. Available from: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2025.3

Asahiro, Y., M. Gong, J. Jansson, G. Lin, S. Lu, E. Miyano, H. Ono, T. Saitoh, S. Tanaka, und Yuichi Asahiro and Mingyang Gong and Jesper Jansson and Guohui Lin and Sichen Lu and Eiji Miyano and Hirotaka Ono and Toshiki Saitoh and Shunichi Tanaka. Approximability of Longest Run Subsequence and Complementary Minimization Problems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025., 2025, https://doi.org/10.4230/lipics.wabi.2025.3.

Asahiro, Y., Gong, M., Jansson, J., Lin, G., Lu, S., Miyano, E., Ono, H., Saitoh, T., Tanaka, S. und Yuichi Asahiro and Mingyang Gong and Jesper Jansson and Guohui Lin and Sichen Lu and Eiji Miyano and Hirotaka Ono and Toshiki Saitoh and Shunichi Tanaka. (2025), „Approximability of Longest Run Subsequence and Complementary Minimization Problems“, in , Bd. , Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025., verfügbar unter:https://doi.org/10.4230/lipics.wabi.2025.3.