Average-case complexity of shortest-paths problems in the vertex-potential model

Single-source shortest-paths on arbitrary directed graphs in linear average-case time

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Δ-stepping: a parallelizable shortest path algorithm

Journal of 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

Approximating the statistics of various properties in randomly weighted graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

All-pairs shortest paths in O(n2) time with high probability

Journal of the ACM (JACM)