Monika Henzinger

Monika Henzinger is a Full Professor of Computer Science at the Institute of Science and Technology Austria (IST Austria) and Deputy Speaker of the Vienna Graduate School on Computational Optimization. She holds a PhD from Princeton University and has held positions at Cornell University, Digital Equipment Corporation, Google, EPFL, and the University of Vienna. Her research focuses on combinatorial algorithms, dynamic optimization, and efficient graph algorithms. She leads a group at IST Austria exploring algorithm design for dynamic environments, privacy-preserving algorithms, and practical implementations of theoretical results.

Research Interests: Combinatorial algorithms (especially graphs), dynamic algorithms, approximation algorithms, algorithmic game theory, and privacy-preserving computation. Her work includes breakthroughs in decremental graph algorithms, submodular optimization, and computational advertising.

Collaborations: Works with Vladimir Kolmogorov, Nysret Musliu, Günther Raidl (Combinatorial Optimization), Birgit Rudloff (Dynamic Optimization), and Dan Alistarh (Parallel/Distributed Optimization).

Awards: Wittgenstein Award (2021), ERC Advanced Grants (2021, 2014), ACM Fellow (2016), and numerous others listed in her CV.

Grants & Labs: Principal investigator on an ERC Advanced Grant for graph algorithms. Her team includes PhD students (e.g., Bardiya Aryanfard, Antoine El-Hayek) and postdocs focused on algorithmic challenges in dynamic systems.