Publisher
Springer International Publishing
Reference12 articles.
1. Allender, E., Mahajan, M.: The complexity of planarity testing. Inf. Comput. 189(1), 117–134 (2004)
2. Asano, T., Doerr, B.: Memory-constrained algorithms for shortest path problem. In: Proceedings of the 23rd CCCG (2011)
3. Lecture Notes in Computer Science;T Asano,2014
4. Ashida, R., Kuhnert, S., Watanabe, O.: A space-efficient separator algorithm for planar graphs. IEICE Trans. Fundam. E102–A(9), 1007–1016 (2019). A version with a simplified proof is available from Tokyo Tech Research Repository, search “T2R2 Osamu Watanabe.”
5. Ashida, R., Nakagawa, K.: $$\widetilde{O}$$$$(n^{1/3})$$–space algorithm for the grid graph reachability problem. In: Proceedings of the 34th SoCG, pp. 5:1–5:13 (2018)