O (n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem. - Ryo Ashida; Kotaro Nakagawa (SoCG, 2018)

O͂(n1/3)-Space Algorithm for the Grid Graph Reachability Problem. - Ryo Ashida; Kotaro Nakagawa (CoRR, 2018)

A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. - Ryo Ashida; Tatsuya Imai; Kotaro Nakagawa; A. Pavan 001; N. V. Vinodchandran; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2019)

A Space-Efficient Separator Algorithm for Planar Graphs. - Ryo Ashida; Sebastian Kuhnert; Osamu Watanabe 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)