Monika Henzinger

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 216

Top Venues

Publications

Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. CoRR (2024)
Monika Henzinger, Barna Saha, Martin P. Seybold, Christopher Ye
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. ITCS (2024)
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Expander Hierarchies for Normalized Cuts on Graphs. KDD (2024)
Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
Dynamically Maintaining the Persistent Homology of Time Series. SODA (2024)
Monika Henzinger, A. R. Sricharan, Leqi Zhu
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph. CoRR (2024)
Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch
Expander Hierarchies for Normalized Cuts on Graphs. CoRR (2024)
Monika Henzinger, Jason Li, Satish Rao, Di Wang
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA (2024)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
A Unifying Framework for Differentially Private Sums under Continual Observation. SODA (2024)
Monika Henzinger, Jason Li, Satish Rao, Di Wang
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR (2024)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. ITCS (2024)
Max Dupré la Tour, Monika Henzinger, David Saulpic
Fully Dynamic k-Means Coreset in Near-Optimal Update Time. CoRR (2024)
Monika Henzinger, David Saulpic, Leonhard Sidl
-Means via Coresets. ALENEX (2024)
Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay
Continual Counting with Gradual Privacy Expiration. CoRR (2024)
Max Dupré la Tour, Monika Henzinger, David Saulpic
Making Old Things New: A Unified Algorithm for Differentially Private Clustering. CoRR (2024)
Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. CoRR (2023)
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. CoRR (2023)
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation. CoRR (2023)
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. Algorithmica 85 (12) (2023)
Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner
Differentially Private Data Structures under Continual Observation for Histograms and Related Queries. CoRR (2023)
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries. CoRR (2023)
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. INFOCOM (2023)
Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost
Dynamically Maintaining the Persistent Homology of Time Series. CoRR (2023)
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks. ITCS (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA (2023)
Max Dupré la Tour, Monika Henzinger, David Saulpic
Differential Privacy for Clustering Under Continual Observation. CoRR (2023)
Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng
Faster Submodular Maximization for Several Classes of Matroids. CoRR (2023)
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
Online Min-Max Paging. SODA (2023)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Almost Tight Error Bounds on Differentially Private Continual Counting. SODA (2023)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM J. Comput. 52 (5) (2023)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
A Unifying Framework for Differentially Private Sums under Continual Observation. CoRR (2023)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Dynamic Maintenance of Monotone Dynamic Programs and Applications. CoRR (2023)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Dynamic Maintenance of Monotone Dynamic Programs and Applications. STACS (2023)
Gramoz Goranci, Monika Henzinger
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. ICALP (2023)
Monika Henzinger, David Saulpic, Leonhard Sidl
Experimental Evaluation of Fully Dynamic k-Means via Coresets. CoRR (2023)
Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten
Simple, Scalable and Effective Clustering via One-Dimensional Projections. NeurIPS (2023)
Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng
Faster Submodular Maximization for Several Classes of Matroids. ICALP (2023)
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
-Center Clustering for Adaptive and Oblivious Adversaries. SODA (2023)
Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. CoRR (2023)
Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR (2023)
Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten
Simple, Scalable and Effective Clustering via One-Dimensional Projections. CoRR (2023)
Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. CoRR (2023)
Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay
Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. ICML (2023)
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. CoRR (2023)
Da Wei Zheng, Monika Henzinger
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. IPCO (2023)
Da Wei Zheng, Monika Henzinger
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. CoRR (2023)
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. ITCS (2023)
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. INFOCOM (2022)
Monika Henzinger, Jalaj Upadhyay
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. IACR Cryptol. ePrint Arch. 2022 (2022)
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. CoRR (2022)
Monika Henzinger, Pan Peng
Constant-time Dynamic (Δ +1)-Coloring. ACM Trans. Algorithms 18 (2) (2022)
Monika Henzinger, Andrea Lincoln, Barna Saha
The Complexity of Average-Case Dynamic Subgraph Counting. SODA (2022)
Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
Leximax Approximations and Representative Cohort Selection. CoRR (2022)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). SAND (2022)
Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
The Augmentation-Speed Tradeoff for Consistent Network Updates. CoRR (2022)
Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
Leximax Approximations and Representative Cohort Selection. FORC (2022)
Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay
Almost Tight Error Bounds on Differentially Private Continual Counting. CoRR (2022)
Monika Henzinger
Modern Dynamic Data Structures (Invited Talk). MFCS (2022)
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. CoRR (2022)
Monika Henzinger, Alexander Noe, Christian Schulz
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX (2022)
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
Online Min-Max Paging. CoRR (2022)
Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid
The augmentation-speed tradeoff for consistent network updates. SOSR (2022)
Monika Henzinger, Ami Paz, A. R. Sricharan
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. ESA (2022)
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Fully Dynamic Four-Vertex Subgraph Counting. SAND (2022)
Monika Henzinger
Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification. Principles of Systems Design (2022)
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks. CoRR (2022)
Monika Henzinger, Jalaj Upadhyay
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. CoRR (2022)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27 (2022)
Gramoz Goranci, Monika Henzinger
update time. CoRR (2022)
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. PODC (2022)
Monika Henzinger, Ami Paz, A. R. Sricharan
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. CoRR (2022)
Aaron Bernstein, Sebastian Forster, Monika Henzinger
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Trans. Algorithms 17 (4) (2021)
Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. CoRR (2021)
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
Symbolic Time and Space Tradeoffs for Probabilistic Verification. CoRR (2021)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50 (3) (2021)
Sebastian Forster, Gramoz Goranci, Monika Henzinger
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. SODA (2021)
Monika Henzinger, Alexander Noe
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice? CoRR (2021)
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. SODA (2021)
Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP (2021)
Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid
Tight Bounds for Online Graph Partitioning. SODA (2021)
Monika Henzinger, Ami Paz, Stefan Schmid
On the Complexity of Weight-Dynamic Network Algorithms. CoRR (2021)
Hendrik Fichtenberger, Monika Henzinger, Wolfgang Ost
Differentially Private Algorithms for Graphs Under Continual Observation. ESA (2021)
Hendrik Fichtenberger, Monika Henzinger, Wolfgang Ost
Differentially Private Algorithms for Graphs Under Continual Observation. CoRR (2021)
Monika Henzinger, Andrea Lincoln, Barna Saha
The Complexity of Average-Case Dynamic Subgraph Counting. Electron. Colloquium Comput. Complex. 28 (2021)
Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese
On fully dynamic constant-factor approximation algorithms for clustering problems. CoRR (2021)
Monika Henzinger, Pan Peng
Constant-time dynamic weight approximation for minimum spanning forest. Inf. Comput. 281 (2021)
Monika Henzinger, Ami Paz, Stefan Schmid
On the Complexity of Weight-Dynamic Network Algorithms. Networking (2021)
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
Algorithms and conditional lower bounds for planning problems. Artif. Intell. 297 (2021)
Monika Henzinger, Alexander Noe, Christian Schulz
Practical Fully Dynamic Minimum Cut Algorithms. CoRR (2021)
Kathrin Hanauer, Monika Henzinger, Christian Schulz
Recent Advances in Fully Dynamic Graph Algorithms. CoRR (2021)
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil
-Center Clustering in Low Dimensional Metrics. ALENEX (2021)
Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua
Fully Dynamic Four-Vertex Subgraph Counting. CoRR (2021)
Monika Henzinger, Alexander Noe, Christian Schulz
Faster Parallel Multiterminal Cuts. ACDA (2021)
Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA (2021)
Monika Henzinger, Xiaowei Wu
Upper and Lower Bounds for Fully Retroactive Graph Problems. WADS (2021)
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil
Symbolic Time and Space Tradeoffs for Probabilistic Verification. LICS (2021)
Monika Henzinger, Alexander Noe, Christian Schulz
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX (2020)
Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash
Finding All Global Minimum Cuts in Practice. ESA (2020)
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR (2020)
Monika Henzinger, Sagar Kale
Fully-Dynamic Coresets. ESA (2020)
Monika Henzinger, Satish Rao, Di Wang
Local Flow Partitioning for Faster Edge Connectivity. SIAM J. Comput. 49 (1) (2020)

Monika Henzinger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Monika Henzinger