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

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data"., , , , , , , , and . Rev. Socionetwork Strateg., 13 (2): 99-100 (2019)Max-Min 3-Dispersion Problems., , , , , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 104-A (9): 1101-1107 (2021)Competitive Diffusion on Weighted Graphs., , , , , , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 422-433. Springer, (2015)Sorting Balls and Water: Equivalence and Computational Complexity., , , , , , , , , and . FUN, volume 226 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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)Exact Algorithms for the Max-Min Dispersion Problem., , , , , , , , , and . FAW, volume 10823 of Lecture Notes in Computer Science, page 263-272. Springer, (2018)Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data., , and . SEA, volume 7276 of Lecture Notes in Computer Science, page 248-259. Springer, (2012)Ferrers dimension of grid intersection graphs, , , , and . Discrete Applied Mathematics, (2017)Computational Complexity of Competitive Diffusion on (Un)weighted Graphs., , , , , , , , and . CoRR, (2014)Bipartite Permutation Graphs are reconstructible., , and . Discret. Math. Algorithms Appl., (2012)