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 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.