Diptarka Chakraborty, Raghunath Tewari. An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. In Khaled M. Elbassioni, Kazuhisa Makino, editors, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. Volume 9472 of Lecture Notes in Computer Science, pages 614-624, Springer, 2015. [doi]
Abstract is missing.