Four of the group’s recent research papers were accepted to the ACM-SIAM Symposium on Discrete Algorithms (SODA25):

• “Dynamic Consistent k-Center Clustering with Optimal Recourse” by Sebastian Forster and Antonis Skarlatos
• “Matching Composition and Efficient Weight Reduction in Dynamic Matching” by Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, and Ta-Wei Tu (preprint on  arXiv)
• “Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs” by Aditi Dudeja, Rashmika Goswami, and Michael Saks (preprint on  arXiv)
• “Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity” by Tijn de Vos ⓡ Aleksander B. G. Christiansen (preprint on  arXiv)