Goranci, Gramoz, et al. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.”10.4230/LIPIcs.ITCS.2024.55__15th Innovations in Theoretical Computer Science Conference, vol. 287, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ITCS.2024.55.

Henzinger, Monika H., et al. “Experimental Evaluation of Fully Dynamic K-Means via Coresets.”10.1137/1.9781611977929.17__2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial &; Applied Mathematics, 2024, pp. 220–33, doi:10.1137/1.9781611977929.17.

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

Cultrera di Montesano, Sebastiano, et al. “Dynamically Maintaining the Persistent Homology of Time Series.”10.1137/1.9781611977912.11__Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), edited by David P. Woodruff, Society for Industrial and Applied Mathematics, 2024, pp. 243–95, doi:10.1137/1.9781611977912.11.

Henzinger, Monika H., et al. “A Unifying Framework for Differentially Private Sums under Continual Observation.”10.1137/1.9781611977912.38__Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2024, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018, doi:10.1137/1.9781611977912.38.

Henzinger, Monika H., et al. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.”10.4230/LIPIcs.STACS.2023.36__40th International Symposium on Theoretical Aspects of Computer Science, vol. 254, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.STACS.2023.36.

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

Henzinger, Monika H., et al. “Faster Submodular Maximization for Several Classes of Matroids.”10.4230/LIPIcs.ICALP.2023.74__50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74.

Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.

Bhattacharya, Sayan, et al. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.”10.1137/21M1428649__SIAM Journal on Computing, vol. 52, no. 5, Society for Industrial and Applied Mathematics, 2023, pp. 1132–92, doi:10.1137/21M1428649.

Cohen-Addad, Vincent, et al. “Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.”10.1109/focs57990.2023.00066__2023 IEEE 64th Annual Symposium on Foundations of Computer Science, IEEE, 2023, pp. 1105–30, doi:10.1109/focs57990.2023.00066.

Henzinger, Monika H., et al. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.”10.1007/s00453-023-01154-8__Algorithmica, vol. 85, Springer Nature, 2023, pp. 2680–3716, doi:10.1007/s00453-023-01154-8.

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

Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” 37th Conference on Neural Information Processing Systems, vol. 36, 2023.