Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (COCOA, 2019)

Exact algorithms for the repetition-bounded longest common subsequence problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Theor. Comput. Sci., 2020)

Path Cover Problems with Length Cost. - Kenya Kobayashi; Guohui Lin; Eiji Miyano; Toshiki Saitoh; Akira Suzuki 001; Tadatoshi Utashima; Tsuyoshi Yagita (Algorithmica, 2023)

Polynomial-time equivalences and refined algorithms for longest common subsequence variants. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Discret. Appl. Math., 2024)