Diptarka Chakraborty, Raghunath Tewari. An $O(n^{\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC), 22:16, 2015. [doi]
@article{ChakrabortyT15-0,
title = {An $O(n^{\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs},
author = {Diptarka Chakraborty and Raghunath Tewari},
year = {2015},
url = {http://eccc.hpi-web.de/report/2015/016},
researchr = {https://researchr.org/publication/ChakrabortyT15-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {22},
pages = {16},
}