Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. - Yuichi Asahiro; Eiji Miyano; Tsuyoshi Yagita (ICCSA (2), 2018)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (WALCOM, 2018)

Reconfiguring k-path Vertex Covers. - Duc A. Hoang 001; Akira Suzuki 001; Tsuyoshi Yagita (WALCOM, 2020)

Complexity of the Maximum k-Path Vertex Cover Problem. - Eiji Miyano; Toshiki Saitoh; Ryuhei Uehara; Tsuyoshi Yagita; Tom C. van der Zanden (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

How to pack directed acyclic graphs into small blocks. - Yuichi Asahiro; Tetsuya Furukawa; Keiichi Ikegami; Eiji Miyano; Tsuyoshi Yagita (Discret. Appl. Math., 2021)

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. - Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Tsuyoshi Yagita (Theor. Comput. Sci., 2021)

Reconfiguring k-Path Vertex Covers. - Duc A. Hoang 001; Akira Suzuki 001; Tsuyoshi Yagita (IEICE Trans. Inf. Syst., 2022)

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