On the Complexity of a Game Related to the Dictionary Problem. - Kurt Mehlhorn; Stefan Näher; Monika Rauch (SIAM J. Comput., 1990)

Fully Dynamic 2-Edge-Connectivity in Planar Graphs. - John Hershberger 001; Monika Rauch; Subhash Suri (SWAT, 1992)

Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. - Brandon Dixon; Monika Rauch; Robert Endre Tarjan (SIAM J. Comput., 1992)

Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). - Giuseppe F. Italiano; Johannes A. La Poutré; Monika Rauch (ESA, 1993)

An Algorithm for Finding Predecessors in Integer Sets. - Bruce M. Maggs; Monika Rauch (WADS, 1993)

Fully Dynamic Cycle-Equivalence in Graphs - Monika Rauch Henzinger (FOCS, 1994)

Data Structures for Two-Edge Connectivity in Planar Graphs. - John Hershberger 001; Monika Rauch; Subhash Suri (Theor. Comput. Sci., 1994)

Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. - Monika Rauch Henzinger; Johannes A. La Poutré (ESA, 1995)

Computing Simulations on Finite and Infinite Graphs. - Monika Rauch Henzinger; Thomas A. Henzinger; Peter W. Kopke (FOCS, 1995)

Fully Dynamic Biconnectivity and Transitive Closure. - Monika Rauch Henzinger; Valerie King (FOCS, 1995)

Approximating Minimum Cuts under Insertions. - Monika Rauch Henzinger (ICALP, 1995)

Randomized dynamic graph algorithms with polylogarithmic time per operation. - Monika Rauch Henzinger; Valerie King (STOC, 1995)

Fully Dynamic Biconnectivity in Graphs. - Monika Rauch Henzinger (Algorithmica, 1995)

Improved Sampling with Applications to Dynamic Graph Algorithms. - Monika Rauch Henzinger; Mikkel Thorup (ICALP, 1996)

Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. - Monika Rauch Henzinger; Jan Arne Telle (SWAT, 1996)

On the Number of Small Cuts in a Graph. - Monika Henzinger; David P. Williamson (Inf. Process. Lett., 1996)

Maintaining Minimum Spanning Trees in Dynamic Graphs. - Monika Rauch Henzinger; Valerie King (ICALP, 1997)

A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. - Monika Rauch Henzinger (J. Algorithms, 1997)

Faster Shortest-Path Algorithms for Planar Graphs. - Monika Rauch Henzinger; Philip N. Klein; Satish Rao; Sairam Subramanian (J. Comput. Syst. Sci., 1997)

Sampling to provide or to bound: With applications to fully dynamic graph algorithms. - Monika Rauch Henzinger; Mikkel Thorup (Random Struct. Algorithms, 1997)

Continuous Profiling: Where Have All the Cycles Gone? - Jennifer-Ann M. Anderson; Lance M. Berc; Jeffrey Dean; Sanjay Ghemawat; Monika Rauch Henzinger; Shun-Tak Leung; Richard L. Sites; Mark T. Vandevoorde; Carl A. Waldspurger; William E. Weihl (ACM Trans. Comput. Syst., 1997)

Computing on data streams. - Monika Rauch Henzinger; Prabhakar Raghavan; Sridhar Rajagopalan (External Memory Algorithms, 1998)

Parametric and Kinetic Minimum Spanning Trees. - Pankaj K. Agarwal; David Eppstein; Leonidas J. Guibas; Monika Rauch Henzinger (FOCS, 1998)

Information Retrieval on the Web. - Andrei Z. Broder; Monika Rauch Henzinger (FOCS, 1998)

Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. - Ashish Goel; Monika Rauch Henzinger; Serge A. Plotkin (SODA, 1998)

Average-Case Analysis of Dynamic Graph Algorithms. - David Alberts; Monika Rauch Henzinger (Algorithmica, 1998)

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. - Monika Rauch Henzinger; Michael L. Fredman (Algorithmica, 1998)

The Connectivity Server: Fast Access to Linkage Information on the Web. - Krishna Bharat; Andrei Z. Broder; Monika Henzinger; Puneet Kumar; Suresh Venkatasubramanian (Comput. Networks, 1998)

Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. - Monika Rauch Henzinger; Valerie King; Tandy J. Warnow (Algorithmica, 1999)

