Kotaro Nakagawatokyo institute of technology关注立即认领分享关注立即认领分享基本信息浏览量:14职业迁徙个人简介暂无内容研究兴趣论文共 12 篇作者统计合作学者相似作者按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选时间引用量主题期刊级别合作者合作机构A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs Ryo Ashida,Tatsuya Imai,Kotaro Nakagawa,A. Pavan,N. V. Vinodchandran,Osamu WatanabeElectronic Colloquium on Computational Complexity (ECCC)(2019)引用23浏览0EI引用230$\tilde{O}(n^{1/3})$-Space Algorithm for the Grid Graph Reachability ProblemAshida Ryo,Nakagawa Kotaroarxiv(2019)引用0浏览0引用00O˜(n1/3)O~(n1/3)widetilde{O}(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem Ryo Ashida,Kotaro Nakagawasymposium on computational geometry(2018)引用23浏览0引用230O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem Ryo Ashida,Kotaro NakagawaCoRR(2018)引用23浏览0EI引用230$\widetilde{O}(\sqrt{n})$-Space and Polynomial-Time Algorithm for Planar Directed Graph ReachabilityTetsuo Asano,David Kirkpatrick,Kotaro Nakagawa,Osamu Watanabemathematical foundations of computer science(2014)引用15浏览0引用150(O)over-tilde(root n)-Space and Polynomial-Time Algorithm for Planar Directed Graph ReachabilityTetsuo Asano,David Kirkpatrick,Kotaro Nakagawa,Osamu WatanabeLecture Notes in Computer Science(2014)引用0浏览0引用00O(sqrt(n))-Space and Polynomial-time Algorithm for the Planar Directed Graph Reachability ProblemTetsuo Asano,David G. Kirkpatrick,Kotaro Nakagawa,Osamu WatanabeElectronic Colloquium on Computational Complexity (ECCC)(2014)引用25浏览0EI引用250Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph ReachabilityTetsuo Asano,David G. Kirkpatrick,Kotaro Nakagawa,Osamu WatanabeMFCS(2014)引用36浏览0EI引用360The First Eigenvalue Of (C, D)-Regular GraphKotaro Nakagawa,Hiroki YamaguchiIEICE TRANSACTIONS ON INFORMATION AND SYSTEMS(2013)引用0浏览0EI引用00An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar ReachabilityTatsuya Imai,Kotaro Nakagawa,Aduri Pavan,N. V. Vinodchandran,Osamu WatanabeIEEE Conference on Computational Complexity(2013)引用28浏览0EIWOS引用280加载更多作者统计合作学者合作机构D-Core合作者学生导师暂无相似学者,你可以通过学者研究领域进行搜索筛选数据免责声明页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn