Aaron Bernstein. Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 725-734, ACM, 2013. [doi]
Abstract is missing.