Finding Related Pages in the World Wide Web. - Jeffrey Dean; Monika Rauch Henzinger (Comput. Networks, 1999)

Measuring Index Quality Using Random Walks on the Web. - Monika Rauch Henzinger; Allan Heydon; Michael Mitzenmacher; Marc Najork (Comput. Networks, 1999)

Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. - Monika Rauch Henzinger; Valerie King (J. ACM, 1999)

Analysis of a Very Large Web Search Engine Query Log. - Craig Silverstein; Monika Henzinger; Hannes Marais; Michael Moricz (SIGIR Forum, 1999)

Web Information Retrieval - an Algorithmic Perspective. - Monika Henzinger (ESA, 2000)

Web Information Retrieval. - Monika Rauch Henzinger (ICDE, 2000)

On near-uniform URL sampling. - Monika Rauch Henzinger; Allan Heydon; Michael Mitzenmacher; Marc Najork (Comput. Networks, 2000)

A Comparison of Techniques to Find Mirrored Hosts on the WWW. - Krishna Bharat; Andrei Z. Broder; Jeffrey Dean; Monika Rauch Henzinger (IEEE Data Eng. Bull., 2000)

Link Analysis in Web Information Retrieval. - Monika Rauch Henzinger (IEEE Data Eng. Bull., 2000)

Computing Vertex Connectivity: New Bounds from Old Techniques. - Monika Rauch Henzinger; Satish Rao; Harold N. Gabow (J. Algorithms, 2000)

Exploring Unknown Environments. - Susanne Albers; Monika Rauch Henzinger (SIAM J. Comput., 2000)

Improved Data Structures for Fully Dynamic Biconnectivity. - Monika Rauch Henzinger (SIAM J. Comput., 2000)

Who Links to Whom: Mining Linkage between Web Sites. - Krishna Bharat; Bay-Wei Chang; Monika Henzinger; Matthias Ruhl (ICDM, 2001)

Hyperlink Analysis for the Web. - Monika Rauch Henzinger (IEEE Internet Comput., 2001)

Maintaining Minimum Spanning Forests in Dynamic Graphs. - Monika Rauch Henzinger; Valerie King (SIAM J. Comput., 2001)

Indexing the Web - A Challenge for Supercomputers. - Monika Henzinger (CLUSTER, 2002)

Challenges in web search engines. - Monika Rauch Henzinger; Rajeev Motwani 001; Craig Silverstein (SIGIR Forum, 2002)

Algorithmic Challenges in Web Search Engines. - Monika Rauch Henzinger (Internet Math., 2003)

Scheduling data transfers in a network and the set scheduling problem. - Ashish Goel; Monika Rauch Henzinger; Serge A. Plotkin; Éva Tardos (J. Algorithms, 2003)

Scheduling multicasts on unit-capacity trees and meshes. - Monika Rauch Henzinger; Stefano Leonardi 001 (J. Comput. Syst. Sci., 2003)

The past, present, and future of web information retrieval. - Monika Henzinger (DRR, 2004)

Algorithmic Aspects of Web Search Engines. - Monika Henzinger (ESA, 2004)

The Past, Present, and Future of Web Search Engines p. - Monika Henzinger (ICALP, 2004)

Data Structures in Web Information Retrieval. - Monika Henzinger (Handbook of Data Structures and Applications, 2004)

Hyperlink analysis on the world wide web. - Monika Henzinger (Hypertext, 2005)

An online throughput-competitive algorithm for multicast routing and admission control. - Ashish Goel; Monika Rauch Henzinger; Serge A. Plotkin (J. Algorithms, 2005)

Query-Free News Search. - Monika Henzinger; Bay-Wei Chang; Brian Milch; Sergey Brin (World Wide Web, 2005)

Finding near-duplicate web pages: a large-scale evaluation of algorithms. - Monika Henzinger (SIGIR, 2006)

Combinatorial algorithms for web search engines: three success stories. - Monika Henzinger (SODA, 2007)

Web page language identification based on URLs. - Eda Baykan; Monika Henzinger; Ingmar Weber (Proc. VLDB Endow., 2008)

Theory research at Google. - Gagan Aggarwal; Nir Ailon; Florin Constantin; Eyal Even-Dar; Jon Feldman; Gereon Frahling; Monika Rauch Henzinger; S. Muthukrishnan 001; Noam Nisan; Martin Pál; Mark Sandler 002; Anastasios Sidiropoulos (SIGACT News, 2008)

