( en | de | ru )

 

Disambiguation of "Yagita, Tsuyoshi"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of the Maximum k-Path Vertex Cover Problem.

, , , , and . WALCOM, volume 10755 of Lecture Notes in Computer Science, page 240-251. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tsuyoshi Takagi

Tsuyoshi Matsuda

 

Other publications of authors with the same name

Path Cover Problems with Length Cost., , , , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 396-408. Springer, (2022)Complexity of the Maximum k-Path Vertex Cover Problem., , , , and . WALCOM, volume 10755 of Lecture Notes in Computer Science, page 240-251. Springer, (2018)Complexity of the Maximum k-Path Vertex Cover Problem., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 103-A (10): 1193-1201 (2020)Path Cover Problems with Length Cost., , , , , , and . Algorithmica, 85 (11): 3348-3375 (November 2023)Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks., , and . ICCSA (2), volume 10961 of Lecture Notes in Computer Science, page 607-623. Springer, (2018)Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability., , , and . CoRR, (2020)Reconfiguring k-path vertex covers., , and . CoRR, (2019)Finding a maximum minimal separator: Graph classes and fixed-parameter tractability., , , and . Theor. Comput. Sci., (2021)How to pack directed acyclic graphs into small blocks., , , , and . Discret. Appl. Math., (2021)Reconfiguring k-Path Vertex Covers., , and . IEICE Trans. Inf. Syst., 105-D (7): 1258-1272 (2022)