( en | de | ru )

 

Disambiguation of "Nakagawa, Kotaro"

Author of the publication

copydeleteadd this publication to your clipboard
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.

, , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 45-56. Springer, (2014)

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.

Koshiro Nakagawa

Kotaro Okayama

Kotaro Takahashi

Julia Nakagawa

Kotaro Okayama

 

Other publications of authors with the same name

Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability., , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 45-56. Springer, (2014)A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs., , , , , and . Electron. Colloquium Comput. Complex., (2019)O~(n^1/3)-Space Algorithm for the Grid Graph Reachability Problem., and . SoCG, volume 99 of LIPIcs, page 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The First Eigenvalue of (c, d)-Regular Graph., and . IEICE Trans. Inf. Syst., 96-D (3): 433-442 (2013)An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability., , , , and . CCC, page 277-286. IEEE Computer Society, (2013)