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. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 440-452). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.28.