Tsuyoshi Yagita

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 11

Top Topics

Approximation Algorithms

Equivalence Class

Top Venues

IEICE Trans. Inf. Syst.

Publications

Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. Algorithmica 85 (11) (2023)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. WALCOM (2022)
Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
-Path Vertex Covers. IEICE Trans. Inf. Syst. (7) (2022)
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano, Tsuyoshi Yagita
How to pack directed acyclic graphs into small blocks. Discret. Appl. Math. 288 (2021)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability. Theor. Comput. Sci. 865 (2021)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
Reconfiguring k-path Vertex Covers. WALCOM (2020)
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Tsuyoshi Yagita
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability. CoRR (2020)
Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
Reconfiguring k-path vertex covers. CoRR (2019)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM (2018)
Yuichi Asahiro, Eiji Miyano, Tsuyoshi Yagita
Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks. ICCSA (2) (2018)