PageRank Algorithm. - Monika Henzinger (Encyclopedia of Algorithms, 2008)

A Comparison of Techniques for Sampling Web Pages. - Eda Baykan; Monika Henzinger; Stefan F. Keller; Sebastian De Castelberg; Markus Kinzler (STACS, 2009)

Purely URL-based topic classification. - Eda Baykan; Monika Henzinger; Ludmila Marian; Ingmar Weber (WWW, 2009)

Detecting the origin of text segments efficiently. - Ossama Abdel Hamid; Behshad Behzadi; Stefan Christoph; Monika Henzinger (WWW, 2009)

On the Pricing of Recommendations and Recommending Strategically - Paul Dütting; Monika Henzinger; Ingmar Weber (CoRR, 2009)

Mechanisms for the Marriage and the Assignment Game. - Paul Dütting; Monika Henzinger (CIAC, 2010)

Online Stochastic Packing Applied to Display Ad Allocation. - Jon Feldman; Monika Henzinger; Nitish Korula; Vahab S. Mirrokni; Clifford Stein 001 (ESA (1), 2010)

How much is your personal recommendation worth? - Paul Dütting; Monika Henzinger; Ingmar Weber (WWW, 2010)

Online Stochastic Ad Allocation: Efficiency and Fairness - Jon Feldman; Monika Henzinger; Nitish Korula; Vahab S. Mirrokni; Clifford Stein 001 (CoRR, 2010)

The stability of the h-index. - Monika Henzinger; Jacob Suñol; Ingmar Weber (Scientometrics, 2010)

Multi-parameter Mechanism Design under Budget and Matroid Constraints. - Monika Henzinger; Angelina Vidali (ESA, 2011)

Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. - Krishnendu Chatterjee; Monika Henzinger (SODA, 2011)

An O(n^2) Time Algorithm for Alternating Büchi Games - Krishnendu Chatterjee; Monika Henzinger (CoRR, 2011)

On Multiple Round Sponsored Search Auctions with Budgets - Riccardo Colini-Baldeschi; Monika Henzinger; Stefano Leonardi 001; Martin Starnberger (CoRR, 2011)

Offline file assignments for online load balancing. - Paul Dütting; Monika Henzinger; Ingmar Weber (Inf. Process. Lett., 2011)

A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification. - Eda Baykan; Monika Henzinger; Ludmila Marian; Ingmar Weber (ACM Trans. Web, 2011)

Maximizing revenue from strategic recommendations under decaying trust. - Paul Dütting; Monika Henzinger; Ingmar Weber (CIKM, 2012)

An O(n2) time algorithm for alternating Büchi games. - Krishnendu Chatterjee; Monika Henzinger (SODA, 2012)

The Presburger Award 2013: Call for Nominations. - Monika Henzinger (Bull. EATCS, 2012)

Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (ICALP (2), 2013)

Approximating the minimum cycle mean. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer (GandALF, 2013)

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. - Krishnendu Chatterjee; Monika Henzinger; Manas Joglekar; Nisarg Shah 001 (Formal Methods Syst. Des., 2013)

38th International Colloquium on Automata, Languages and Programming. - Luca Aceto; Monika Henzinger; Jirí Sgall (Inf. Comput., 2013)

Sponsored search, market equilibria, and the Hungarian Method. - Paul Dütting; Monika Henzinger; Ingmar Weber (Inf. Process. Lett., 2013)

Bidder optimal assignments for general utilities. - Paul Dütting; Monika Henzinger; Ingmar Weber (Theor. Comput. Sci., 2013)

A Comprehensive Study of Techniques for URL-Based Web Page Language Classification. - Eda Baykan; Monika Henzinger; Ingmar Weber (ACM Trans. Web, 2013)

Online Bipartite Matching with Decomposable Weights. - Moses Charikar; Monika Henzinger; Huy L. Nguyen (ESA, 2014)

A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (SODA, 2014)

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (STOC, 2014)

Online Ad Assignment with an Ad Exchange. - Wolfgang Dvorák; Monika Henzinger (WAOA, 2014)

Limiting Price Discrimination when Selling Products with Positive Network Externalities. - Ludek Cigler; Wolfgang Dvorák; Monika Henzinger; Martin Starnberger (WINE, 2014)

