Goranci, G., Henzinger, M. H., Räcke, H., Sachdeva, S., &; Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2024.55 
LibreCat: https://research-explorer.ista.ac.at/record/15008
DOI: 10.4230/LIPIcs.ITCS.2024.55
arXiv: 2303.02491

Henzinger, M. H., Saulpic, D., &; Sidl, L. (2024). Experimental evaluation of fully dynamic k-means via coresets. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (pp. 220–233). Alexandria, VA, United States: Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/1.9781611977929.17 
LibreCat: https://research-explorer.ista.ac.at/record/14769
DOI: 10.1137/1.9781611977929.17
arXiv: 2310.18034

Zheng, D. W., &; Henzinger, M. H. (2024). Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. Springer Nature.https://doi.org/10.1007/s10107-024-02066-3 
LibreCat: https://research-explorer.ista.ac.at/record/15121
DOI: 10.1007/s10107-024-02066-3
arXiv: 2301.09217

Cultrera di Montesano, S., Edelsbrunner, H., Henzinger, M. H., &; Ost, L. (2024). Dynamically maintaining the persistent homology of time series. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 243–295). Alexandria, VA, USA: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977912.11 
LibreCat: https://research-explorer.ista.ac.at/record/15093
DOI: 10.1137/1.9781611977912.11
arXiv: 2311.01115

Henzinger, M. H., Upadhyay, J., &; Upadhyay, S. (2024). A unifying framework for differentially private sums under continual observation. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2024, pp. 995–1018). Alexandria, VA, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977912.38 
LibreCat: https://research-explorer.ista.ac.at/record/15253
DOI: 10.1137/1.9781611977912.38
arXiv: 2307.08970

Henzinger, M. H., Neumann, S., Räcke, H., &; Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2023.36 
LibreCat: https://research-explorer.ista.ac.at/record/12760
DOI: 10.4230/LIPIcs.STACS.2023.36
arXiv: 2301.01744

Goranci, G., &; Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.69 
LibreCat: https://research-explorer.ista.ac.at/record/14085
DOI: 10.4230/LIPIcs.ICALP.2023.69

Henzinger, M. H., Liu, P., Vondrák, J., &; Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.74 
LibreCat: https://research-explorer.ista.ac.at/record/14086
DOI: 10.4230/LIPIcs.ICALP.2023.74
arXiv: 2305.00122

Fichtenberger, H., Henzinger, M. H., &; Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.
LibreCat: https://research-explorer.ista.ac.at/record/14462

Bhattacharya, S., Henzinger, M. H., Nanongkai, D., &; Wu, X. (2023). Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. Society for Industrial and Applied Mathematics.https://doi.org/10.1137/21M1428649 
LibreCat: https://research-explorer.ista.ac.at/record/14558
DOI: 10.1137/21M1428649

Cohen-Addad, V., Saulpic, D., &; Schwiegelshohn, C. (2023). Deterministic clustering in high dimensional spaces: Sketches and approximation. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (pp. 1105–1130). Santa Cruz, CA, United States: IEEE.https://doi.org/10.1109/focs57990.2023.00066 
LibreCat: https://research-explorer.ista.ac.at/record/14768
DOI: 10.1109/focs57990.2023.00066
arXiv: 2310.04076

Henzinger, M. H., Jin, B., Peng, R., &; Williamson, D. P. (2023). A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. Springer Nature.https://doi.org/10.1007/s00453-023-01154-8 
LibreCat: https://research-explorer.ista.ac.at/record/14043
DOI: 10.1007/s00453-023-01154-8
WoS: 001041254900002
arXiv: 2010.16316

Zheng, D. W., &; Henzinger, M. H. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature.https://doi.org/10.1007/978-3-031-32726-1_32 
LibreCat: https://research-explorer.ista.ac.at/record/13236
DOI: 10.1007/978-3-031-32726-1_32
arXiv: 2301.09217

Charikar, M., Hu, L., Henzinger, M. H., Vötsch, M., &; Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In 37th Conference on Neural Information Processing Systems (Vol. 36). New Orleans, LA, United States.
LibreCat: https://research-explorer.ista.ac.at/record/15364
arXiv: 2310.16752