The following publications are possibly variants of this publication:
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update TimeMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. JACM, 65(6), 2018. [doi]
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphsMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. stoc 2014: 674-683 [doi]
- A Subquadratic-Time Algorithm for Decremental Single-Source Shortest PathsMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. soda 2014: 1053-1072 [doi]
- Negative-Weight Single-Source Shortest Paths in Near-linear TimeAaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen. focs 2022: 600-611 [doi]