Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs [PDF]

Near Linear Time (1+e) – Approximation for Restricted Shortest Paths in Undirected Graphs [PDF]

Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions (with Liam Roditty) [PDF]

A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs [PDF]

Fully Dynamic (2 +)-Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time [PDF]

A Nearly Optimal Oracle for Avoiding Failed Vertices and Edges (with David Karger)[PDF]

Improved Distance Sensitivity Oracles via Random Sampling (with David Karger) [PDF]