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 131 - 140 out of 149
Dütting, P, Henzinger, M & Weber, I 2012, Maximizing revenue from strategic recommendations under decaying trust. in CIKM '12: Proceedings of the 21st ACM International Conference on Information and Knowledge Management. Association for Computing Machinery (ACM), New York, pp. 2283-2286.
Colini-Baldeschi, R, Henzinger, M, Leonardi, S & Starnberger, M 2012, On Multiple Keyword Sponsored Search Auctions with Budgets. in A Czumaj, K Mehlhorn, A Pitts & R Wattenhofer (eds), Automata, Languages and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II. Springer-Verlag Berlin-Heidelberg, Berlin Heidelberg, pp. 1-12. https://doi.org/10.1007/978-3-642-31585-5_1
Chatterjee, K, Henzinger, M, Krinninger, S & Nanongkai, D 2012, Polynomial-Time algorithms for energy games with special weight structures. in L Epstein & P Ferragina (eds), Algorithms -- ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Springer-Verlag Berlin-Heidelberg, Berlin Heidelberg, pp. 301-312. https://doi.org/10.1007/978-3-642-33090-2_27
Baykan, E, Henzinger, M, Marian, L & Weber, I 2011, 'A Comprehensive Study of Features and Algorithms for URL-based Topic Classification.', ACM Transactions on the Web, vol. 5, no. 3, pp. 1-29.
Dütting, P, Henzinger, M & Weber, I 2011, An Expressive Mechanism for Auctions on the Web. in S Srinivasan, K Ramamritham, A Kumar, MP Ravindra, E Bertino & R Kumar (eds), WWW: Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011. Association for Computing Machinery (ACM), New York, pp. 127-136.
Henzinger, M & Chatterjee, K 2011, Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification. in D Randall (ed.), SODA: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. SIAM, Philadelphia, pp. 1318-1336.
Henzinger, M & Vidali, A 2011, Multi-parameter mechanism design under budget and matroid constraints. in Algorithms - ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Springer, Berlin Heidelberg, Lecture Notes in Computer Science, vol. 6942, pp. 192-202. https://doi.org/10.1007/978-3-642-23719-5
Dütting, P, Henzinger, M & Weber, I 2011, 'Offline file assignments for online load balancing', Information Processing Letters, vol. 111, no. 4, pp. 178-183.
Chatterjee, K, Henzinger, M, Manas, J & Nisarg, S 2011, Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. in G Gopalakrishnan & S Qadeer (eds), CAV: Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. Springer, Berlin Heidelberg, Lecture Notes in Computer Science, vol. 6806, pp. 260-276. https://doi.org/10.1007/978-3-642-22110-1_21
Henzinger, M 2010, How Much is Your Personal Recommendation Worth? in Proc. WWW 2010. Unknown publisher.
Showing entries 131 - 140 out of 149
To top