Author of the publication

Path Cover Problems with Length Cost.

, , , , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 396-408. Springer, (2022)

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.

No persons found for author name Saitoh, Toshiki
add a person with the name Saitoh, Toshiki
 

Other publications of authors with the same name

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , and . CoRR, (2014)The complexity of the stamp folding problem., , , , and . Theor. Comput. Sci., (2013)Random Generation and Enumeration of Proper Interval Graphs., , , and . IEICE Trans. Inf. Syst., 93-D (7): 1816-1823 (2010)Ferrers dimension of grid intersection graphs., , , , and . Discret. Appl. Math., (2017)Bipartite Permutation Graphs are reconstructible., , and . Discret. Math. Algorithms Appl., (2012)Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs., , , , , and . Algorithms, 5 (2): 176-213 (2012)Extending Partial Representations of Subclasses of Chordal Graphs., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 444-454. Springer, (2012)Linear-time Algorithm for Partial Representation Extension of Interval Graphs., , , , and . CoRR, (2013)Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data"., , , , , , , , and . Rev. Socionetwork Strateg., 13 (2): 99-100 (2019)Sequentially Swapping Colored Tokens on Graphs., , , , , , , , , and . J. Graph Algorithms Appl., 23 (1): 3-27 (2019)