The following paper with authors from our group will appear at SODA 2023:
Map matching queries on realistic input graphs under the Fréchet distance by Gudmundsson, Seybold, and Wong
Online Min-Max Paging by Chiplunkar, Henzinger, Kale, and Vötsch
Almost Tight Error Bounds on Differentially Private Continual Counting by Henzinger, J. Upadhyay, and S. Upadhyay
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries by Bateni et al.
Fully Dynamic Exact Edge Connectivity in Sublinear Time by Goranci et al.
