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.

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.

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.

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.

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.

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.

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.

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.

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.

Constant-time Dynamic ( +1)-Coloring
M.H. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).

Recent advances in fully dynamic graph algorithms
K. Hanauer, M.H. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

Fully dynamic four-vertex subgraph counting
K. Hanauer, M.H. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

The complexity of average-case dynamic subgraph counting
M.H. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498.

Practical fully dynamic minimum cut algorithms
M.H. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26.

Incremental approximate maximum flow in m1/2+o(1) update time
G. Goranci, M.H. Henzinger, ArXiv (n.d.).

On the complexity of weight-dynamic network algorithms
M.H. Henzinger, A. Paz, S. Schmid, in:, IFIP Networking Conference, Institute of Electrical and Electronics Engineers, 2021.

A deamortization approach for dynamic spanner and dynamic maximal matching
A. Bernstein, S. Forster, M.H. Henzinger, ACM Transactions on Algorithms 17 (2021).

Constant-time dynamic weight approximation for minimum spanning forest
M.H. Henzinger, P. Peng, Information and Computation 281 (2021).

Upper and lower bounds for fully retroactive graph problems
M.H. Henzinger, X. Wu, in:, 17th International Symposium on Algorithms and Data Structures, Springer Nature, 2021, pp. 471–484.

Differentially private algorithms for graphs under continual observation
H. Fichtenberger, M.H. Henzinger, W. Ost, in:, 29th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.