1. Deterministic combinatorial replacement paths and distance sensitivity oracles;Alon,2019
2. Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs;Baswana;Algorithmica,2013
3. Improved distance sensitivity oracles via random sampling;Bernstein,2008
4. A nearly optimal oracle for avoiding failed vertices and edges;Bernstein,2009
5. Compact and fast sensitivity oracles for single-source distances;Bilò,2016