Author of the publication

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

Bipartite Permutation Graphs are reconstructible., , and . Discrete Math., Alg. and Appl., (2012)Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , and . CoRR, (2014)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)Ferrers dimension of grid intersection graphs., , , , and . Discrete Applied Mathematics, (2017)Random Generation and Enumeration of Proper Interval Graphs., , , and . IEICE Transactions, 93-D (7): 1816-1823 (2010)The complexity of the stamp folding problem., , , , and . Theor. Comput. Sci., (2013)Voronoi Game on a Path., , and . IEICE Transactions, 94-D (6): 1185-1189 (2011)Extending Partial Representations of Interval Graphs., , , , and . Algorithmica, 78 (3): 945-967 (2017)The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant., , and . J. Graph Algorithms Appl., 23 (1): 29-70 (2019)