Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Abstract is missing.