5 papers at SODA 2021

The following papers were accepted to the ACM-SIAM Symposium on Discrete Algorithm 2021:


"Dynamic Maintenance of Low-Stretch Probailistic Tree Embeddings with Applications" by Sebastian Forster, Gramoz Goranci, and Monika Henzinger.

"Dynamic Set Cover: Improved Amortized and Worst-Case Update Times" by Sayan Bhattacharys, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu.

"Tight Bounds for Online Graph Partitioning" by Monika Henzinger, Stefan Neumann, Harald Raecke, and Stefan Schmid.

"New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners" by Thiago Bergamaschi, Monika Henzinger, Maximilian Probst, Virginia Vassilevska Williams,and Nicole Wein.

"Consistent k-Clustering for General Metrics" by Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard,and Ola Svensson