Monika Henzinger

11.1k total citations · 1 hit paper
139 papers, 5.0k citations indexed

About

Monika Henzinger is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Monika Henzinger has authored 139 papers receiving a total of 5.0k indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Computational Theory and Mathematics, 60 papers in Computer Networks and Communications and 46 papers in Artificial Intelligence. Recurrent topics in Monika Henzinger's work include Complexity and Algorithms in Graphs (53 papers), Optimization and Search Problems (46 papers) and Web Data Mining and Analysis (27 papers). Monika Henzinger is often cited by papers focused on Complexity and Algorithms in Graphs (53 papers), Optimization and Search Problems (46 papers) and Web Data Mining and Analysis (27 papers). Monika Henzinger collaborates with scholars based in Austria, United States and Switzerland. Monika Henzinger's co-authors include Craig Silverstein, Krishna Bharat, Jay B. Dean, Valerie King, Peter W. Kopke, Thomas A. Henzinger, Marc Najork, Allan Heydon, Michael Mitzenmacher and Ingmar Weber and has published in prestigious journals such as Science, Proceedings of the National Academy of Sciences and SHILAP Revista de lepidopterología.

In The Last Decade

Monika Henzinger

134 papers receiving 4.5k citations

Hit Papers

Analysis of a very large ... 1999 2026 2008 2017 1999 250 500 750

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Monika Henzinger Austria 33 2.4k 1.8k 1.6k 886 755 139 5.0k
Paolo Boldi Italy 26 1.4k 0.6× 1.8k 1.0× 1.3k 0.8× 457 0.5× 1.3k 1.7× 84 4.1k
Sebastiano Vigna Italy 26 1.4k 0.6× 1.7k 0.9× 1.2k 0.8× 440 0.5× 1.1k 1.5× 82 3.9k
Mark S. Manasse United States 26 1.9k 0.8× 1.5k 0.9× 2.8k 1.7× 486 0.5× 251 0.3× 46 4.8k
Rina Panigrahy‎ United States 29 1.2k 0.5× 1.5k 0.9× 3.0k 1.9× 422 0.5× 209 0.3× 74 4.5k
Roberto Tamassia United States 39 1.7k 0.7× 2.5k 1.4× 1.6k 1.0× 1.4k 1.6× 462 0.6× 201 7.3k
Meichun Hsu United States 27 2.9k 1.2× 2.2k 1.3× 1.3k 0.8× 1.0k 1.1× 177 0.2× 93 4.6k
Edith Cohen United States 36 840 0.4× 1.4k 0.8× 4.0k 2.4× 814 0.9× 355 0.5× 149 5.4k
Ravi Kumar United States 42 1.6k 0.7× 3.5k 2.0× 1.5k 0.9× 1.1k 1.2× 1.3k 1.7× 147 6.6k
Andrei Broder United States 36 3.9k 1.6× 3.4k 2.0× 3.9k 2.4× 694 0.8× 1.6k 2.2× 112 10.1k
Janet L. Wiener United States 31 2.6k 1.1× 1.6k 0.9× 3.6k 2.2× 174 0.2× 1.3k 1.7× 57 5.6k

Countries citing papers authored by Monika Henzinger

Since Specialization
Citations

This map shows the geographic impact of Monika Henzinger's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Monika Henzinger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Monika Henzinger more than expected).

Fields of papers citing papers by Monika Henzinger

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Monika Henzinger. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Monika Henzinger. The network helps show where Monika Henzinger may publish in the future.

Co-authorship network of co-authors of Monika Henzinger

This figure shows the co-authorship network connecting the top 25 collaborators of Monika Henzinger. A scholar is included among the top collaborators of Monika Henzinger based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Monika Henzinger. Monika Henzinger is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Henzinger, Monika, et al.. (2022). Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide. ACM Journal of Experimental Algorithmics. 27. 1–45. 17 indexed citations
2.
Henzinger, Monika, et al.. (2020). Faster Fully Dynamic Transitive Closure in Practice. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
3.
Henzinger, Monika. (2020). Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
4.
Henzinger, Monika, et al.. (2020). Clustering dynamique minimisant la somme des rayons des clusters. HAL (Le Centre pour la Communication Scientifique Directe).
5.
Henzinger, Monika, et al.. (2019). Algorithms and Hardness for Diameter in Dynamic Graphs.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations
6.
Bernstein, Aaron, et al.. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. arXiv (Cornell University). 1899–1918. 3 indexed citations
7.
Henzinger, Monika, et al.. (2018). Memetic Graph Clustering. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 103. 15. 1 indexed citations
8.
Henzinger, Monika, et al.. (2018). Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 3 indexed citations
9.
Wang, Di, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, & Satish Rao. (2017). Capacity Releasing Diffusion for Speed and Locality. International Conference on Machine Learning. 3598–3607. 4 indexed citations
10.
Henzinger, Monika, et al.. (2017). Improved Guarantees for Vertex Sparsification in Planar Graphs. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 14. 2 indexed citations
11.
Chatterjee, Krishnendu, et al.. (2017). Improved Set-Based Symbolic Algorithms for Parity Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21. 1 indexed citations
12.
Chatterjee, Krishnendu, et al.. (2016). Conditionally optimal algorithms for generalized Büchi Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 4 indexed citations
13.
Henzinger, Monika. (2007). Combinatorial algorithms for web search engines: three success stories. Symposium on Discrete Algorithms. 1022–1026. 3 indexed citations
14.
Henzinger, Monika. (2000). Link Analysis in Web Information Retrieval.. IEEE Data(base) Engineering Bulletin. 23. 3–8. 69 indexed citations
15.
Henzinger, Monika. (2000). Web Information Retrieval.. 693. 4 indexed citations
16.
Henzinger, Monika & Stefano Leonardi. (1999). Scheduling multicasts on unit-capacity trees and meshes. Max Planck Institute for Plasma Physics. 438–447. 1 indexed citations
17.
Raghavan, Prabhakar, et al.. (1999). Finding anything in the billion page Web: are algorithms the key?. 31. 1760–1761. 2 indexed citations
18.
Silverstein, Craig, et al.. (1998). Analysis of a Very Large AltaVista Query Log. 116 indexed citations
19.
Henzinger, Monika, Valerie King, & Tandy Warnow. (1996). Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Symposium on Discrete Algorithms. 333–340. 13 indexed citations
20.
Alberts, David S. & Monika Henzinger. (1995). Average case analysis of dynamic graph algorithms. Symposium on Discrete Algorithms. 312–321. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026