| 2026 | SODA | Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time. | Antoine El-Hayek, Monika Henzinger, Jason Li |
| 2026 | SODA | Dynamic Hierarchical j-Tree Decomposition and Its Applications. | Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zcklein |
| 2026 | STOC | An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time. | Monika Henzinger, Robin Mnk, Harald Rcke |
| 2025 | AISTATS | Differentially Private Continual Release of Histograms and Related Queries. | Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner |
| 2025 | ESA | 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 |
| 2025 | ESA | Efficient Contractions of Dynamic Graphs - With Applications. | Monika Henzinger, Evangelos Kosinas, Robin Mnk, Harald Rcke |
| 2025 | ESA | Securing Dynamic Data: A Primer on Differentially Private Data Structures (Invited Talk). | Monika Henzinger, Roodabeh Safavi |
| 2025 | ICALP | Incremental Approximate Maximum Flow via Residual Graph Sparsification. | Gramoz Goranci, Monika Henzinger, Harald Rcke, A. R. Sricharan |
| 2025 | SODA | Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation. | Antoine El-Hayek, Monika Henzinger, Jason Li |
| 2025 | SODA | Improved Differentially Private Continual Observation Using Group Algebra. | Monika Henzinger, Jalaj Upadhyay |
| 2024 | ALENEX | Experimental Evaluation of Fully Dynamic | Monika Henzinger, David Saulpic, Leonhard Sidl |
| 2024 | ESA | Fully Dynamic k-Means Coreset in Near-Optimal Update Time. | Max Dupr la Tour, Monika Henzinger, David Saulpic |
| 2024 | GD | How Can Algorithms Help in Protecting Our Privacy (Invited Talk). | Monika Henzinger |
| 2024 | ICML | 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 |
| 2024 | ICML | Making Old Things New: A Unified Algorithm for Differentially Private Clustering. | Max Dupr la Tour, Monika Henzinger, David Saulpic |
| 2024 | KDD | Expander Hierarchies for Normalized Cuts on Graphs. | Kathrin Hanauer, Monika Henzinger, Robin Mnk, Harald Rcke, Maximilian Vtsch |
| 2024 | SODA | Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. | Monika Henzinger, Jason Li, Satish Rao, Di Wang |
| 2024 | SODA | A Unifying Framework for Differentially Private Sums under Continual Observation. | Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay |
| 2024 | SODA | Dynamically Maintaining the Persistent Homology of Time Series. | Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost |
| 2023 | ICALP | Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. | Gramoz Goranci, Monika Henzinger |
| 2023 | ICALP | Faster Submodular Maximization for Several Classes of Matroids. | Monika Henzinger, Paul Liu, Jan Vondrk, Da Wei Zheng |
| 2023 | ICML | Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. | Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay |
| 2023 | INFOCOM | Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. | Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid |
| 2023 | IPCO | Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. | Da Wei Zheng, Monika Henzinger |
| 2023 | SODA | Optimal Fully Dynamic | MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese |
| 2023 | SODA | Online Min-Max Paging. | Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vtsch |
| 2023 | SODA | Fully Dynamic Exact Edge Connectivity in Sublinear Time. | Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen |
| 2023 | SODA | Almost Tight Error Bounds on Differentially Private Continual Counting. | Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay |
| 2023 | STACS | Dynamic Maintenance of Monotone Dynamic Programs and Applications. | Monika Henzinger, Stefan Neumann, Harald Rcke, Stefan Schmid |
| 2022 | ALENEX | Practical Fully Dynamic Minimum Cut Algorithms. | Monika Henzinger, Alexander Noe, Christian Schulz |
| 2022 | ESA | Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. | Monika Henzinger, Ami Paz, A. R. Sricharan |
| 2022 | INFOCOM | Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. | Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer |
| 2022 | MFCS | Modern Dynamic Data Structures (Invited Talk). | Monika Henzinger |
| 2022 | PODC | Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. | Antoine El-Hayek, Monika Henzinger, Stefan Schmid |
| 2022 | SODA | The Complexity of Average-Case Dynamic Subgraph Counting. | Monika Henzinger, Andrea Lincoln, Barna Saha |
| 2021 | ALENEX | Fully Dynamic | Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil |
| 2021 | ESA | Differentially Private Algorithms for Graphs Under Continual Observation. | Hendrik Fichtenberger, Monika Henzinger, Lara Ost |
| 2021 | ICALP | Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. | Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil |
| 2021 | LICS | Symbolic Time and Space Tradeoffs for Probabilistic Verification. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Alexander Svozil |
| 2021 | Networking | On the Complexity of Weight-Dynamic Network Algorithms. | Monika Henzinger, Ami Paz, Stefan Schmid |
| 2021 | SODA | New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. | Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |
| 2021 | SODA | Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu |
| 2021 | SODA | Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. | Sebastian Forster, Gramoz Goranci, Monika Henzinger |
| 2021 | SODA | Tight Bounds for Online Graph Partitioning. | Monika Henzinger, Stefan Neumann, Harald Rcke, Stefan Schmid |
| 2021 | WADS | Upper and Lower Bounds for Fully Retroactive Graph Problems. | Monika Henzinger, Xiaowei Wu |
| 2020 | ALENEX | Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. | Kathrin Hanauer, Monika Henzinger, Christian Schulz |
| 2020 | ALENEX | Shared-Memory Branch-and-Reduce for Multiterminal Cuts. | Monika Henzinger, Alexander Noe, Christian Schulz |
| 2020 | ESA | Dynamic Matching Algorithms in Practice. | Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz |
| 2020 | ESA | Fully-Dynamic Coresets. | Monika Henzinger, Sagar Kale |
| 2020 | ESA | Finding All Global Minimum Cuts in Practice. | Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash |
| 2020 | FOCS | Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. | Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak |
| 2020 | STACS | Constant-Time Dynamic (Δ+1)-Coloring. | Monika Henzinger, Pan Peng |
| 2019 | CONCUR | Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Alexander Svozil |
| 2019 | FOCS | A New Deterministic Algorithm for Dynamic Set Cover. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2019 | ICALP | Algorithms and Hardness for Diameter in Dynamic Graphs. | Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein |
| 2019 | SODA | A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. | Aaron Bernstein, Sebastian Forster, Monika Henzinger |
| 2019 | STOC | Distributed edge connectivity in sublinear time. | Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak |
| 2019 | SIGMETRICS | Efficient Distributed Workload (Re-)Embedding. | Monika Henzinger, Stefan Neumann, Stefan Schmid |
| 2018 | ALENEX | Practical Minimum Cut Algorithms. | Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash |
| 2018 | CAV | Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. | Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman |
| 2018 | ESA | A Tree Structure For Dynamic Facility Location. | Gramoz Goranci, Monika Henzinger, Dariusz Leniowski |
| 2018 | ESA | Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. | Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2018 | LPAR | Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Alexander Svozil |
| 2018 | SODA | Dynamic Algorithms for Graph Coloring. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai |
| 2018 | SODA | Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Veronika Loitzenbauer |
| 2018 | SOFSEM | The State of the Art in Dynamic Graph Algorithms. | Monika Henzinger |
| 2017 | CSL | Improved Set-Based Symbolic Algorithms for Parity Games. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Veronika Loitzenbauer |
| 2017 | ESA | Improved Guarantees for Vertex Sparsification in Planar Graphs. | Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2017 | ESA | The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. | Gramoz Goranci, Monika Henzinger, Pan Peng |
| 2017 | ESA | Dynamic Clustering to Minimize the Sum of Radii. | Monika Henzinger, Dariusz Leniowski, Claire Mathieu |
| 2017 | ICALP | Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk). | Monika Henzinger |
| 2017 | ICML | Capacity Releasing Diffusion for Speed and Locality. | Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao |
| 2017 | IPCO | Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. | Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger |
| 2017 | MFCS | Faster Algorithms for Mean-Payoff Parity Games. | Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil |
| 2017 | SODA | Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2017 | SODA | Local Flow Partitioning for Faster Edge Connectivity. | Monika Henzinger, Satish Rao, Di Wang |
| 2016 | ESA | Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. | Gramoz Goranci, Monika Henzinger, Mikkel Thorup |
| 2016 | ESA | Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. | Monika Henzinger, Stefan Neumann |
| 2016 | ICALP | Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. | Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger |
| 2016 | LICS | Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Veronika Loitzenbauer |
| 2016 | MFCS | Conditionally Optimal Algorithms for Generalized Bchi Games. | Krishnendu Chatterjee, Wolfgang Dvork, Monika Henzinger, Veronika Loitzenbauer |
| 2016 | STOC | New deterministic approximation algorithms for fully dynamic matching. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai |
| 2016 | STOC | A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2015 | ICALP | Design of Dynamic Algorithms via Primal-Dual Method. | Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano |
| 2015 | ICALP | Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. | Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer |
| 2015 | ICALP | Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2015 | LICS | Improved Algorithms for One-Pair and k-Pair Streett Objectives. | Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer |
| 2015 | SODA | Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. | Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano |
| 2015 | STOC | Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. | Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis |
| 2015 | STOC | Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak |
| 2015 | STACS | Welfare Maximization with Friends-of-Friends Network Externalities. | Sayan Bhattacharya, Wolfgang Dvork, Monika Henzinger, Martin Starnberger |
| 2014 | ESA | Online Bipartite Matching with Decomposable Weights. | Moses Charikar, Monika Henzinger, Huy L. Nguyen |
| 2014 | FOCS | Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | SODA | A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | STOC | Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | WAOA | Online Ad Assignment with an Ad Exchange. | Wolfgang Dvork, Monika Henzinger |
| 2013 | ESA | Maximizing a Submodular Function with Viability Constraints. | Wolfgang Dvork, Monika Henzinger, David P. Williamson |
| 2013 | FOCS | Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2013 | ICALP | Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2012 | CIKM | Maximizing revenue from strategic recommendations under decaying trust. | Paul Dtting, Monika Henzinger, Ingmar Weber |
| 2012 | ESA | Polynomial-Time Algorithms for Energy Games with Special Weight Structures. | Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2012 | ICALP | On Multiple Keyword Sponsored Search Auctions with Budgets. | Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger |
| 2012 | SODA | An | Krishnendu Chatterjee, Monika Henzinger |
| 2011 | CAV | Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Bchi Objectives. | Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah |
| 2011 | ESA | Multi-parameter Mechanism Design under Budget and Matroid Constraints. | Monika Henzinger, Angelina Vidali |
| 2011 | WWW | An expressive mechanism for auctions on the web. | Paul Dtting, Monika Henzinger, Ingmar Weber |
| 2011 | SODA | Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. | Krishnendu Chatterjee, Monika Henzinger |
| 2010 | CIAC | Mechanisms for the Marriage and the Assignment Game. | Paul Dtting, Monika Henzinger |
| 2010 | ESA | Online Stochastic Packing Applied to Display Ad Allocation. | Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein |
| 2010 | WWW | How much is your personal recommendation worth? | Paul Dtting, Monika Henzinger, Ingmar Weber |
| 2010 | STACS | Sponsored Search, Market Equilibria, and the Hungarian Method. | Paul Dtting, Monika Henzinger, Ingmar Weber |
| 2009 | WWW | Purely URL-based topic classification. | Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber |
| 2009 | WWW | Detecting the origin of text segments efficiently. | Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger |
| 2009 | STACS | A Comparison of Techniques for Sampling Web Pages. | Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler |
| 2007 | SODA | Combinatorial algorithms for web search engines: three success stories. | Monika Henzinger |
| 2006 | SIGIR | Finding near-duplicate web pages: a large-scale evaluation of algorithms. | Monika Henzinger |
| 2004 | ESA | Algorithmic Aspects of Web Search Engines. | Monika Henzinger |
| 2004 | ICALP | The Past, Present, and Future of Web Search Engines p. | Monika Henzinger |
| 2004 | PODS | The Past, Present and Future of Web Information Retrieval. | Monika Henzinger |
| 2003 | WWW | Query-free news search. | Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin |
| 2002 | CLUSTER | Indexing the Web - A Challenge for Supercomputers. | Monika Henzinger |
| 2001 | ICDM | Who Links to Whom: Mining Linkage between Web Sites. | Krishna Bharat, Bay-Wei Chang, Monika Henzinger, Matthias Ruhl |
| 2000 | ESA | Web Information Retrieval - an Algorithmic Perspective. | Monika Henzinger |