**Full Professor of Computer Science**

Faculty of Computer Science

University of Vienna

Waehringerstrasse 29/6.32

1090 Wien-Vienna, Austria

email: monika.henzinger [@] univie.ac.at

phone +43-1-4277-78310

**Research area in the programme**

Combinatorial optimization algorithms

**Keywords**

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

**Research interest **

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).

**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 -).

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.

**Collaborations within the programme **

With A. Neumaier on topics related to spectral techniques for optimization problems on graphs, with G. Raidl on topics related to efficient algorithms and with I. Bomze on computational game theory.

University of Vienna

Oskar-Morgenstern-Platz 1

1090 Vienna, Austria

T: +43-1-4277-386 31