Improved *Deterministic* Algorithms for Partially Dynamic Shortest Paths

In this talk I will present the first *deterministic* decremental SSSP algorithm that breaks the Even-Shiloach bound of O(mn) total update time, for unweighted and undirected graphs.
Joint work with: Aaron Bernstein