Goranci, Gramoz, Monika H Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.”https://doi.org/10.4230/LIPIcs.ITCS.2024.55__In 15th Innovations in Theoretical Computer Science Conference, Vol. 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.ITCS.2024.55 .

Henzinger, Monika H, David Saulpic, and Leonhard Sidl. “Experimental Evaluation of Fully Dynamic K-Means via Coresets.”https://doi.org/10.1137/1.9781611977929.17__In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, 220–33. Society for Industrial &; Applied Mathematics, 2024.https://doi.org/10.1137/1.9781611977929.17 .

Zheng, Da Wei, and Monika H Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.”https://doi.org/10.1007/s10107-024-02066-3__Mathematical Programming. Springer Nature, 2024.https://doi.org/10.1007/s10107-024-02066-3 .

Cultrera di Montesano, Sebastiano, Herbert Edelsbrunner, Monika H Henzinger, and Lara Ost. “Dynamically Maintaining the Persistent Homology of Time Series.”https://doi.org/10.1137/1.9781611977912.11__In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), edited by David P. Woodruff, 243–95. Society for Industrial and Applied Mathematics, 2024.https://doi.org/10.1137/1.9781611977912.11 .

Henzinger, Monika H, Jalaj Upadhyay, and Sarvagya Upadhyay. “A Unifying Framework for Differentially Private Sums under Continual Observation.”https://doi.org/10.1137/1.9781611977912.38__In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, 2024:995–1018. Society for Industrial and Applied Mathematics, 2024.https://doi.org/10.1137/1.9781611977912.38 .

Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.”https://doi.org/10.4230/LIPIcs.STACS.2023.36__In 40th International Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.STACS.2023.36 .

Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.”https://doi.org/10.4230/LIPIcs.ICALP.2023.69__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.69 .

Henzinger, Monika H, Paul Liu, Jan Vondrák, and Da Wei Zheng. “Faster Submodular Maximization for Several Classes of Matroids.”https://doi.org/10.4230/LIPIcs.ICALP.2023.74__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.74 .

Fichtenberger, Hendrik, Monika H Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In Proceedings of the 40th International Conference on Machine Learning, 202:10072–92. ML Research Press, 2023.

Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.”https://doi.org/10.1137/21M1428649__SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023.https://doi.org/10.1137/21M1428649 .

Cohen-Addad, Vincent, David Saulpic, and Chris Schwiegelshohn. “Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.”https://doi.org/10.1109/focs57990.2023.00066__In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, 1105–30. IEEE, 2023.https://doi.org/10.1109/focs57990.2023.00066 .

Henzinger, Monika H, Billy Jin, Richard Peng, and David P. Williamson. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.”https://doi.org/10.1007/s00453-023-01154-8__Algorithmica. Springer Nature, 2023.https://doi.org/10.1007/s00453-023-01154-8 .

Zheng, Da Wei, and Monika H Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.”https://doi.org/10.1007/978-3-031-32726-1_32__In International Conference on Integer Programming and Combinatorial Optimization, 13904:453–65. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-32726-1_32 .

Charikar, Moses, Lunjia Hu, Monika H Henzinger, Maximilian Vötsch, and Erik Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” In 37th Conference on Neural Information Processing Systems, Vol. 36, 2023.