Polynomial-Time Algorithms for Energy Games with Special Weight Structures. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (Algorithmica, 2014)

Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition. - Krishnendu Chatterjee; Monika Henzinger (J. ACM, 2014)

Approximating the minimum cycle mean. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer; Michael A. Raskin (Theor. Comput. Sci., 2014)

Design of Dynamic Algorithms via Primal-Dual Method. - Sayan Bhattacharya; Monika Henzinger; Giuseppe F. Italiano (ICALP (1), 2015)

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. - Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer (ICALP (1), 2015)

Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (ICALP (1), 2015)

Improved Algorithms for One-Pair and k-Pair Streett Objectives. - Krishnendu Chatterjee; Monika Henzinger; Veronika Loitzenbauer (LICS, 2015)

Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai; Charalampos E. Tsourakakis (STOC, 2015)

Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai; Thatchaphol Saranurak (STOC, 2015)

Ad Exchange: Envy-Free Auctions with Mediators. - Oren Ben-Zwi; Monika Henzinger; Veronika Loitzenbauer (WINE, 2015)

Combinatorial Auctions with Conflict-Based Externalities. - Yun Kuen Cheung; Monika Henzinger; Martin Hoefer 001; Martin Starnberger (WINE, 2015)

An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (CoRR, 2015)

Truthful unit-demand auctions with budgets revisited. - Monika Henzinger; Veronika Loitzenbauer (Theor. Comput. Sci., 2015)

On Multiple Keyword Sponsored Search Auctions with Budgets. - Riccardo Colini-Baldeschi; Stefano Leonardi 001; Monika Henzinger; Martin Starnberger (ACM Trans. Economics and Comput., 2015)

Auctions for Heterogeneous Items and Budget Limits. - Paul Dütting; Monika Henzinger; Martin Starnberger (ACM Trans. Economics and Comput., 2015)

An Expressive Mechanism for Auctions on the Web. - Paul Dütting; Monika Henzinger; Ingmar Weber (ACM Trans. Economics and Comput., 2015)

Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. - Gramoz Goranci; Monika Henzinger; Mikkel Thorup (ESA, 2016)

Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. - Monika Henzinger; Stefan Neumann 003 (ESA, 2016)

Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. - Yun Kuen Cheung; Gramoz Goranci; Monika Henzinger (ICALP, 2016)

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (LICS, 2016)

Conditionally Optimal Algorithms for Generalized Büchi Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (MFCS, 2016)

New deterministic approximation algorithms for fully dynamic matching. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai (STOC, 2016)

EATCS Fellows' Advice to the Young Theoretical Computer Scientist. - Luca Aceto; Mariangiola Dezani-Ciancaglini; Yuri Gurevich; David Harel; Monika Henzinger; Giuseppe F. Italiano; Scott A. Smolka; Paul G. Spirakis; Wolfgang Thomas (Bull. EATCS, 2016)

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (SIAM J. Comput., 2016)

PageRank Algorithm. - Monika Henzinger (Encyclopedia of Algorithms, 2016)

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (Encyclopedia of Algorithms, 2016)

Improved Set-Based Symbolic Algorithms for Parity Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (CSL, 2017)

The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (ESA, 2017)

Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk). - Monika Henzinger (ICALP, 2017)

Capacity Releasing Diffusion for Speed and Locality. - Di Wang 005; Kimon Fountoulakis; Monika Henzinger; Michael W. Mahoney; Satish Rao (ICML, 2017)

Conditional Hardness for Sensitivity Problems. - Monika Henzinger; Andrea Lincoln; Stefan Neumann 003; Virginia Vassilevska Williams (ITCS, 2017)

Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. - Sayan Bhattacharya; Deeparnab Chakrabarty; Monika Henzinger (IPCO, 2017)

Faster Algorithms for Mean-Payoff Parity Games. - Krishnendu Chatterjee; Monika Henzinger; Alexander Svozil (MFCS, 2017)

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai (SODA, 2017)

Maximizing a Submodular Function with Viability Constraints. - Wolfgang Dvorák; Monika Henzinger; David P. Williamson (Algorithmica, 2017)

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3n) Worst Case Update Time. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai (CoRR, 2017)

