Author of the publication

Complexity of the Maximum k-Path Vertex Cover Problem.

, , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 103-A (10): 1193-1201 (2020)

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.

 

Other publications of authors with the same name

Subexponential Time Algorithms for Embedding H-Minor Free Graphs., , and . ICALP, volume 55 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)PSPACE-completeness of Bloxorz and of Games with 2-Buttons., and . CoRR, (2014)On Exploring Temporal Graphs of Small Pathwidth., and . CoRR, (2018)On the complexity of Nurse Rostering problems., , and . Oper. Res. Lett., 51 (5): 483-487 (September 2023)Efficiently computing the Shapley value of connectivity games in low-treewidth graphs., , and . Oper. Res., 23 (1): 6 (March 2023)On the Exact Complexity of Polyomino Packing., and . FUN, volume 100 of LIPIcs, page 9:1-9:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Stable divisorial gonality is in NP., , and . CoRR, (2018)Improved Lower Bounds for Graph Embedding Problems., and . CoRR, (2016)PSPACE-Completeness of Bloxorz and of Games with 2-Buttons., and . CIAC, volume 9079 of Lecture Notes in Computer Science, page 403-415. Springer, (2015)Computing Treewidth on the GPU., and . IPEC, volume 89 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)