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]
@inproceedings{Bernstein13-2,
title = {Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]},
author = {Aaron Bernstein},
year = {2013},
doi = {10.1145/2488608.2488701},
url = {http://doi.acm.org/10.1145/2488608.2488701},
researchr = {https://researchr.org/publication/Bernstein13-2},
cites = {0},
citedby = {0},
pages = {725-734},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
publisher = {ACM},
isbn = {978-1-4503-2029-0},
}