Improved Algorithms for Parity and Streett objectives. - Krishnendu Chatterjee; Monika Henzinger; Veronika Loitzenbauer (Log. Methods Comput. Sci., 2017)

Welfare Maximization with Friends-of-Friends Network Externalities. - Sayan Bhattacharya; Wolfgang Dvorák; Monika Henzinger; Martin Starnberger (Theory Comput. Syst., 2017)

Improved Algorithms for Topic Distillation in a Hyperlinked Environment. - Krishna Bharat; Monika Henzinger (SIGIR Forum, 2017)

Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (ACM Trans. Algorithms, 2017)

Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. - Krishnendu Chatterjee; Monika Henzinger; Veronika Loitzenbauer; Simin Oraee; Viktor Toman (CAV (2), 2018)

A Tree Structure For Dynamic Facility Location. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski (ESA, 2018)

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (ESA, 2018)

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (LPAR, 2018)

Dynamic Algorithms for Graph Coloring. - Sayan Bhattacharya; Deeparnab Chakrabarty; Monika Henzinger; Danupon Nanongkai (SODA, 2018)

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (SODA, 2018)

The State of the Art in Dynamic Graph Algorithms. - Monika Henzinger (SOFSEM, 2018)

Memetic Graph Clustering. - Sonja Biedermann; Monika Henzinger; Christian Schulz 003; Bernhard Schuster (SEA, 2018)

Dynamic algorithms via the primal-dual method. - Sayan Bhattacharya; Monika Henzinger; Giuseppe F. Italiano (Inf. Comput., 2018)

Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (J. ACM, 2018)

Practical Minimum Cut Algorithms. - Monika Henzinger; Alexander Noe; Christian Schulz 003; Darren Strash (ACM J. Exp. Algorithmics, 2018)

Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. - Sayan Bhattacharya; Monika Henzinger; Giuseppe F. Italiano (SIAM J. Comput., 2018)

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. - Gramoz Goranci; Monika Henzinger; Mikkel Thorup (ACM Trans. Algorithms, 2018)

Valuation Compressions in VCG-Based Combinatorial Auctions. - Paul Dütting; Monika Henzinger; Martin Starnberger (ACM Trans. Economics and Comput., 2018)

Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (CONCUR, 2019)

A New Deterministic Algorithm for Dynamic Set Cover. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai (FOCS, 2019)

Algorithms and Hardness for Diameter in Dynamic Graphs. - Bertie Ancona; Monika Henzinger; Liam Roditty; Virginia Vassilevska Williams; Nicole Wein (ICALP, 2019)

Shared-Memory Exact Minimum Cuts. - Monika Henzinger; Alexander Noe; Christian Schulz 003 (IPDPS, 2019)

Distributed edge connectivity in sublinear time. - Mohit Daga; Monika Henzinger; Danupon Nanongkai; Thatchaphol Saranurak (STOC, 2019)

Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing. - Monika Henzinger; Pan Peng 001 (CoRR, 2019)

Fully Dynamic k-Center Clustering in Doubling Metrics. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski; Alexander Svozil (CoRR, 2019)

Efficient Distributed Workload (Re-)Embedding. - Monika Henzinger; Stefan Neumann 003; Stefan Schmid 001 (Proc. ACM Meas. Anal. Comput. Syst., 2019)

New amortized cell-probe lower bounds for dynamic problems. - Sayan Bhattacharya; Monika Henzinger; Stefan Neumann 003 (Theor. Comput. Sci., 2019)

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (ALENEX, 2020)

Shared-Memory Branch-and-Reduce for Multiterminal Cuts. - Monika Henzinger; Alexander Noe; Christian Schulz 003 (ALENEX, 2020)

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. - Monika Henzinger; Stefan Neumann 003; Andreas Wiese (SoCG, 2020)

Dynamic Matching Algorithms in Practice. - Monika Henzinger; Shahbaz Khan 004; Richard D. Paul; Christian Schulz 003 (ESA, 2020)

Fully-Dynamic Coresets. - Monika Henzinger; Sagar Kale (ESA, 2020)

Finding All Global Minimum Cuts in Practice. - Monika Henzinger; Alexander Noe; Christian Schulz 003; Darren Strash (ESA, 2020)

Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. - Li Chen 028; Gramoz Goranci; Monika Henzinger; Richard Peng; Thatchaphol Saranurak (FOCS, 2020)

