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

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

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

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

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

Delegated online search
P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).
LibreCat: https://research-explorer.ista.ac.at/record/17188
DOI: 10.1016/j.artint.2024.104171
arXiv: 2203.01084

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

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

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

Constant matters: Fine-grained error bound on differentially private continual observation
H. Fichtenberger, M.H. Henzinger, J. Upadhyay, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.
LibreCat: https://research-explorer.ista.ac.at/record/14462

Deterministic near-optimal approximation algorithms for dynamic set cover
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, SIAM Journal on Computing 52 (2023) 1132–1192.
LibreCat: https://research-explorer.ista.ac.at/record/14558
DOI: 10.1137/21M1428649

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

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

Multiplicative auction algorithm for approximate maximum weight bipartite matching
D.W. Zheng, M.H. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465.
LibreCat: https://research-explorer.ista.ac.at/record/13236
DOI: 10.1007/978-3-031-32726-1_32
arXiv: 2301.09217

Simple, scalable and effective clustering via one-dimensional projections
M. Charikar, L. Hu, M.H. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference on Neural Information Processing Systems, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15364
arXiv: 2310.16752