Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs.

Adam Karczmarz, Piotr Sankowski

Browse the full ICALP paper archive.