Faster Fully Dynamic Transitive Closure in Practice. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (SEA, 2020)

Deterministic Dynamic Matching in O(1) Update Time. - Sayan Bhattacharya; Deeparnab Chakrabarty; Monika Henzinger (Algorithmica, 2020)

Dynamic Clustering to Minimize the Sum of Radii. - Monika Henzinger; Dariusz Leniowski; Claire Mathieu (Algorithmica, 2020)

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. - Monika Henzinger; Stefan Neumann 003; Andreas Wiese (CoRR, 2020)

An Improved Algorithm for Dynamic Set Cover. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai; Xiaowei Wu 001 (CoRR, 2020)

A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. - Monika Henzinger; Billy Jin; David P. Williamson (CoRR, 2020)

Local Flow Partitioning for Faster Edge Connectivity. - Monika Henzinger; Satish Rao; Di Wang 005 (SIAM J. Comput., 2020)

Improved Guarantees for Vertex Sparsification in Planar Graphs. - Gramoz Goranci; Monika Henzinger; Pan Peng 001 (SIAM J. Discret. Math., 2020)

Vienna Graph Clustering. - Sonja Biedermann; Monika Henzinger; Christian Schulz 003; Bernhard Schuster (Protein-Protein Interaction Networks, 2020)

Faster Parallel Multiterminal Cuts. - Monika Henzinger; Alexander Noe; Christian Schulz 003 (ACDA, 2021)

Fully Dynamic k-Center Clustering in Low Dimensional Metrics. - Gramoz Goranci; Monika Henzinger; Dariusz Leniowski; Christian Schulz 003; Alexander Svozil (ALENEX, 2021)

Differentially Private Algorithms for Graphs Under Continual Observation. - Hendrik Fichtenberger; Monika Henzinger; Lara Ost (ESA, 2021)

Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. - Krishnendu Chatterjee; Monika Henzinger; Sagar Kale; Alexander Svozil (ICALP, 2021)

Symbolic Time and Space Tradeoffs for Probabilistic Verification. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (LICS, 2021)

On the Complexity of Weight-Dynamic Network Algorithms. - Monika Henzinger; Ami Paz; Stefan Schmid 001 (Networking, 2021)

New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. - Thiago Bergamaschi; Monika Henzinger; Maximilian Probst Gutenberg; Virginia Vassilevska Williams; Nicole Wein (SODA, 2021)

Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai; Xiaowei Wu 001 (SODA, 2021)

Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. - Sebastian Forster; Gramoz Goranci; Monika Henzinger (SODA, 2021)

Tight Bounds for Online Graph Partitioning. - Monika Henzinger; Stefan Neumann 003; Harald Räcke; Stefan Schmid 001 (SODA, 2021)

Upper and Lower Bounds for Fully Retroactive Graph Problems. - Monika Henzinger; Xiaowei Wu 001 (WADS, 2021)

Algorithms and conditional lower bounds for planning problems. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (Artif. Intell., 2021)

Recent Advances in Fully Dynamic Graph Algorithms. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (CoRR, 2021)

Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice? - Monika Henzinger; Alexander Noe (CoRR, 2021)

Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. - Monika Henzinger; Billy Jin; Richard Peng; David P. Williamson (CoRR, 2021)

On fully dynamic constant-factor approximation algorithms for clustering problems. - Hendrik Fichtenberger; Monika Henzinger; Andreas Wiese (CoRR, 2021)

The Complexity of Average-Case Dynamic Subgraph Counting. - Monika Henzinger; Andrea Lincoln; Barna Saha (Electron. Colloquium Comput. Complex., 2021)

Constant-time dynamic weight approximation for minimum spanning forest. - Monika Henzinger; Pan Peng 001 (Inf. Comput., 2021)

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (SIAM J. Comput., 2021)

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. - Aaron Bernstein; Sebastian Forster; Monika Henzinger (ACM Trans. Algorithms, 2021)

Practical Fully Dynamic Minimum Cut Algorithms. - Monika Henzinger; Alexander Noe; Christian Schulz 003 (ALENEX, 2022)

Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification. - Monika Henzinger (Principles of Systems Design, 2022)

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. - Monika Henzinger; Ami Paz; A. R. Sricharan (ESA, 2022)

