Given a graph G and two vertices s and t in it, {\em graph reachability} is the problem of checking whether there exists a path from s to t in G. We show that reachability in directed layered planar graphs can be decided in polynomial time and O(n^\epsilon) space, for ... more >>>