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 71 - 80 out of 149
Chatterjee, K, Dvovrák, W, Henzinger, M & Loitzenbauer, V 2018, Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. in A Czumaj (ed.), 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. SIAM, Philadelphia, Pennsylvania, pp. 2341-2356, SODA 2018, New Orleans, United States, 7/01/18. https://doi.org/10.1137/1.9781611975031.151
Henzinger, M, Krinninger, S & Nanongkai, D 2017, 'Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks', ACM Transactions on Algorithms, vol. 13, no. 4, 51, pp. 1-24. https://doi.org/10.1145/3146550
Bhattacharya, S, Dvovrák, W, Henzinger, M & Starnberger, M 2017, 'Welfare Maximization with Friends-of-Friends Network Externalities', Theory of Computing Systems, vol. 61, no. 4, pp. 948–986. https://doi.org/10.1007/s00224-017-9759-8
Goranci, G, Henzinger, M & Peng, P 2017, The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. in K Pruhs & C Sohler (eds), 25th Annual European Symposium on Algorithms (ESA 2017)., 45, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Dagstuhl, Leibniz International Proceedings in Informatics (LIPIcs), vol. 87, pp. 45:1-45:14. https://doi.org/10.4230/LIPIcs.ESA.2017.45
Goranci, G, Henzinger, M & Peng, P 2017, Improved Guarantees for Vertex Sparsification in Planar Graphs. in K Pruhs & C Sohler (eds), 25th Annual European Symposium on Algorithms (ESA 2017)., 44, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Dagstuhl, Leibniz International Proceedings in Informatics (LIPIcs), vol. 87, pp. 1-44, ESA 2017: European Symposium on Algorithms, Vienna, Austria, 4/09/17. https://doi.org/10.4230/LIPIcs.ESA.2017.44
Wang, D, Fountoulakis, K, Henzinger, M, Mahoney, MW & Rao, S 2017, Capacity Releasing Diffusion for Speed and Locality. in Proceedings of the 34th International Conference on Machine Learning. MLResearchPress, Proceedings of Machine Learning Research, vol. 2017, pp. 3598-3607, ICML 2017: 34th International Conference on Machine Learning, Sydney, New South Wales, Australia, 6/08/17. <https://proceedings.mlr.press/v70/wang17b.html>
Bhattacharya, S, Chakrabarty, D & Henzinger, M 2017, Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. in F Eisenbrand & J Koenemann (eds), Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Proceedings. Springer, Cham, Lecture Notes in Computer Science, vol. 10328, pp. 86-98, IPCO 2017: Integer Programming and Combinatorial Optimization - 19th International Conference, Ontario, Canada, 26/06/17. https://doi.org/10.1007/978-3-319-59250-3_8
Bhattacharya, S, Henzinger, M & Nanongkai, D 2017, Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log 3 n) Worst Case Update Time. in PN Klein (ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. SIAM, pp. 470-489, SODA 2017, Barcelona, Spain, 16/01/17. https://doi.org/10.1137/1.9781611974782.30
Henzinger, M, Rao, S & Wang, D 2017, Local Flow Partitioning for Faster Edge Connectivity. in PN Klein (ed.), Proceedings. Society for Industrial and Applied Mathematics, Philadelphia, pp. 1919-1938, SODA 2017, Barcelona, Spain, 16/01/17. https://doi.org/10.1137/1.9781611974782.125
Dvořák, W, Henzinger, M & Williamson, DP 2017, 'Maximizing a Submodular Function with Viability Constraints', Algorithmica: an international journal in computer science, vol. 77, no. 1, pp. 152–172. https://doi.org/10.1007/s00453-015-0066-y
Showing entries 71 - 80 out of 149
To top