Leximax Approximations and Representative Cohort Selection. - Monika Henzinger; Charlotte Peale; Omer Reingold; Judy Hanwen Shen (FORC, 2022)

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. - Kathrin Hanauer; Monika Henzinger; Stefan Schmid 001; Jonathan Trummer (INFOCOM, 2022)

Modern Dynamic Data Structures (Invited Talk). - Monika Henzinger (MFCS, 2022)

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (PODC, 2022)

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (SAND, 2022)

Fully Dynamic Four-Vertex Subgraph Counting. - Kathrin Hanauer; Monika Henzinger; Qi Cheng Hua (SAND, 2022)

The augmentation-speed tradeoff for consistent network updates. - Monika Henzinger; Ami Paz; Arash Pourdamghani; Stefan Schmid 001 (SOSR, 2022)

Incremental Approximate Maximum Flow in m1/2+o(1) update time. - Gramoz Goranci; Monika Henzinger (CoRR, 2022)

Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. - Monika Henzinger; Jalaj Upadhyay (IACR Cryptol. ePrint Arch., 2022)

Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. - Kathrin Hanauer; Monika Henzinger; Christian Schulz 003 (ACM J. Exp. Algorithmics, 2022)

Constant-time Dynamic (Δ +1)-Coloring. - Monika Henzinger; Pan Peng 001 (ACM Trans. Algorithms, 2022)

DJ-Match/DJ-Match: Version 1.0.0. - Kathrin Hanauer; Monika Henzinger; Stefan Schmid 001; Jonathan Trummer (Zenodo, 2022)

Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. - Gramoz Goranci; Monika Henzinger (ICALP, 2023)

Faster Submodular Maximization for Several Classes of Matroids. - Monika Henzinger; Paul Liu 001; Jan Vondrák; Da Wei Zheng (ICALP, 2023)

Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. - Hendrik Fichtenberger; Monika Henzinger; Jalaj Upadhyay (ICML, 2023)

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. - Kathrin Hanauer; Monika Henzinger; Lara Ost; Stefan Schmid 001 (INFOCOM, 2023)

Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (ITCS, 2023)

Simple, Scalable and Effective Clustering via One-Dimensional Projections. - Moses Charikar; Monika Henzinger; Lunjia Hu; Maximilian Vötsch; Erik Waingarten (NeurIPS, 2023)

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. - MohammadHossein Bateni; Hossein Esfandiari; Hendrik Fichtenberger; Monika Henzinger; Rajesh Jayaram; Vahab Mirrokni; Andreas Wiese (SODA, 2023)

Online Min-Max Paging. - Ashish Chiplunkar; Monika Henzinger; Sagar Sudhir Kale; Maximilian Vötsch (SODA, 2023)

Fully Dynamic Exact Edge Connectivity in Sublinear Time. - Gramoz Goranci; Monika Henzinger; Danupon Nanongkai; Thatchaphol Saranurak; Mikkel Thorup; Christian Wulff-Nilsen (SODA, 2023)

Almost Tight Error Bounds on Differentially Private Continual Counting. - Monika Henzinger; Jalaj Upadhyay; Sarvagya Upadhyay (SODA, 2023)

Dynamic Maintenance of Monotone Dynamic Programs and Applications. - Monika Henzinger; Stefan Neumann 003; Harald Räcke; Stefan Schmid 001 (STACS, 2023)

Differentially Private Data Structures under Continual Observation for Histograms and Related Queries. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (CoRR, 2023)

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (CoRR, 2023)

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. - MohammadHossein Bateni; Hossein Esfandiari; Hendrik Fichtenberger; Monika Henzinger; Rajesh Jayaram; Vahab Mirrokni; Andreas Wiese (CoRR, 2023)

Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (CoRR, 2023)

Differential Privacy for Clustering Under Continual Observation. - Max Dupré la Tour; Monika Henzinger; David Saulpic (CoRR, 2023)

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. - Monika Henzinger; Andrea Lincoln; Barna Saha; Martin P. Seybold; Christopher Ye 001 (CoRR, 2023)

Experimental Evaluation of Fully Dynamic k-Means via Coresets. - Monika Henzinger; David Saulpic; Leonhard Sidl (CoRR, 2023)

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. - Sayan Bhattacharya; Monika Henzinger; Danupon Nanongkai; Xiaowei Wu 001 (SIAM J. Comput., 2023)

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. - Monika Henzinger; Billy Jin; Richard Peng; David P. Williamson (Algorithmica, 2023)

