Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Kotaro Nakagawa
Observed names:
Kotaro NAKAGAWA,
Nakagawa, Kotaro,
Nakagawa, Koutarou
Institution:
Tokyo Institute of Technology
Observed institution:
Tokyo Institute of Technology
OpenAlex ID:
A5021579897
An O(n½+?)-Space and Polynomial-Time Algorithm for Directed Planar Reachability
2013
·
Tatsuya Imai
, Kotaro Nakagawa
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
27
$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
2014
·
Tetsuo Asano
, David Kirkpatrick
, et al.
·
Lecture notes in computer science
·
20
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.
2014
·
Tetsuo Asano
, David Kirkpatrick
, et al.
·
Mathematical Foundations of Computer Science
·
19
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs.
2019
·
Ryo Ashida
, Tatsuya Imai
, et al.
·
Electronic colloquium on computational complexity
·
4
O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem
2018
·
Ashida, Ryo
, Nakagawa, Kotaro
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
An O ( n 1/2+ε )-Space and Polynomial-Time Algorithm for Directed Planar Reachability
2013
·
Tatsuya Imai
, Kotaro Nakagawa
, et al.
·
研究報告アルゴリズム(AL)
·
4
O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability Problem.
2014
·
Tetsuo Asano
, David Kirkpatrick
, et al.
·
Electronic colloquium on computational complexity
·
3
The First Eigenvalue of (c,d)-Regular Graph
2013
·
Kotaro NAKAGAWA
, Hiroki YAMAGUCHI
·
IEICE Transactions on Information and Systems
·
1
PDF
O(n^{1/3})-space algorithm for the grid graph reachability problem
2017
·
Ryo Ashida
, Kotaro Nakagawa
·
arXiv (Cornell University)
An O(n[1/2+ε])-Space and Polynomial-Time Algorithm for Directed Planar Reachability (コンピュテーション)
2013
·
Tatsuya Imai
, Kotaro Nakagawa
, et al.
·
電子情報通信学会技術研究報告. COMP, コンピュテーション
Show more works
View as search
Works count:
13
Citation count:
82
H-index:
4
I10-index:
3
Year
Topic
Type