Univ.-Prof. Dr. Monika Henzinger (Deputy Speaker)

Full Professor (Computer Science), Deputy Speaker

Research areas in the program

  • Combinatorial Optimization
  • Dynamic Optimization
  • Parallel and Distributed Optimization

Keywords

  • combinatorial algorithms
  • efficient algorithms and data structures
  • approximation algorithms for combinatorial optimization problems

Research Interests

Combinatorial algorithms, especially on graphs, efficient algorithms and data structures, approximation algorithms for combinatorial optimization problems

Know-how and infrastructure of the research group

Monika Henzinger is a leading researcher in the area of combinatorial optimization and efficient algorithms and data structures. She is working on questions arising in graph algorithms, online algorithms, and approximation algorithms as well as graph games and algorithmic game theory. She is the principle investigator of the 2013 ERC Advanced Grant on graph algorithms and their applications.

In recent years she has focused on dynamic graph algorithms as well as optimization problems arising in computational biology, computer verification, and in internet advertisement. In a recent line of work (Henzinger, Krinninger, and Nanongkai 2013a, Henzinger, Krinninger, and Nanongkai 2013b, Henzinger, Krinninger, and Nanongkai 2014a, Henzinger, Krinninger, and Nanongkai 2014b,  Henzinger, Krinninger, and Nanongkai 2014c) she consecutively improved the running time for decremental graph algorithm for maintaining approximate shortest paths finally resulting in  the first decremental graph algorithm for maintaining approximate shortest paths in undirected weighted graphs that takes near-constant time per update (Henzinger, Krinninger, and Nanongkai 2014a) and the first such algorithm in directed weighted graphs that takes sublinear time per update   (Henzinger, Krinninger, and Nanongkai 2014b). 

She also gave the first constant-factor approximation algorithm for maximizing a submodular function under viablility constraints, which is a certain type of non-downward closed constraints arising in computational biology (Dvorak, Henzinger, and Williamson 2013). She also published a sequence of papers on optimization problems arising in internet advertising, especially in sponsored search auctions (Duetting, Henzinger, and Starnberger 2013, Duetting, Henzinger, and Weber 2013a, 2013b, Duetting, Henzinger, and Starnberger 2012, Colini-Baldeschi et al 2012, Henzinger and Vidali 2011, Feldman et al 2010).

She also gave recently the first decremental graph algorithm for maintaining approximate shortest paths in directed undirected uncapacitated graphs that takes sublinear time per update (Henzinger, Krinninger, and Nanongkai 2014). She also gave the first linear-time deterministic (1+ε) approximate shortest path algorithm (Henzinger, Krinninger, and Nanongkai 2013).She also recently gave the first constant-factor approximation algorithm for maximizing a submodular function under  viablility constraints, which is a certain type of non-downward closed constraints arising in computational biology (Dvorak, Henzinger, and Williamson 2013).

Collaborations within the VGSCO

With Vladimir Kolmogorov, Nysret Musliu and Günther Raidl on Combinatorial Optimization, with Birgit Rudloff on Dynamic Optimization and with Dan Alistarh on Parallel and Distributed Optimization.

Scientific CV

Study of Computer Science at the University of the Saarland (Saarbruecken), Diplom (1989), Ph.D. in Computer Science at Princeton University (1993). Assistant Professor Cornell University (1993-1996). Research Scientist at Digital Equipment Corporation (1996-1999). Associate Professor of Computer Science at the University of the Saarland (1999). Director of Research at Google Inc (1999-2005), Professor of Computer Science at the Ecole Polytechnique Federale de Lausanne (2005-2009). Professor of Computer Science at the University of Vienna (2009-2023). Since March 2023, Professor of Computer Science at the Institute of Science and Technology Austria.

Editor of two books, and author of more than 40 publications in refereed journals and over 60 publications in refereed conferences, such as:  Journal of the ACM, SIAM Journal of Computing,  Journal of Computer and System Sciences, Algorithmica, Journal of Algorithms, Theoretical Computer Science, IEEE Transactions on the Web,  IEEE Symposium on Foundations of Computer Science,  ACM Symposium on Theory of Computing, ACM/SIAM Symposium on Discrete Algorithms.

Publications

Showing entries 31 - 40 out of 149
Forster, S, Goranci, G & Henzinger, M 2021, Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. in ACM-SIAM Symposium on Discrete Algorithms (SODA21). ACM-SIAM Symposium on Discrete Algorithms, United States, 10/01/21. https://doi.org/10.1137/1.9781611976465.75
Goranci, G, Henzinger, M, Leniowski, D, Schulz, C & Svozil, A 2021, Fully Dynamic k-Center Clustering in Low Dimensional Metrics. in SIAM Symposium on Algorithm Engineering and Experiments. ALENEX 2021 : SIAM Symposium on Algorithm Engineering and Experiments, Alexandria, Virginia, United States, 10/01/21. https://doi.org/10.1137/1.9781611976472.11
Henzinger, M, Neumann, S, Räcke, H & Schmid, S 2021, Tight Bounds for Online Graph Partitioning. in ACM-SIAM Symposium on Discrete Algorithms (SODA). Symposium on Discrete Algorithms (SODA21), United States, 10/01/21. https://doi.org/10.1137/1.9781611976465.166
Henzinger, M, Krinninger, S & Nanongkai, D 2021, 'A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths', SIAM. Journal on Computing (SICOMP), vol. 50, no. 3, pp. 98-137. https://doi.org/10.1137/16M1097808
Chen, L, Goranci, G, Henzinger, M, Peng, R & Saranurak, T 2020, Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. in 61st Annual IEEE Symposium on Foundations of Computer Science. 61st Annual IEEE Symposium on Foundations of Computer Science, 16/11/20. <http://eprints.cs.univie.ac.at/6572/>
Henzinger, M, Noe, A, Schulz, C & Strash, D 2020, Finding All Global Minimum Cuts In Practice. in 28th Annual European Symposium on Algorithms (ESA 2020). European Symposium on Algorithms (ESA2020), PIsa, Italy, 7/09/20. <http://eprints.cs.univie.ac.at/6517/>
Henzinger, M, Khan, S, Paul, R & Schulz, C 2020, Dynamic Matching Algorithms in Practice. in F Grandoni, G Herman & P Sanders (eds), 28th Annual European Symposium on Algorithms (ESA 2020)., 58, European Symposium on Algorithms (ESA2020), PIsa, Italy, 7/09/20. https://doi.org/10.4230/LIPIcs.ESA.2020.58
Hanauer, K, Henzinger, M & Schulz, C 2020, Faster Fully Dynamic Transitive Closure in Practice. in 18th Symposium on Experimental Algorithms (SEA 2020). 18th Symposium on Experimental Algorithms (SEA 2020), Italy, 16/06/20. <http://eprints.cs.univie.ac.at/6345/>
Hanauer, K, Henzinger, M & Schulz, C 2020, Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. in G Blelloch & I Finocchi (eds), 2020 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020. pp. 106-119, ALENEX 2020, Salt Lake City, Utah, United States, 5/01/20. https://doi.org/10.1137/1.9781611976007.9
Henzinger, M, Noe, A & Schulz, C 2020, Shared-Memory Branch-and-Reduce for Multiterminal Cuts. in G Blelloch & I Finocchi (eds), 2020 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020. pp. 42-55, ALENEX 2020, Salt Lake City, Utah, United States, 5/01/20. https://doi.org/10.1137/1.9781611976007.4
Showing entries 31 - 40 out of 149
To top