An O(n½+?)-Space and Polynomial-Time Algorithm for Directed Planar Reachability | IEEE Conference Publication | IEEE Xplore