default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMonika Henzinger
Monika Rauch Henzinger – Monika Rauch
Person information
- affiliation: University of Vienna, Faculty of Computer Science, Austria
- affiliation (former): EPFL, Lausanne, Switzerland
- affiliation (former): Google Inc, Mountain View, CA, USA
- affiliation (former): DEC Systems Research Center, Palo Alto, CA, USA
- affiliation (former): Cornell University, Department of Computer Science, Ithaca, NY, USA
- affiliation (former, PhD 1993): Princeton University, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c171]Monika Henzinger, David Saulpic, Leonhard Sidl:
Experimental Evaluation of Fully Dynamic k-Means via Coresets. ALENEX 2024: 220-233- [c170]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Private Counting of Distinct Elements in the Turnstile Model and Extensions. APPROX/RANDOM 2024: 40:1-40:21 - [c169]Max Dupré la Tour, Monika Henzinger, David Saulpic:
Fully Dynamic k-Means Coreset in Near-Optimal Update Time. ESA 2024: 100:1-100:16 - [c168]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. ICML 2024 - [c167]Max Dupré la Tour, Monika Henzinger, David Saulpic:
Making Old Things New: A Unified Algorithm for Differentially Private Clustering. ICML 2024 - [c166]Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan:
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. ITCS 2024: 55:1-55:22 - [c165]Monika Henzinger, Barna Saha, Martin P. Seybold
, Christopher Ye:
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. ITCS 2024: 62:1-62:25 - [c164]Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch:
Expander Hierarchies for Normalized Cuts on Graphs. KDD 2024: 1016-1027 - [c163]Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost:
Dynamically Maintaining the Persistent Homology of Time Series. SODA 2024: 243-295 - [c162]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
A Unifying Framework for Differentially Private Sums under Continual Observation. SODA 2024: 995-1018 - [c161]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. SODA 2024: 3089-3139 - [i125]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR abs/2401.05627 (2024) - [i124]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 abs/2402.17327 (2024) - [i123]Monika Henzinger, A. R. Sricharan, Leqi Zhu:
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph. CoRR abs/2402.18020 (2024) - [i122]Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay:
Continual Counting with Gradual Privacy Expiration. CoRR abs/2406.03802 (2024) - [i121]Max Dupré la Tour, Monika Henzinger, David Saulpic:
Making Old Things New: A Unified Algorithm for Differentially Private Clustering. CoRR abs/2406.11649 (2024) - [i120]Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, Maximilian Vötsch:
Expander Hierarchies for Normalized Cuts on Graphs. CoRR abs/2406.14111 (2024) - [i119]Max Dupré la Tour, Monika Henzinger, David Saulpic:
Fully Dynamic k-Means Coreset in Near-Optimal Update Time. CoRR abs/2406.19926 (2024) - [i118]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Private Counting of Distinct Elements in the Turnstile Model and Extensions. CoRR abs/2408.11637 (2024) - 2023
- [j77]Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson:
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. Algorithmica 85(12): 3680-3716 (2023) - [j76]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM J. Comput. 52(5): 1132-1192 (2023) - [c160]Gramoz Goranci, Monika Henzinger:
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow. ICALP 2023: 69:1-69:14 - [c159]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. ICALP 2023: 74:1-74:18 - [c158]Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay:
Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. ICML 2023: 10072-10092 - [c157]Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid:
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. INFOCOM 2023: 1-10 - [c156]Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks. ITCS 2023: 47:1-47:21 - [c155]Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson:
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. ITCS 2023: 69:1-69:22 - [c154]Da Wei Zheng, Monika Henzinger:
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. IPCO 2023: 453-465 - [c153]Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten:
Simple, Scalable and Effective Clustering via One-Dimensional Projections. NeurIPS 2023 - [c152]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - [c151]Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch:
Online Min-Max Paging. SODA 2023: 1545-1565 - [c150]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. SODA 2023: 2677-2727 - [c149]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
Almost Tight Error Bounds on Differentially Private Continual Counting. SODA 2023: 5003-5039 - [c148]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. STACS 2023: 36:1-36:16 - [i117]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Dynamic Maintenance of Monotone Dynamic Programs and Applications. CoRR abs/2301.01744 (2023) - [i116]Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid:
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters. CoRR abs/2301.05751 (2023) - [i115]Da Wei Zheng, Monika Henzinger:
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. CoRR abs/2301.09217 (2023) - [i114]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen:
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - [i113]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Differentially Private Data Structures under Continual Observation for Histograms and Related Queries. CoRR abs/2302.11341 (2023) - [i112]Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries. CoRR abs/2302.11988 (2023) - [i111]Gramoz Goranci, Monika Henzinger, Harald Räcke, Sushant Sachdeva, A. R. Sricharan:
Electrical Flows for Polylogarithmic Competitive Oblivious Routing. CoRR abs/2303.02491 (2023) - [i110]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 abs/2303.11843 (2023) - [i109]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. CoRR abs/2305.00122 (2023) - [i108]Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner:
Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation. CoRR abs/2306.10428 (2023) - [i107]Max Dupré la Tour, Monika Henzinger, David Saulpic:
Differential Privacy for Clustering Under Continual Observation. CoRR abs/2307.03430 (2023) - [i106]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
A Unifying Framework for Differentially Private Sums under Continual Observation. CoRR abs/2307.08970 (2023) - [i105]Monika Henzinger, Andrea Lincoln, Barna Saha, Martin P. Seybold, Christopher Ye:
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems. CoRR abs/2307.16771 (2023) - [i104]Antoine El-Hayek, Kathrin Hanauer, Monika Henzinger:
On b-Matching and Fully-Dynamic Maximum k-Edge Coloring. CoRR abs/2310.01149 (2023) - [i103]Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten:
Simple, Scalable and Effective Clustering via One-Dimensional Projections. CoRR abs/2310.16752 (2023) - [i102]Monika Henzinger, David Saulpic, Leonhard Sidl:
Experimental Evaluation of Fully Dynamic k-Means via Coresets. CoRR abs/2310.18034 (2023) - [i101]Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Monika Henzinger, Lara Ost:
Dynamically Maintaining the Persistent Homology of Time Series. CoRR abs/2311.01115 (2023) - 2022
- [j75]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27: 1.11:1-1.11:45 (2022) - [j74]Monika Henzinger, Pan Peng:
Constant-time Dynamic (Δ +1)-Coloring. ACM Trans. Algorithms 18(2): 16:1-16:21 (2022) - [c147]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX 2022: 13-26 - [c146]Monika Henzinger:
Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification. Principles of Systems Design 2022: 292-305 - [c145]Monika Henzinger, Ami Paz, A. R. Sricharan:
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. ESA 2022: 65:1-65:14 - [c144]Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Leximax Approximations and Representative Cohort Selection. FORC 2022: 2:1-2:22 - [c143]Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer:
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. INFOCOM 2022: 1649-1658 - [c142]Monika Henzinger:
Modern Dynamic Data Structures (Invited Talk). MFCS 2022: 2:1-2:2 - [c141]Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. PODC 2022: 54-56 - [c140]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). SAND 2022: 1:1-1:47 - [c139]Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua:
Fully Dynamic Four-Vertex Subgraph Counting. SAND 2022: 18:1-18:17 - [c138]Monika Henzinger, Andrea Lincoln, Barna Saha:
The Complexity of Average-Case Dynamic Subgraph Counting. SODA 2022: 459-498 - [c137]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid:
The augmentation-speed tradeoff for consistent network updates. SOSR 2022: 67-80 - [d1]Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer:
DJ-Match/DJ-Match: Version 1.0.0. Zenodo, 2022
- [i100]Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer:
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies. CoRR abs/2201.06621 (2022) - [i99]Monika Henzinger, Jalaj Upadhyay:
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. CoRR abs/2202.11205 (2022) - [i98]Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Leximax Approximations and Representative Cohort Selection. CoRR abs/2205.01157 (2022) - [i97]Monika Henzinger, Ami Paz, A. R. Sricharan:
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. CoRR abs/2208.07572 (2022) - [i96]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid:
The Augmentation-Speed Tradeoff for Consistent Network Updates. CoRR abs/2211.03716 (2022) - [i95]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
Almost Tight Error Bounds on Differentially Private Continual Counting. CoRR abs/2211.05006 (2022) - [i94]Gramoz Goranci, Monika Henzinger:
Incremental Approximate Maximum Flow in m1/2+o(1) update time. CoRR abs/2211.09606 (2022) - [i93]Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks. CoRR abs/2211.10151 (2022) - [i92]Antoine El-Hayek, Monika Henzinger, Stefan Schmid:
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear. CoRR abs/2211.11352 (2022) - [i91]Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch:
Online Min-Max Paging. CoRR abs/2212.03016 (2022) - [i90]Monika Henzinger, Jalaj Upadhyay:
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. IACR Cryptol. ePrint Arch. 2022: 225 (2022) - 2021
- [j73]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and conditional lower bounds for planning problems. Artif. Intell. 297: 103499 (2021) - [j72]Monika Henzinger, Pan Peng:
Constant-time dynamic weight approximation for minimum spanning forest. Inf. Comput. 281: 104805 (2021) - [j71]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50(3) (2021) - [j70]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. ACM Trans. Algorithms 17(4): 29:1-29:51 (2021) - [c136]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. ACDA 2021: 100-110 - [c135]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil:
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - [c134]Hendrik Fichtenberger, Monika Henzinger, Lara Ost:
Differentially Private Algorithms for Graphs Under Continual Observation. ESA 2021: 42:1-42:16 - [c133]Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil:
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP 2021: 124:1-124:21 - [c132]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. LICS 2021: 1-13 - [c131]Monika Henzinger, Ami Paz, Stefan Schmid:
On the Complexity of Weight-Dynamic Network Algorithms. Networking 2021: 1-9 - [c130]Sebastian Forster, Gramoz Goranci, Monika Henzinger:
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. SODA 2021: 1226-1245 - [c129]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: 1836-1855 - [c128]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549 - [c127]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. SODA 2021: 2799-2818 - [c126]Monika Henzinger, Xiaowei Wu:
Upper and Lower Bounds for Fully Retroactive Graph Problems. WADS 2021: 471-484 - [i89]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. CoRR abs/2101.05033 (2021) - [i88]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms. CoRR abs/2102.11169 (2021) - [i87]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. CoRR abs/2104.07466 (2021) - [i86]Monika Henzinger, Ami Paz, Stefan Schmid:
On the Complexity of Weight-Dynamic Network Algorithms. CoRR abs/2105.13172 (2021) - [i85]Hendrik Fichtenberger, Monika Henzinger, Lara Ost:
Differentially Private Algorithms for Graphs Under Continual Observation. CoRR abs/2106.14756 (2021) - [i84]Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua:
Fully Dynamic Four-Vertex Subgraph Counting. CoRR abs/2106.15524 (2021) - [i83]Monika Henzinger, Alexander Noe:
Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice? CoRR abs/2108.04564 (2021) - [i82]Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson:
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. CoRR abs/2109.00653 (2021) - [i81]Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese:
On fully dynamic constant-factor approximation algorithms for clustering problems. CoRR abs/2112.07217 (2021) - [i80]Monika Henzinger, Andrea Lincoln, Barna Saha:
The Complexity of Average-Case Dynamic Subgraph Counting. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j69]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Dynamic Matching in O(1) Update Time. Algorithmica 82(4): 1057-1080 (2020) - [j68]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. Algorithmica 82(11): 3183-3194 (2020) - [j67]Monika Henzinger, Satish Rao, Di Wang:
Local Flow Partitioning for Faster Edge Connectivity. SIAM J. Comput. 49(1): 1-36 (2020) - [j66]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. SIAM J. Discret. Math. 34(1): 130-162 (2020) - [c125]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - [c124]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX 2020: 106-119 - [c123]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. SoCG 2020: 51:1-51:14 - [c122]Monika Henzinger, Sagar Kale:
Fully-Dynamic Coresets. ESA 2020: 57:1-57:21 - [c121]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. ESA 2020: 58:1-58:20 - [c120]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts in Practice. ESA 2020: 59:1-59:20 - [c119]Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak:
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. FOCS 2020: 1135-1146 - [c118]Monika Henzinger, Pan Peng:
Constant-Time Dynamic (Δ+1)-Coloring. STACS 2020: 53:1-53:18 - [c117]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. SEA 2020: 14:1-14:14 - [p1]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Vienna Graph Clustering. Protein-Protein Interaction Networks 2020: 215-231 - [i79]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. CoRR abs/2002.00813 (2020) - [i78]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - [i77]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs/2002.10142 (2020) - [i76]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020) - [i75]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. CoRR abs/2003.02605 (2020) - [i74]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. CoRR abs/2004.09099 (2020) - [i73]Sebastian Forster, Gramoz Goranci, Monika Henzinger:
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. CoRR abs/2004.10319 (2020) - [i72]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. CoRR abs/2004.11666 (2020) - [i71]