( en | de | ru )

 

Disambiguation of "Saitoh, Toshiki"

Author of the publication

copydeleteadd this publication to your clipboard
Random generation and enumeration of bipartite permutation graphs.

, , , and . J. Discrete Algorithms, (2012)

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)Random Generation and Enumeration of Proper Interval Graphs., , , and . IEICE Trans. Inf. Syst., 93-D (7): 1816-1823 (2010)The complexity of the stamp folding problem., , , , and . Theor. Comput. Sci., (2013)Bipartite Permutation Graphs are reconstructible., , and . Discret. Math. Algorithms Appl., (2012)Ferrers dimension of grid intersection graphs., , , , and . Discret. Appl. Math., (2017)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)The Time Complexity of the Token Swapping Problem and Its Parallel Variants., , and . CoRR, (2016)Approximating the path-distance-width for AT-free graphs and graphs in related classes., , , , , , , and . Discret. Appl. Math., (2014)Extending partial representations of subclasses of chordal graphs., , , and . Theor. Comput. Sci., (2015)