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 111 - 120 out of 149
Dvořák, W & Henzinger, M 2015, Online Ad Assignment with an Ad Exchange. in O Svensson & E Bampis (eds), Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers . Springer, Cham, Lecture Notes in Computer Science, vol. 8952, pp. 156-167, WAOA 2014: Approximation and Online Algorithms - 12th International Workshop, Wroclaw, Poland, 11/09/14. https://doi.org/10.1007/978-3-319-18263-6_14
Cigler, L, Dvorák, W, Henzinger, M & Starnberger, M 2014, Limiting Price Discrimination when Selling Products with Positive Network Externalities. in TY Liu, Q Qi & Y Ye (eds), WINE 2014: The 10th Conference on Web and Internet Economics. Springer, Cham, Lecture Notes in Computer Science, vol. 8877, pp. 44-57, WINE 2014 - The 10th Conference on Web and Internet Economics, Beijing, China, 14/01/14. https://doi.org/10.1007/978-3-319-13129-0_4
Chatterjee, K, Henzinger, M, Krinninger, S & Nanongkai, D 2014, 'Polynomial-Time Algorithms for Energy Games with Special Weight Structures', Algorithmica: an international journal in computer science, vol. 70, no. 3, pp. 457-492. https://doi.org/10.1007/s00453-013-9843-7
Henzinger, M, Krinninger, S & Nanongkai, D 2014, Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS: 55th Annual IEEE Symposium on Foundations of Computer Science, October 18-21, 2014. pp. 146-155, IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), Pennsylvania, United States, 19/01/14. https://doi.org/10.1109/FOCS.2014.24
Charikar, M, Henzinger, M & Nguyên, HL 2014, Online Bipartite Matching with Decomposable Weights. in Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings: 22nd European Symposium on Algorithms, September 8–10, 2014, Wrocław, Poland. pp. 260-271, 22nd European Symposium on Algorithms (ESA 2014), Wrocław, Poland, 8/09/14. https://doi.org/10.1007/978-3-662-44777-2_22
Chatterjee, K, Henzinger, M, Krinninger, S, Loitzenbauer, V & Raskin, MA 2014, 'Approximating the minimum cycle mean', Theoretical Computer Science, vol. 547, no. C, pp. 104-116. https://doi.org/10.1016/j.tcs.2014.06.031
Henzinger, M, Krinninger, S & Nanongkai, D 2014, Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. in STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. pp. 674-683, 46th ACM Symposium on Theory of Computing (STOC 2014), New York, United States, 31/05/14. https://doi.org/10.1145/2591796.2591869
Chatterjee, K & Henzinger, M 2014, 'Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-component Decomposition', Journal of the Association for Computing Machinery, vol. 61, no. 3, 15, pp. 1-40. https://doi.org/10.1145/2597631
Henzinger, M, Krinninger, S & Nanongkai, D 2014, A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. in Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014: January 5-7, . SIAM, Philadelphia, pp. 1053-1072, SODA 2014:Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, Portland, Oregon, United States, 5/01/14. https://doi.org/10.1137/1.9781611973402.79
Dütting, P, Henzinger, M & Starnberger, M 2013, Valuation Compressions in VCG-Based Combinatorial Auctions. in Y Chen & N Immorlica (eds), WINE: Web and Internet Economics - 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings. Springer, Berlin Heidelberg, Lecture Notes in Computer Science, vol. 8289, pp. 146-159. https://doi.org/10.1007/978-3-642-45046-4
Showing entries 111 - 120 out of 149
To top