Tsuyoshi Yagita

According to our database, Tsuyoshi Yagita authored at least 8 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Path Cover Problems with Length Cost.

Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita

Algorithmica, November, 2023

2022

Reconfiguring <i>k</i>-Path Vertex Covers.

Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita

IEICE Trans. Inf. Syst., 2022

2021

Finding a maximum minimal separator: Graph classes and fixed-parameter tractability.

Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita

Theor. Comput. Sci., 2021

How to pack directed acyclic graphs into small blocks.

Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita

Discret. Appl. Math., 2021

2020

Complexity of the Maximum <i>k</i>-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

Reconfiguring k-path Vertex Covers.

Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2018

Complexity of the Maximum k-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks.

Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita

Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018