The following three papers were accepted to the ACM-SIAM Symposium on Discrete Algorithms  SODA24:

• “Dynamic algorithms for k-center on graphs” by Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari, and Antonis Skarlatos (preprint on  arXiv)
• “Fast 2-Approximate All-Pairs Shortest Paths” by Michal Dory, Sebastian Forster, Yael Kirkpatrick, Yasamin Nazari, Virginia Vassilevska Williams, and Tijn de Vos (preprint on  arXiv)
• “On Dynamic Graph Algorithms with Predictions” byJan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak (preprint on  arXiv)