Experimental Evaluation of Fully Dynamic k-Means via Coresets. - Monika Henzinger; David Saulpic; Leonhard Sidl (ALENEX, 2024)

Private Counting of Distinct Elements in the Turnstile Model and Extensions. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (APPROX/RANDOM, 2024)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time. - Max Dupré la Tour; Monika Henzinger; David Saulpic (ESA, 2024)

How Can Algorithms Help in Protecting Our Privacy (Invited Talk). - Monika Henzinger (GD, 2024)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. - Kyriakos Axiotis; Vincent Cohen-Addad; Monika Henzinger; Sammy Jerome; Vahab Mirrokni; David Saulpic; David P. Woodruff; Michael Wunder (ICML, 2024)

Making Old Things New: A Unified Algorithm for Differentially Private Clustering. - Max Dupré la Tour; Monika Henzinger; David Saulpic (ICML, 2024)

Electrical Flows for Polylogarithmic Competitive Oblivious Routing. - Gramoz Goranci; Monika Henzinger; Harald Räcke; Sushant Sachdeva; A. R. Sricharan (ITCS, 2024)

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. - Monika Henzinger; Barna Saha; Martin P. Seybold; Christopher Ye 001 (ITCS, 2024)

Expander Hierarchies for Normalized Cuts on Graphs. - Kathrin Hanauer; Monika Henzinger; Robin Münk; Harald Räcke; Maximilian Vötsch (KDD, 2024)

Continual Counting with Gradual Privacy Expiration. - Joel Daniel Andersson; Monika Henzinger; Rasmus Pagh; Teresa Anna Steiner; Jalaj Upadhyay (NeurIPS, 2024)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. - Monika Henzinger; Jason Li 006; Satish Rao; Di Wang 005 (SODA, 2024)

A Unifying Framework for Differentially Private Sums under Continual Observation. - Monika Henzinger; Jalaj Upadhyay; Sarvagya Upadhyay (SODA, 2024)

Dynamically Maintaining the Persistent Homology of Time Series. - Sebastiano Cultrera di Montesano; Herbert Edelsbrunner; Monika Henzinger; Lara Ost (SODA, 2024)

Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges. - Antoine El-Hayek; Monika Henzinger; Stefan Schmid 001 (DISC, 2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph. - Monika Henzinger; A. R. Sricharan; Leqi Zhu (CoRR, 2024)

Concurrent Composition for Continual Mechanisms. - Monika Henzinger; Roodabeh Safavi; Salil P. Vadhan (CoRR, 2024)

XCut/XCut v1.0.0. - Kathrin Hanauer; Monika Henzinger; Robin Münk; Harald Räcke; Maximilian Vötsch (Zenodo, 2024)

Differentially Private Continual Release of Histograms and Related Queries. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (AISTATS, 2025)

Incremental Approximate Maximum Flow via Residual Graph Sparsification. - Gramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan (ICALP, 2025)

On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. - Antoine El-Hayek; Kathrin Hanauer; Monika Henzinger (SAND, 2025)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation. - Antoine El-Hayek; Monika Henzinger; Jason Li 006 (SODA, 2025)

Improved Differentially Private Continual Observation Using Group Algebra. - Monika Henzinger; Jalaj Upadhyay (SODA, 2025)

Multiplicative auction algorithm for approximate maximum weight bipartite matching. - Da Wei Zheng; Monika Henzinger (Math. Program., 2025)

Binned Group Algebra Factorization for Differentially Private Continual Counting. - Monika Henzinger; Nikita P. Kalinin; Jalaj Upadhyay (CoRR, 2025)

Correlated Noise Mechanisms for Differentially Private Learning. - Krishna Pillutla; Jalaj Upadhyay; Christopher A. Choquette-Choo; Krishnamurthy Dvijotham; Arun Ganesh; Monika Henzinger; Jonathan Katz; Ryan McKenna; H. Brendan McMahan; Keith Rush; Thomas Steinke 002; Abhradeep Thakurta (CoRR, 2025)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism. - Laxman Dhulipala; Monika Henzinger; George Z. Li; Quanquan C. Liu; A. R. Sricharan; Leqi Zhu (CoRR, 2025)