Monika Henzinger

Digital Library

ACM Athena Lecturer Award

Austria - 2026

citation

For outstanding contributions to the fields of dynamic graph algorithms and web algorithms

Monika Henzinger’s research focuses on the design and analysis of efficient algorithms for processing large, dynamic data. Her work spans fundamental areas of computer science, including graph algorithms, data structures, information retrieval, and web search technologies, and many of her contributions have made their way into standard textbooks. She developed the first linear-time algorithms for a variety of algorithmic problems such as computing shortest paths in planar graphs.

She has made significant contributions to dynamic algorithms, which maintain solutions efficiently as data changes, particularly in network and graph settings, establishing, for example, the first poly-logarithmic upper and lower bounds in the time per operation for the fundamental problem of graph connectivity.

A major theme in her research is handling massive, real-world datasets such as web graphs and social networks. She contributed to early developments in web search and link analysis, helping shape modern search engine technology. For her seminal contributions she was award the SIGIR Test of Time Award in 2017 and she is the co-inventor of over 80 patents in that field. More recently, her work has expanded to privacy-preserving data analysis, developing algorithms that ensure strong protection of individual information through differential privacy. Her research also addresses algorithmic challenges in distributed systems, network optimization, and approximation algorithms. Ultimately, her work bridges theory and practice, advancing fundamental algorithmic theory while applying it to large-scale, real-world problems.

In addition to her technical contributions, Monika Henzinger is a prominent leader in the research community. She has laid the foundations for several research fields such as data streams, web search algorithms, and the empirical evaluation of dynamic graph algorithms, co-initiated major conferences such as the ACM Conference on Web Search and Data Mining, and helped shape the trajectory of major technology companies. She serves in editorial capacities for leading journals and has chaired numerous conferences and award committees. Her mentorship is widely recognized; her research group members are considered worldwide leaders in dynamic and web algorithms.

Press Release

ACM Fellows

Austria - 2016

citation

For contributions to computing theory and its practical application.

Press Release

Background