Kotaro Nakagawa

According to our database, Kotaro Nakagawa authored at least 7 papers between 2013 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs.

Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe

Electron. Colloquium Comput. Complex., 2019

2018

O͂(n^1/3)-Space Algorithm for the Grid Graph Reachability Problem.

Ryo Ashida, Kotaro Nakagawa

CoRR, 2018

O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem.

Ryo Ashida, Kotaro Nakagawa

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2014

O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem.

Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe

Electron. Colloquium Comput. Complex., 2014

Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.

Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

The First Eigenvalue of (<i>c</i>, <i>d</i>)-Regular Graph.

Kotaro Nakagawa, Hiroki Yamaguchi

IEICE Trans. Inf. Syst., 2013

An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability.

Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe

Proceedings of the 28th Conference on Computational Complexity, 2013