Floats, integers, and single source shortest paths

Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

All pairs shortest paths using bridging sets and rectangular matrix multiplication

Journal of the ACM (JACM)

Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms

Approximate distance oracles

Journal of the ACM (JACM)

Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Approximate distance oracles for graphs with dense clusters

Computational Geometry: Theory and Applications

I/O-efficient undirected shortest paths with unbounded edge lengths

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Estimating all pairs shortest paths in restricted graph families: a unified approach

Journal of Algorithms

Compact oracles for approximate distances around obstacles in the plane

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Approximate shortest path queries using Voronoi duals

Transactions on computational science IX

Approximate shortest path queries using Voronoi duals

Transactions on computational science IX

Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

Cache-oblivious planar shortest paths

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths

ACM Transactions on Algorithms (TALG)

Research paper: The saga of minimum spanning trees

Computer Science Review

Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs

Journal of Discrete Algorithms