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 91 - 100 out of 149
Henzinger, M, Krinninger, S & Nanongkai, D 2016, 'Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization', SIAM journal on computing: a publication of the Society for Industrial and Applied Mathematics, vol. 45, no. 3, pp. 947-1006. https://doi.org/10.1137/140957299
Henzinger, M, Krinninger, S & Nanongkai, D 2016, A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. in Y Mansour & D Wichs (eds), STOC 2016: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing: Cambridge, MA, USA, June 19 - 21, 2016. ACM, New York, NY, pp. 489–498, STOC 2016: 48th Annual Symposium on the Theory of Computing, Cambridge, United States, 19/06/16. https://doi.org/10.1145/2897518.2897638
Bhattacharya, S, Henzinger, M & Nanongkai, D 2016, New Deterministic Approximation Algorithms for Fully Dynamic Matching. in Y Mansour & D Wichs (eds), STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery (ACM), New York, pp. 398–411, STOC 2016: 48th Annual Symposium on the Theory of Computing, Cambridge, United States, 19/06/16. https://doi.org/10.1145/2897518.2897568
Henzinger, M, Krinninger, S & Nanongkai, D 2016, Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. in M-Y Kao (ed.), Encyclopedia of Algorithms: 2016 Edition. Springer, New York, NY, pp. 600-602. https://doi.org/10.1007/978-1-4939-2864-4_565
Henzinger, M 2016, PageRank Algorithm. in M-Y Kao (ed.), Encyclopedia of Algorithms: 2016 Edition. Springer, New York, NY, pp. 1509-1511. https://doi.org/10.1007/978-1-4939-2864-4_277
Ben-Zwi, O, Henzinger, M & Loitzenbauer, V 2015, Ad Exchange: Envy-free Auctions with Mediators. in G Schäfer & E Markakis (eds), Web and Internet Economics - 11th International Conference, WINE 2015, Proceedings. Springer-Verlag Berlin-Heidelberg, Lecture Notes in Computer Science, vol. 9470, pp. 104-117, Conference on Web and Internet Economics (WINE 2015), Amsterdam, Netherlands, 9/12/15. https://doi.org/10.1007/978-3-662-48995-6_8
Cheung, YK, Henzinger, M, Hoefer, M & Starnberger, M 2015, Combinatorial Auctions with Conflict-Based Externalities. in G Schäfer & E Markakis (eds), Web and Internet Economics - 11th International Conference, WINE 2015, Proceedings. Springer-Verlag Berlin-Heidelberg, pp. 230-243, Conference on Web and Internet Economics (WINE 2015), Amsterdam, Netherlands, 9/12/15. https://doi.org/10.1007/978-3-662-48995-6_17
Dütting, P, Henzinger, M & Weber, I 2015, 'An Expressive Mechanism for Auctions on the Web', ACM Transactions on Economics and Computation, vol. 4, no. 1, 1, pp. 1-34. https://doi.org/10.1145/2716312
Colini-Baldeschi, R, Leonardi, S, Henzinger, M & Starnberger, M 2015, 'On Multiple Keyword Sponsored Search Auctions with Budgets', ACM Transactions on Economics and Computation, vol. 4, no. 1, 2, pp. 1-34. https://doi.org/10.1145/2818357
Bhattacharya, S, Henzinger, M & Italiano, GF 2015, Design of Dynamic Algorithms via Primal-Dual Method. in MM Halldorsson, N Kobayashi, B Speckmann & K Iwama (eds), Automata, Languages, and Programming: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015). Springer, Berlin, Heidelber, Lecture Notes in Computer Science, vol. 9134, Theoretical Computer Science and General Issues, vol. 9134, pp. 206-218, International Colloquium on Automata, Languages and Programming (ICALP 2015), Kyoto, Japan, 6/07/15. https://doi.org/10.1007/978-3-662-47672-7_17
Showing entries 91 - 100 out of 149
To top