Aaron Bernstein, Shiri Chechik. Deterministic decremental single source shortest paths: beyond the o(mn) bound. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 389-397, ACM, 2016. [doi]
Abstract is missing.