Tight bounds on the performance of dynamic directed cutset data structures based on OMv
N. Hahn, M. Henzinger, Z. Stefankovic, Information Processing Letters 195 (2026).

Exploring the optimization landscape of variational quantum algorithms
R.A. Medina Ramos, Exploring the Optimization Landscape of Variational Quantum Algorithms, Institute of Science and Technology Austria, 2024.

Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks
A. El-Hayek, M. Henzinger, S. Schmid, in:, Y. Tauman Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.

Stochastic processes with expected stopping time
K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021, pp. 1–13.

Deterministic dynamic matching in O(1) update time
S. Bhattacharya, D. Chakrabarty, M. Henzinger, Algorithmica 82 (2020) 1057–1080.

Maximizing a submodular function with viability constraints
W. Dvoák, M. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.

On multiple keyword sponsored search auctions with budgets
R. Colini-Baldeschi, S. Leonardi, M. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 4 (2015).

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.