World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
61
Citations
19745
World Ranking
3016
National Ranking
19

Research.com Recognitions

  • 2016 - ACM Fellow For contributions to computing theory and its practical application.
  • 2014 - European Association for Theoretical Computer Science (EATCS) Fellow For being one of the pioneers of web algorithms, algorithms that deal with problems of the world wide web
  • 2013 - Member of Academia Europaea

Overview

Monika Henzinger is affiliated with the Institute of Science and Technology Austria. Their primary field of study is Computer Science, with a focus spanning multiple subfields including Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Signal Processing, and Computer Vision and Pattern Recognition.

Their research topics include Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Optimization and Search Problems, Cryptography and Data Security, Data Management and Algorithms, Privacy-Preserving Technologies in Data, and Stochastic Gradient Optimization Techniques.

Frequent publication venues for their work include arXiv (Cornell University), Leibniz-Zentrum für Informatik (Schloss Dagstuhl), the Society for Industrial and Applied Mathematics eBooks, SIAM Journal on Computing, and HAL (Le Centre pour la Communication Scientifique Directe).

Some recent papers authored or co-authored by Monika Henzinger are:

  • Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide, 2022, ACM Journal of Experimental Algorithmics
  • Local Flow Partitioning for Faster Edge Connectivity, 2020, SIAM Journal on Computing
  • Improved Guarantees for Vertex Sparsification in Planar Graphs, 2020, SIAM Journal on Discrete Mathematics
  • Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • A tree structure for dynamic facility location, 2020, HAL (Le Centre pour la Communication Scientifique Directe)

Frequent collaborators include Gramoz Goranci, Christian Schulz, Kathrin Hanauer, Jalaj Upadhyay, and Stefan Schmid.

Monika Henzinger has received several awards, including the ACM Fellow recognition in 2016 for contributions to computing theory and its practical application, the European Association for Theoretical Computer Science (EATCS) Fellow distinction in 2014 for pioneering work in web algorithms, and membership in Academia Europaea since 2013.

Best Publications

  • Analysis of a very large web search engine query log

    Craig Silverstein;Hannes Marais;Monika Henzinger;Michael Moricz

  • Improved algorithms for topic distillation in a hyperlinked environment

    Krishna Bharat;Monika R. Henzinger

  • Finding related pages in the World Wide Web

    Jeffrey Dean;Monika R. Henzinger

  • Improved algorithms for topic distillation in a hyperlinked environment

    Unknown

  • Computing simulations on finite and infinite graphs

    M.R. Henzinger;T.A. Henzinger;P.W. Kopke

  • Continuous profiling: where have all the cycles gone?

    Jennifer M. Anderson;Lance M. Berc;Jeffrey Dean;Sanjay Ghemawat

  • Information retrieval based on historical data

    Anurag Acharya;Matt Cutts;Jeffrey Dean;Paul Haahr

  • Computing on data streams

    Monika R. Henzinger;Prabhakar Raghavan;Sridhar Rajagopalan

  • Finding near-duplicate web pages: a large-scale evaluation of algorithms

    Monika Henzinger

  • Analysis of a Very Large AltaVista Query Log

    Craig Silverstein;Monika Henzinger;Hannes Marais;Michael Moricz

  • Faster Shortest-Path Algorithms for Planar Graphs

    Monika R Henzinger;Philip Klein;Satish Rao;Sairam Subramanian

  • Challenges in web search engines

    Monika R. Henzinger;Rajeev Motwani;Craig Silverstein

  • Exploring Unknown Environments

    Susanne Albers;Monika R. Henzinger

  • On near-uniform URL sampling

    Monika R. Henzinger;Allan Heydon;Michael Mitzenmacher;Marc Najork

  • Hyperlink analysis for the Web

    M.R. Henzinger

  • Randomized fully dynamic graph algorithms with polylogarithmic time per operation

    Monika R. Henzinger;Valerie King

  • Method for ranking documents in a hyperlinked environment using connectivity and selective content analysis

    Krishna Asur Bharat;Monika R. Henzinger

  • The connectivity server: fast access to linkage information on the Web

    Krishna Bharat;Andrei Broder;Monika Henzinger;Puneet Kumar

  • Query-free news search

    Monika Henzinger;Bay-Wei Chang;Brian Milch;Sergey Brin

  • Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture

    Monika Henzinger;Sebastian Krinninger;Danupon Nanongkai;Thatchaphol Saranurak

  • Who links to whom: mining linkage between Web sites

    K. Bharat;Bay-Wei Chang;M. Henzinger;M. Ruhl

  • Faster shortest-path algorithms for planar graphs

    Philip Klein;Satish Rao;Monika Rauch;Sairam Subramanian

Frequent Co-Authors

Krishnendu Chatterjee
Krishnendu Chatterjee Institute of Science and Technology Austria
Danupon Nanongkai
Danupon Nanongkai Max Planck Institute for Informatics
Christian Schulz
Christian Schulz Heidelberg University
Ingmar Weber
Ingmar Weber Saarland University
Jeffrey Dean
Jeffrey Dean Google (United States)
Satish Rao
Satish Rao University of California, Berkeley
Steve Lawrence
Steve Lawrence Google (United States)
Andrei Z. Broder
Andrei Z. Broder Google (United States)
Giuseppe F. Italiano
Giuseppe F. Italiano Guido Carli Free International University for Social Studies
Mikkel Thorup
Mikkel Thorup University of Copenhagen

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up a variety of online educational options and career pathways that suit different goals and timelines. For those looking to quickly enhance their skill set and boost earning potential, consider 3-month certificate programs that pay well. These certificates can help you gain entry to tech roles or specialize in high-demand areas without a huge time investment.

If you’re ready for a deeper dive and want to accelerate your academic credentials, there are numerous opportunities for the quickest masters degree online. These programs typically emphasize flexibility and can often be finished in just over a year, letting you fast-track your career.

Choosing a graduate program aligned with industry needs is crucial. Many of most in demand masters degrees are in Computer Science, Artificial Intelligence, and Data Science, ensuring long-term career value.

For those starting their educational journey or seeking an affordable, foundational option, online associate degree programs are a great way to learn essential skills and enter the tech field with minimal debt.

Best Scientists Citing Monika Henzinger

Trending Scientists