Krinninger, Sebastian Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Abraham, I., Chechik, S., & Krinninger, S. (2017). Fully Dynamic All-pairs Shortest Paths with Worst-case Update-time Revisited. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 440-452). Philadelphia, PA: SIAM.