Monika Henzinger

348 papers A* 69A 44B 14C 2Journal 187Unranked 25
YearRankTypeTitle / Venue / Authors
2026 A* conf
Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.
SODA
Antoine El-Hayek, Monika Henzinger, Jason Li
2026 J jnl
Dynamic Hierarchical
CoRR
Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zöcklein
2026 A* conf
Dynamic Hierarchical j-Tree Decomposition and Its Applications.
SODA
Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zöcklein
2025 J jnl
An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.
CoRR
Monika Henzinger, Robin Münk, Harald Räcke
2025 J jnl
Binned Group Algebra Factorization for Differentially Private Continual Counting.
CoRR
Monika Henzinger, Nikita P. Kalinin, Jalaj Upadhyay
2025 J jnl
Correlated Noise Mechanisms for Differentially Private Learning.
CoRR
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, Abhradeep Thakurta
2025 J jnl
Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.
CoRR
Antoine El-Hayek, Monika Henzinger, Jason Li
2025 A conf
Differentially Private Continual Release of Histograms and Related Queries.
AISTATS
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
2025 A conf
Efficient Contractions of Dynamic Graphs - With Applications.
ESA
Monika Henzinger, Evangelos Kosinas, Robin Münk, Harald Räcke
2025 J jnl
Efficient Contractions of Dynamic Graphs - with Applications.
CoRR
Monika Henzinger, Evangelos Kosinas, Robin Münk, Harald Räcke
2025 A* conf
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.
SODA
Antoine El-Hayek, Monika Henzinger, Jason Li
2025 A* conf
Improved Differentially Private Continual Observation Using Group Algebra.
SODA
Monika Henzinger, Jalaj Upadhyay
2025 J jnl
Improved Lower Bounds for Privacy under Continual Release.
CoRR
Bardiya Aryanfard, Monika Henzinger, David Saulpic, A. R. Sricharan
2025 A* conf
Incremental Approximate Maximum Flow via Residual Graph Sparsification.
ICALP
Gramoz Goranci, Monika Henzinger, Harald Räcke, A. R. Sricharan
2025 J jnl
Incremental Approximate Maximum Flow via Residual Graph Sparsification.
CoRR
Gramoz Goranci, Monika Henzinger, Harald Räcke, A. R. Sricharan
2025 J jnl
Multiplicative auction algorithm for approximate maximum weight bipartite matching.
Math. Program.
Da Wei Zheng, Monika Henzinger
2025 A conf
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.
ESA
Laxman Dhulipala, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, Leqi Zhu
2025 J jnl
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.
CoRR
Laxman Dhulipala, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, Leqi Zhu
2025 J jnl
Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting.
CoRR
Monika Henzinger, Nikita P. Kalinin, Jalaj Upadhyay
2025 — conf
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
SAND
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
2025 A conf
Securing Dynamic Data: A Primer on Differentially Private Data Structures (Invited Talk).
ESA
Monika Henzinger, Roodabeh Safavi
2024 A* conf
A Unifying Framework for Differentially Private Sums under Continual Observation.
SODA
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
2024 A conf
Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.
DISC
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2024 J jnl
Concurrent Composition for Continual Mechanisms.
CoRR
Monika Henzinger, Roodabeh Safavi, Salil P. Vadhan
2024 A* conf
Continual Counting with Gradual Privacy Expiration.
NeurIPS
Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
2024 J jnl
Continual Counting with Gradual Privacy Expiration.
CoRR
Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
2024 A* conf
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.
ICML
Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder
2024 J jnl
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.
CoRR
Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder
2024 A* conf
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.
SODA
Monika Henzinger, Jason Li, Satish Rao, Di Wang
2024 J jnl
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.
CoRR
Monika Henzinger, Jason Li, Satish Rao, Di Wang
2024 A* conf
Dynamically Maintaining the Persistent Homology of Time Series.
SODA
Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
2024 A conf
Electrical Flows for Polylogarithmic Competitive Oblivious Routing.
ITCS
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
2024 A* conf
Expander Hierarchies for Normalized Cuts on Graphs.
KDD
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
2024 J jnl
Expander Hierarchies for Normalized Cuts on Graphs.
CoRR
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
2024 A conf
Experimental Evaluation of Fully Dynamic
ALENEX
Monika Henzinger, David Saulpic, Leonhard Sidl
2024 J jnl
Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.
CoRR
Antoine El-Hayek, Monika Henzinger, Jason Li
2024 A conf
Fully Dynamic k-Means Coreset in Near-Optimal Update Time.
ESA
Max Dupré la Tour, Monika Henzinger, David Saulpic
2024 J jnl
Fully Dynamic k-Means Coreset in Near-Optimal Update Time.
CoRR
Max Dupré la Tour, Monika Henzinger, David Saulpic
2024 A conf
How Can Algorithms Help in Protecting Our Privacy (Invited Talk).
GD
Monika Henzinger
2024 J jnl
Improved Differentially Private Continual Observation Using Group Algebra.
CoRR
Monika Henzinger, Jalaj Upadhyay
2024 A* conf
Making Old Things New: A Unified Algorithm for Differentially Private Clustering.
ICML
Max Dupré la Tour, Monika Henzinger, David Saulpic
2024 J jnl
Making Old Things New: A Unified Algorithm for Differentially Private Clustering.
CoRR
Max Dupré la Tour, Monika Henzinger, David Saulpic
2024 A conf
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.
ITCS
Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye
2024 A conf
Private Counting of Distinct Elements in the Turnstile Model and Extensions.
APPROX/RANDOM
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
2024 J jnl
Private Counting of Distinct Elements in the Turnstile Model and Extensions.
CoRR
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
2024 J jnl
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph.
CoRR
Monika Henzinger, A. R. Sricharan, Leqi Zhu
2023 A conf
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.
ITCS
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
2023 J jnl
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.
Algorithmica
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
2023 J jnl
A Unifying Framework for Differentially Private Sums under Continual Observation.
CoRR
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
2023 A* conf
Almost Tight Error Bounds on Differentially Private Continual Counting.
SODA
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
2023 A conf
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.
ITCS
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2023 A* conf
Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation.
ICML
Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay
2023 J jnl
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.
SIAM J. Comput.
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
2023 J jnl
Differential Privacy for Clustering Under Continual Observation.
CoRR
Max Dupré la Tour, Monika Henzinger, David Saulpic
2023 J jnl
Differentially Private Data Structures under Continual Observation for Histograms and Related Queries.
CoRR
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
2023 J jnl
Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation.
CoRR
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
2023 A* conf
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters.
INFOCOM
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
2023 J jnl
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters.
CoRR
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
2023 A conf
Dynamic Maintenance of Monotone Dynamic Programs and Applications.
STACS
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
2023 J jnl
Dynamic Maintenance of Monotone Dynamic Programs and Applications.
CoRR
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
2023 J jnl
Dynamically Maintaining the Persistent Homology of Time Series.
CoRR
Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
2023 A* conf
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.
ICALP
Gramoz Goranci, Monika Henzinger
2023 J jnl
Electrical Flows for Polylogarithmic Competitive Oblivious Routing.
CoRR
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
2023 J jnl
Experimental Evaluation of Fully Dynamic k-Means via Coresets.
CoRR
Monika Henzinger, David Saulpic, Leonhard Sidl
2023 A* conf
Faster Submodular Maximization for Several Classes of Matroids.
ICALP
Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng
2023 J jnl
Faster Submodular Maximization for Several Classes of Matroids.
CoRR
Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng
2023 A* conf
Fully Dynamic Exact Edge Connectivity in Sublinear Time.
SODA
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2023 J jnl
Fully Dynamic Exact Edge Connectivity in Sublinear Time.
CoRR
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
2023 B conf
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.
IPCO
Da Wei Zheng, Monika Henzinger
2023 J jnl
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.
CoRR
Da Wei Zheng, Monika Henzinger
2023 J jnl
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring.
CoRR
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
2023 J jnl
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.
CoRR
Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye
2023 A* conf
Online Min-Max Paging.
SODA
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
2023 A* conf
Optimal Fully Dynamic
SODA
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
2023 J jnl
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries.
CoRR
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
2023 A* conf
Simple, Scalable and Effective Clustering via One-Dimensional Projections.
NeurIPS
Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten
2023 J jnl
Simple, Scalable and Effective Clustering via One-Dimensional Projections.
CoRR
Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten
2023 J jnl
Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries.
CoRR
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 J jnl
Almost Tight Error Bounds on Differentially Private Continual Counting.
CoRR
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
2022 J jnl
Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks.
CoRR
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 A* conf
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear.
PODC
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 J jnl
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear.
CoRR
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
2022 J jnl
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms.
CoRR
Monika Henzinger, Jalaj Upadhyay
2022 J jnl
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms.
IACR Cryptol. ePrint Arch.
Monika Henzinger, Jalaj Upadhyay
2022 J jnl
Constant-time Dynamic (Δ +1)-Coloring.
ACM Trans. Algorithms
Monika Henzinger, Pan Peng
2022 A* conf
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.
INFOCOM
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
2022 J jnl
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies.
CoRR
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
2022 A conf
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs.
ESA
Monika Henzinger, Ami Paz, A. R. Sricharan
2022 J jnl
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs.
CoRR
Monika Henzinger, Ami Paz, A. R. Sricharan
2022 — conf
Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification.
Principles of Systems Design
Monika Henzinger
2022 — conf
Fully Dynamic Four-Vertex Subgraph Counting.
SAND
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
2022 J jnl
Incremental Approximate Maximum Flow in m
CoRR
Gramoz Goranci, Monika Henzinger
2022 — conf
Leximax Approximations and Representative Cohort Selection.
FORC
Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
2022 J jnl
Leximax Approximations and Representative Cohort Selection.
CoRR
Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
2022 B conf
Modern Dynamic Data Structures (Invited Talk).
MFCS
Monika Henzinger
2022 J jnl
Online Min-Max Paging.
CoRR
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
2022 A conf
Practical Fully Dynamic Minimum Cut Algorithms.
ALENEX
Monika Henzinger, Alexander Noe, Christian Schulz
2022 — conf
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk).
SAND
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2022 J jnl
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide.
ACM J. Exp. Algorithmics
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2022 J jnl
The Augmentation-Speed Tradeoff for Consistent Network Updates.
CoRR
Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
2022 A* conf
The Complexity of Average-Case Dynamic Subgraph Counting.
SODA
Monika Henzinger, Andrea Lincoln, Barna Saha
2022 — conf
The augmentation-speed tradeoff for consistent network updates.
SOSR
Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
2021 J jnl
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.
ACM Trans. Algorithms
Aaron Bernstein, Sebastian Forster, Monika Henzinger
2021 J jnl
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.
SIAM J. Comput.
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2021 J jnl
Algorithms and conditional lower bounds for planning problems.
Artif. Intell.
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2021 J jnl
Constant-time dynamic weight approximation for minimum spanning forest.
Inf. Comput.
Monika Henzinger, Pan Peng
2021 J jnl
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows.
CoRR
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
2021 A conf
Differentially Private Algorithms for Graphs Under Continual Observation.
ESA
Hendrik Fichtenberger, Monika Henzinger, Lara Ost
2021 J jnl
Differentially Private Algorithms for Graphs Under Continual Observation.
CoRR
Hendrik Fichtenberger, Monika Henzinger, Lara Ost
2021 A* conf
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications.
SODA
Sebastian Forster, Gramoz Goranci, Monika Henzinger
2021 A* conf
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.
SODA
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
2021 A* conf
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.
ICALP
Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil
2021 — conf
Faster Parallel Multiterminal Cuts.
ACDA
Monika Henzinger, Alexander Noe, Christian Schulz
2021 A conf
Fully Dynamic
ALENEX
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil
2021 J jnl
Fully Dynamic Four-Vertex Subgraph Counting.
CoRR
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
2021 A* conf
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners.
SODA
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
2021 J jnl
On fully dynamic constant-factor approximation algorithms for clustering problems.
CoRR
Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese
2021 B conf
On the Complexity of Weight-Dynamic Network Algorithms.
Networking
Monika Henzinger, Ami Paz, Stefan Schmid
2021 J jnl
On the Complexity of Weight-Dynamic Network Algorithms.
CoRR
Monika Henzinger, Ami Paz, Stefan Schmid
2021 J jnl
Practical Fully Dynamic Minimum Cut Algorithms.
CoRR
Monika Henzinger, Alexander Noe, Christian Schulz
2021 J jnl
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice?
CoRR
Monika Henzinger, Alexander Noe
2021 J jnl
Recent Advances in Fully Dynamic Graph Algorithms.
CoRR
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2021 A* conf
Symbolic Time and Space Tradeoffs for Probabilistic Verification.
LICS
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2021 J jnl
Symbolic Time and Space Tradeoffs for Probabilistic Verification.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2021 J jnl
The Complexity of Average-Case Dynamic Subgraph Counting.
Electron. Colloquium Comput. Complex.
Monika Henzinger, Andrea Lincoln, Barna Saha
2021 A* conf
Tight Bounds for Online Graph Partitioning.
SODA
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
2021 B conf
Upper and Lower Bounds for Fully Retroactive Graph Problems.
WADS
Monika Henzinger, Xiaowei Wu
2020 J jnl
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems.
CoRR
Monika Henzinger, Billy Jin, David P. Williamson
2020 J jnl
An Improved Algorithm for Dynamic Set Cover.
CoRR
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
2020 A conf
Constant-Time Dynamic (Δ+1)-Coloring.
STACS
Monika Henzinger, Pan Peng
2020 J jnl
Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest.
CoRR
Monika Henzinger, Pan Peng
2020 J jnl
Deterministic Dynamic Matching in O(1) Update Time.
Algorithmica
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
2020 A* conf
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
SoCG
Monika Henzinger, Stefan Neumann, Andreas Wiese
2020 J jnl
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
CoRR
Monika Henzinger, Stefan Neumann, Andreas Wiese
2020 J jnl
Dynamic Clustering to Minimize the Sum of Radii.
Algorithmica
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
2020 J jnl
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications.
CoRR
Sebastian Forster, Gramoz Goranci, Monika Henzinger
2020 A conf
Dynamic Matching Algorithms in Practice.
ESA
Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz
2020 J jnl
Dynamic Matching Algorithms in Practice.
CoRR
Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz
2020 J jnl
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity.
CoRR
Monika Henzinger, Stefan Neumann, Andreas Wiese
2020 A* conf
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.
FOCS
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020 J jnl
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.
CoRR
Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak
2020 B conf
Faster Fully Dynamic Transitive Closure in Practice.
SEA
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2020 J jnl
Faster Fully Dynamic Transitive Closure in Practice.
CoRR
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2020 J jnl
Faster Parallel Multiterminal Cuts.
CoRR
Monika Henzinger, Alexander Noe, Christian Schulz
2020 J jnl
Finding All Global Minimum Cuts In Practice.
CoRR
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2020 A conf
Finding All Global Minimum Cuts in Practice.
ESA
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2020 A conf
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.
ALENEX
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2020 A conf
Fully-Dynamic Coresets.
ESA
Monika Henzinger, Sagar Kale
2020 J jnl
Fully-Dynamic Coresets.
CoRR
Monika Henzinger, Sagar Kale
2020 J jnl
Improved Guarantees for Vertex Sparsification in Planar Graphs.
SIAM J. Discret. Math.
Gramoz Goranci, Monika Henzinger, Pan Peng
2020 J jnl
Local Flow Partitioning for Faster Edge Connectivity.
SIAM J. Comput.
Monika Henzinger, Satish Rao, Di Wang
2020 J jnl
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners.
CoRR
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
2020 A conf
Shared-Memory Branch-and-Reduce for Multiterminal Cuts.
ALENEX
Monika Henzinger, Alexander Noe, Christian Schulz
2020 J jnl
Tight Bounds for Online Graph Partitioning.
CoRR
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
2020 — ch.
Vienna Graph Clustering.
Protein-Protein Interaction Networks
Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster
2019 A* conf
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.
SODA
Aaron Bernstein, Sebastian Forster, Monika Henzinger
2019 A* conf
A New Deterministic Algorithm for Dynamic Set Cover.
FOCS
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2019 J jnl
A New Deterministic Algorithm for Dynamic Set Cover.
CoRR
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2019 J jnl
A Tree Structure For Dynamic Facility Location.
CoRR
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski
2019 A* conf
Algorithms and Hardness for Diameter in Dynamic Graphs.
ICALP
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2019 J jnl
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing.
CoRR
Monika Henzinger, Pan Peng
2019 J jnl
Distributed Edge Connectivity in Sublinear Time.
CoRR
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
2019 A* conf
Distributed edge connectivity in sublinear time.
STOC
Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
2019 — conf
Efficient Distributed Workload (Re-)Embedding.
SIGMETRICS (Abstracts)
Monika Henzinger, Stefan Neumann, Stefan Schmid
2019 J jnl
Efficient Distributed Workload (Re-)Embedding.
CoRR
Monika Henzinger, Stefan Neumann, Stefan Schmid
2019 J jnl
Efficient Distributed Workload (Re-)Embedding.
Proc. ACM Meas. Anal. Comput. Syst.
Monika Henzinger, Stefan Neumann, Stefan Schmid
2019 J jnl
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.
CoRR
Kathrin Hanauer, Monika Henzinger, Christian Schulz
2019 J jnl
Fully Dynamic k-Center Clustering in Doubling Metrics.
CoRR
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil
2019 B conf
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.
CONCUR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2019 J jnl
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2019 J jnl
New Amortized Cell-Probe Lower Bounds for Dynamic Problems.
CoRR
Sayan Bhattacharya, Monika Henzinger, Stefan Neumann
2019 J jnl
New amortized cell-probe lower bounds for dynamic problems.
Theor. Comput. Sci.
Sayan Bhattacharya, Monika Henzinger, Stefan Neumann
2019 J jnl
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2019 J jnl
Shared-Memory Branch-and-Reduce for Multiterminal Cuts.
CoRR
Monika Henzinger, Alexander Noe, Christian Schulz
2019 A conf
Shared-Memory Exact Minimum Cuts.
IPDPS
Monika Henzinger, Alexander Noe, Christian Schulz
2019 J jnl
Upper and Lower Bounds for Fully Retroactive Graph Problems.
CoRR
Monika Henzinger, Xiaowei Wu
2018 J jnl
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.
CoRR
Aaron Bernstein, Sebastian Forster, Monika Henzinger
2018 A conf
A Tree Structure For Dynamic Facility Location.
ESA
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski
2018 A* conf
Algorithms and Conditional Lower Bounds for Planning Problems.
ICAPS
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2018 J jnl
Algorithms and Conditional Lower Bounds for Planning Problems.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2018 J jnl
Algorithms and Hardness for Diameter in Dynamic Graphs.
CoRR
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2018 J jnl
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time.
J. ACM
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2018 J jnl
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.
SIAM J. Comput.
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2018 A* conf
Dynamic Algorithms for Graph Coloring.
SODA
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
2018 A conf
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.
ESA
Gramoz Goranci, Monika Henzinger, Pan Peng
2018 J jnl
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.
CoRR
Gramoz Goranci, Monika Henzinger, Pan Peng
2018 J jnl
Dynamic algorithms via the primal-dual method.
Inf. Comput.
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2018 J jnl
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.
ACM Trans. Algorithms
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2018 A* conf
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.
SODA
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2018 B conf
Memetic Graph Clustering.
SEA
Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster
2018 J jnl
Memetic Graph Clustering.
CoRR
Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster
2018 A conf
Practical Minimum Cut Algorithms.
ALENEX
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2018 J jnl
Practical Minimum Cut Algorithms.
ACM J. Exp. Algorithmics
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2018 A* ed.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018
STOC
Ilias Diakonikolas, David Kempe, Monika Henzinger
2018 B conf
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.
LPAR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
2018 J jnl
Shared-memory Exact Minimum Cuts.
CoRR
Monika Henzinger, Alexander Noe, Christian Schulz
2018 — conf
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives.
CAV (2)
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman
2018 J jnl
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives.
CoRR
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman
2018 B conf
The State of the Art in Dynamic Graph Algorithms.
SOFSEM
Monika Henzinger
2018 J jnl
Valuation Compressions in VCG-Based Combinatorial Auctions.
ACM Trans. Economics and Comput.
Paul Dütting, Monika Henzinger, Martin Starnberger
2017 A* conf
Capacity Releasing Diffusion for Speed and Locality.
ICML
Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao
2017 J jnl
Capacity Releasing Diffusion for Speed and Locality.
CoRR
Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao
2017 A conf
Conditional Hardness for Sensitivity Problems.
ITCS
Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams
2017 J jnl
Conditional Hardness for Sensitivity Problems.
CoRR
Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams
2017 B conf
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.
IPCO
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
2017 J jnl
Dynamic Algorithms for Graph Coloring.
CoRR
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai
2017 A conf
Dynamic Clustering to Minimize the Sum of Radii.
ESA
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
2017 J jnl
Dynamic clustering to minimize the sum of radii.
CoRR
Monika Henzinger, Dariusz Leniowski, Claire Mathieu
2017 A* conf
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk).
ICALP
Monika Henzinger
2017 B conf
Faster Algorithms for Mean-Payoff Parity Games.
MFCS
Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil
2017 J jnl
Faster Algorithms for Mean-Payoff Parity Games.
CoRR
Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil
2017 A* conf
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in
SODA
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2017 J jnl
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log
CoRR
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2017 J jnl
Improved Algorithms for Parity and Streett objectives.
Log. Methods Comput. Sci.
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer
2017 J jnl
Improved Algorithms for Topic Distillation in a Hyperlinked Environment.
SIGIR Forum
Krishna Bharat, Monika Henzinger
2017 A conf
Improved Guarantees for Vertex Sparsification in Planar Graphs.
ESA
Gramoz Goranci, Monika Henzinger, Pan Peng
2017 J jnl
Improved Guarantees for Vertex Sparsification in Planar Graphs.
CoRR
Gramoz Goranci, Monika Henzinger, Pan Peng
2017 B conf
Improved Set-Based Symbolic Algorithms for Parity Games.
CSL
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2017 J jnl
Improved Set-based Symbolic Algorithms for Parity Games.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2017 A* conf
Local Flow Partitioning for Faster Edge Connectivity.
SODA
Monika Henzinger, Satish Rao, Di Wang
2017 J jnl
Local Flow Partitioning for Faster Edge Connectivity.
CoRR
Monika Henzinger, Satish Rao, Di Wang
2017 J jnl
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2017 J jnl
Maximizing a Submodular Function with Viability Constraints.
Algorithmica
Wolfgang Dvorák, Monika Henzinger, David P. Williamson
2017 J jnl
Practical Minimum Cut Algorithms.
CoRR
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
2017 J jnl
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.
ACM Trans. Algorithms
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2017 A conf
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.
ESA
Gramoz Goranci, Monika Henzinger, Pan Peng
2017 J jnl
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.
CoRR
Gramoz Goranci, Monika Henzinger, Pan Peng
2017 J jnl
Welfare Maximization with Friends-of-Friends Network Externalities.
Theory Comput. Syst.
Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger
2016 A* conf
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths.
STOC
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2016 J jnl
Ad Exchange: Envy-Free Auctions with Mediators.
CoRR
Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer
2016 B conf
Conditionally Optimal Algorithms for Generalized Büchi Games.
MFCS
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2016 J jnl
Conditionally Optimal Algorithms for Generalized Büchi Games.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2016 J jnl
Design of Dynamic Algorithms via Primal-Dual Method.
CoRR
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2016 J jnl
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time.
CoRR
Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
2016 J jnl
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization.
SIAM J. Comput.
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2016 — ch.
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization.
Encyclopedia of Algorithms
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2016 J jnl
EATCS Fellows' Advice to the Young Theoretical Computer Scientist.
Bull. EATCS
Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas
2016 A* conf
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.
ICALP
Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
2016 J jnl
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.
CoRR
Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
2016 J jnl
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2016 A conf
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time.
ESA
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2016 J jnl
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time.
CoRR
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
2016 A conf
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning.
ESA
Monika Henzinger, Stefan Neumann
2016 J jnl
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning.
CoRR
Monika Henzinger, Stefan Neumann
2016 J jnl
Maximizing a Submodular Function with Viability Constraints.
CoRR
Wolfgang Dvorák, Monika Henzinger, David P. Williamson
2016 A* conf
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction.
LICS
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2016 J jnl
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction.
CoRR
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2016 J jnl
New Deterministic Approximation Algorithms for Fully Dynamic Matching.
CoRR
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2016 A* conf
New deterministic approximation algorithms for fully dynamic matching.
STOC
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai
2016 J jnl
Online Ad Assignment with an Ad Exchange.
CoRR
Wolfgang Dvorák, Monika Henzinger
2016 — ch.
PageRank Algorithm.
Encyclopedia of Algorithms
Monika Henzinger
2016 J jnl
Polynomial-Time Algorithms for Energy Games with Special Weight Structures.
CoRR
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2015 — conf
Ad Exchange: Envy-Free Auctions with Mediators.
WINE
Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer
2015 J jnl
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2015 J jnl
An Expressive Mechanism for Auctions on the Web.
ACM Trans. Economics and Comput.
Paul Dütting, Monika Henzinger, Ingmar Weber
2015 J jnl
Auctions for Heterogeneous Items and Budget Limits.
ACM Trans. Economics and Comput.
Paul Dütting, Monika Henzinger, Martin Starnberger
2015 — conf
Combinatorial Auctions with Conflict-Based Externalities.
WINE
Yun Kuen Cheung, Monika Henzinger, Martin Hoefer, Martin Starnberger
2015 J jnl
Combinatorial Auctions with Conflict-Based Externalities.
CoRR
Yun Kuen Cheung, Monika Henzinger, Martin Hoefer, Martin Starnberger
2015 J jnl
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2015 — conf
Design of Dynamic Algorithms via Primal-Dual Method.
ICALP (1)
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2015 A* conf
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.
SODA
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2015 — conf
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.
ICALP (1)
Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
2015 — conf
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.
ICALP (1)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2015 A* conf
Improved Algorithms for One-Pair and k-Pair Streett Objectives.
LICS
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer
2015 J jnl
On Multiple Keyword Sponsored Search Auctions with Budgets.
ACM Trans. Economics and Comput.
Riccardo Colini-Baldeschi, Stefano Leonardi, Monika Henzinger, Martin Starnberger
2015 A* conf
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.
STOC
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
2015 J jnl
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.
CoRR
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
2015 J jnl
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2015 J jnl
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2015 J jnl
Truthful unit-demand auctions with budgets revisited.
Theor. Comput. Sci.
Monika Henzinger, Veronika Loitzenbauer
2015 A* conf
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.
STOC
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
2015 J jnl
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
2015 A conf
Welfare Maximization with Friends-of-Friends Network Externalities.
STACS
Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger
2014 A* conf
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.
SODA
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2014 J jnl
Approximating the minimum cycle mean.
Theor. Comput. Sci.
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin
2014 A* conf
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time.
FOCS
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2014 J jnl
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.
CoRR
Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
2014 J jnl
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.
J. ACM
Krishnendu Chatterjee, Monika Henzinger
2014 J jnl
Finding 2-edge and 2-vertex strongly connected components in quadratic time.
CoRR
Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
2014 J jnl
Improved Algorithms for One-Pair and k-Pair Streett Objectives.
CoRR
Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer
2014 — conf
Limiting Price Discrimination when Selling Products with Positive Network Externalities.
WINE
Ludek Cigler, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger
2014 B conf
Online Ad Assignment with an Ad Exchange.
WAOA
Wolfgang Dvorák, Monika Henzinger
2014 A conf
Online Bipartite Matching with Decomposable Weights.
ESA
Moses Charikar, Monika Henzinger, Huy L. Nguyen
2014 J jnl
Online Bipartite Matching with Decomposable Weights.
CoRR
Moses Charikar, Monika Henzinger, Huy L. Nguyen
2014 J jnl
Polynomial-Time Algorithms for Energy Games with Special Weight Structures.
Algorithmica
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2014 A* conf
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs.
STOC
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2013 J jnl
38th International Colloquium on Automata, Languages and Programming.
Inf. Comput.
Luca Aceto, Monika Henzinger, Jirí Sgall
2013 J jnl
A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.
ACM Trans. Web
Eda Baykan, Monika Henzinger, Ingmar Weber
2013 — conf
Approximating the minimum cycle mean.
GandALF
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
2013 J jnl
Bidder optimal assignments for general utilities.
Theor. Comput. Sci.
Paul Dütting, Monika Henzinger, Ingmar Weber
2013 A* conf
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization.
FOCS
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2013 J jnl
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization.
CoRR
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2013 A conf
Maximizing a Submodular Function with Viability Constraints.
ESA
Wolfgang Dvorák, Monika Henzinger, David P. Williamson
2013 J jnl
Sponsored search, market equilibria, and the Hungarian Method.
Inf. Process. Lett.
Paul Dütting, Monika Henzinger, Ingmar Weber
2013 — conf
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.
ICALP (2)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2013 J jnl
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives.
Formal Methods Syst. Des.
Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah
2013 — conf
Valuation Compressions in VCG-Based Combinatorial Auctions.
WINE
Paul Dütting, Monika Henzinger, Martin Starnberger
2013 J jnl
Valuation Compressions in VCG-Based Combinatorial Auctions.
CoRR
Paul Duetting, Monika Henzinger, Martin Starnberger
2012 A* conf
An
SODA
Krishnendu Chatterjee, Monika Henzinger
2012 J jnl
Auctions with Heterogeneous Items and Budget Limits
CoRR
Paul Dütting, Monika Henzinger, Martin Starnberger
2012 — conf
Auctions with Heterogeneous Items and Budget Limits.
WINE
Paul Dütting, Monika Henzinger, Martin Starnberger
2012 A conf
Maximizing revenue from strategic recommendations under decaying trust.
CIKM
Paul Dütting, Monika Henzinger, Ingmar Weber
2012 — conf
On Multiple Keyword Sponsored Search Auctions with Budgets.
ICALP (2)
Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger
2012 A conf
Polynomial-Time Algorithms for Energy Games with Special Weight Structures.
ESA
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2012 J jnl
The Presburger Award 2013: Call for Nominations.
Bull. EATCS
Monika Henzinger
2011 J jnl
A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.
ACM Trans. Web
Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber
2011 J jnl
An O(n^2) Time Algorithm for Alternating Büchi Games
CoRR
Krishnendu Chatterjee, Monika Henzinger
2011 A* conf
An expressive mechanism for auctions on the web.
WWW
Paul Dütting, Monika Henzinger, Ingmar Weber
2011 — ed.
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I
ICALP (1)
Luca Aceto, Monika Henzinger, Jirí Sgall
2011 — ed.
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II
ICALP (2)
Luca Aceto, Monika Henzinger, Jirí Sgall
2011 A* conf
Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification.
SODA
Krishnendu Chatterjee, Monika Henzinger
2011 A conf
Multi-parameter Mechanism Design under Budget and Matroid Constraints.
ESA
Monika Henzinger, Angelina Vidali
2011 J jnl
Offline file assignments for online load balancing.
Inf. Process. Lett.
Paul Dütting, Monika Henzinger, Ingmar Weber
2011 J jnl
On Multiple Round Sponsored Search Auctions with Budgets
CoRR
Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger
2011 J jnl
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives
CoRR
Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah
2011 A* conf
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.
CAV
Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah
2010 A* conf
How much is your personal recommendation worth?
WWW
Paul Dütting, Monika Henzinger, Ingmar Weber
2010 C conf
Mechanisms for the Marriage and the Assignment Game.
CIAC
Paul Dütting, Monika Henzinger
2010 J jnl
Online Stochastic Ad Allocation: Efficiency and Fairness
CoRR
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein
2010 — conf
Online Stochastic Packing Applied to Display Ad Allocation.
ESA (1)
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein
2010 A conf
Sponsored Search, Market Equilibria, and the Hungarian Method.
STACS
Paul Dütting, Monika Henzinger, Ingmar Weber
2010 J jnl
The stability of the
Scientometrics
Monika Henzinger, Jacob Suñol, Ingmar Weber
2009 J jnl
A Comparison of Techniques for Sampling Web Pages
CoRR
Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler
2009 A conf
A Comparison of Techniques for Sampling Web Pages.
STACS
Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler
2009 — conf
Bidder Optimal Assignments for General Utilities.
WINE
Paul Dütting, Monika Henzinger, Ingmar Weber
2009 A* conf
Detecting the origin of text segments efficiently.
WWW
Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger
2009 J jnl
On the Pricing of Recommendations and Recommending Strategically
CoRR
Paul Dütting, Monika Henzinger, Ingmar Weber
2009 A* conf
Purely URL-based topic classification.
WWW
Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber
2009 J jnl
Sponsored Search, Market Equilibria, and the Hungarian Method
CoRR
Paul Dütting, Monika Henzinger, Ingmar Weber
2008 — ch.
PageRank Algorithm.
Encyclopedia of Algorithms
Monika Henzinger
2008 J jnl
Web page language identification based on URLs.
Proc. VLDB Endow.
Eda Baykan, Monika Henzinger, Ingmar Weber
2007 A* conf
Combinatorial algorithms for web search engines: three success stories.
SODA
Monika Henzinger
2006 A* conf
Finding near-duplicate web pages: a large-scale evaluation of algorithms.
SIGIR
Monika Henzinger
2005 — conf
Hyperlink analysis on the world wide web.
Hypertext
Monika Henzinger
2005 J jnl
Query-Free News Search.
World Wide Web
Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin
2004 A conf
Algorithmic Aspects of Web Search Engines.
ESA
Monika Henzinger
2004 — ch.
Data Structures in Web Information Retrieval.
Handbook of Data Structures and Applications
Monika Henzinger
2004 A* conf
The Past, Present and Future of Web Information Retrieval.
PODS
Monika Henzinger
2004 A* conf
The Past, Present, and Future of Web Search Engines p.
ICALP
Monika Henzinger
2004 — conf
The past, present, and future of web information retrieval.
DRR
Monika Henzinger
2003 A* conf
Query-free news search.
WWW
Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin
2003 — conf
The Past, Present and Future of Web Information Retrieval.
INFOS
Monika Henzinger
2002 C conf
Indexing the Web - A Challenge for Supercomputers.
CLUSTER
Monika Henzinger
2001 A* conf
Who Links to Whom: Mining Linkage between Web Sites.
ICDM
Krishna Bharat, Bay-Wei Chang, Monika Henzinger, Matthias Ruhl
2000 A conf
Web Information Retrieval - an Algorithmic Perspective.
ESA
Monika Henzinger
1999 J jnl
Analysis of a Very Large Web Search Engine Query Log.
SIGIR Forum
Craig Silverstein, Monika Henzinger, Hannes Marais, Michael Moricz
1998 J jnl
The Connectivity Server: Fast Access to Linkage Information on the Web.
Comput. Networks
Krishna Bharat, Andrei Z. Broder, Monika Henzinger, Puneet Kumar, Suresh Venkatasubramanian
1996 J jnl
On the Number of Small Cuts in a Graph.
Inf. Process. Lett.
Monika Henzinger, David P. Williamson