An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments

Shortest paths in an arrangement with k line orientations

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Computing shortest paths with comparisons and additions

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Topological Peeling and Implementation

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

An Experimental Study and Comparison of Topological Peeling and Topological Walk

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

Finding an Optimal Path without Growing the Tree

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

Finding an optimal path without growing the tree

Journal of Algorithms

Approximate distance oracles for graphs with dense clusters

Computational Geometry: Theory and Applications