Tsuyoshi Yagita

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