Stop the war!Остановите войну!
for scientists:
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
[c165]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- [c164]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 - [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 - [i120]Monika Henzinger, Jason Li, Satish Rao, Di Wang:
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs. CoRR abs/2401.05627 (2024) - [i119]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) - [i118]Monika Henzinger, A. R. Sricharan, Leqi Zhu:
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph. CoRR abs/2402.18020 (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, Wolfgang 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]Monika Henzinger, Sagar Kale:
Fully-Dynamic Coresets. CoRR abs/2004.14891 (2020) - [i70]Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak:
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. CoRR abs/2005.02368 (2020) - [i69]Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR abs/2010.10134 (2020) - [i68]Monika Henzinger, Billy Jin, David P. Williamson:
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. CoRR abs/2010.16316 (2020) - [i67]Monika Henzinger, Pan Peng:
Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest. CoRR abs/2011.00977 (2020) - [i66]Monika Henzinger, Stefan Neumann, Harald Räcke, Stefan Schmid:
Tight Bounds for Online Graph Partitioning. CoRR abs/2011.01017 (2020)
2010 – 2019
- 2019
- [j65]Monika Henzinger, Stefan Neumann, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. Proc. ACM Meas. Anal. Comput. Syst. 3(1): 13:1-13:38 (2019) - [j64]Sayan Bhattacharya, Monika Henzinger, Stefan Neumann:
New amortized cell-probe lower bounds for dynamic problems. Theor. Comput. Sci. 779: 72-87 (2019) - [c116]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CONCUR 2019: 7:1-7:16 - [c115]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423 - [c114]Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP 2019: 13:1-13:14 - [c113]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Exact Minimum Cuts. IPDPS 2019: 13-22 - [c112]Monika Henzinger, Stefan Neumann, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. SIGMETRICS (Abstracts) 2019: 43-44 - [c111]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. SODA 2019: 1899-1918 - [c110]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed edge connectivity in sublinear time. STOC 2019: 343-354 - [i65]Sayan Bhattacharya, Monika Henzinger, Stefan Neumann:
New Amortized Cell-Probe Lower Bounds for Dynamic Problems. CoRR abs/1902.02304 (2019) - [i64]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed Edge Connectivity in Sublinear Time. CoRR abs/1904.04341 (2019) - [i63]Monika Henzinger, Stefan Neumann, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. CoRR abs/1904.05474 (2019) - [i62]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. CoRR abs/1905.01216 (2019) - [i61]Monika Henzinger, Pan Peng:
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing. CoRR abs/1907.04745 (2019) - [i60]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Alexander Svozil:
Fully Dynamic k-Center Clustering in Doubling Metrics. CoRR abs/1908.03948 (2019) - [i59]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. CoRR abs/1908.04141 (2019) - [i58]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. CoRR abs/1909.04983 (2019) - [i57]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CoRR abs/1909.05539 (2019) - [i56]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. CoRR abs/1909.06653 (2019) - [i55]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. CoRR abs/1909.11600 (2019) - [i54]Monika Henzinger, Xiaowei Wu:
Upper and Lower Bounds for Fully Retroactive Graph Problems. CoRR abs/1910.03332 (2019) - 2018
- [j63]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Dynamic algorithms via the primal-dual method. Inf. Comput. 261: 219-239 (2018) - [j62]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. J. ACM 65(6): 36:1-36:40 (2018) - [j61]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018) - [j60]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SIAM J. Comput. 47(3): 859-887 (2018) - [j59]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. ACM Trans. Algorithms 14(2): 17:1-17:21 (2018) - [j58]Paul Dütting, Monika Henzinger, Martin Starnberger:
Valuation Compressions in VCG-Based Combinatorial Auctions. ACM Trans. Economics and Comput. 6(2): 5:1-5:18 (2018) - [c109]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. ICAPS 2018: 56-64 - [c108]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. ALENEX 2018: 48-61 - [c107]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman:
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CAV (2) 2018: 178-197 - [c106]Gramoz Goranci, Monika Henzinger, Dariusz Leniowski:
A Tree Structure For Dynamic Facility Location. ESA 2018: 39:1-39:13 - [c105]Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. ESA 2018: 40:1-40:15 - [c104]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. LPAR 2018: 233-253 - [c103]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. SODA 2018: 1-20 - [c102]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. SODA 2018: 2341-2356 - [c101]Monika Henzinger:
The State of the Art in Dynamic Graph Algorithms. SOFSEM 2018: 40-44 - [c100]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Memetic Graph Clustering. SEA 2018: 3:1-3:15 - [e3]Ilias Diakonikolas, David Kempe, Monika Henzinger:
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. ACM 2018 [contents] - [i53]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Memetic Graph Clustering. CoRR abs/1802.07034 (2018) - [i52]Gramoz Goranci, Monika Henzinger, Pan Peng:
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. CoRR abs/1802.09111 (2018) - [i51]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman:
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CoRR abs/1804.00206 (2018) - [i50]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. CoRR abs/1804.07031 (2018) - [i49]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-memory Exact Minimum Cuts. CoRR abs/1808.05458 (2018) - [i48]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. CoRR abs/1810.10932 (2018) - [i47]Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR abs/1811.12527 (2018) - 2017
- [j57]Wolfgang Dvorák, Monika Henzinger, David P. Williamson:
Maximizing a Submodular Function with Viability Constraints. Algorithmica 77(1): 152-172 (2017) - [j56]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for Parity and Streett objectives. Log. Methods Comput. Sci. 13(3) (2017) - [j55]Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger:
Welfare Maximization with Friends-of-Friends Network Externalities. Theory Comput. Syst. 61(4): 948-986 (2017) - [j54]Krishna Bharat, Monika Henzinger:
Improved Algorithms for Topic Distillation in a Hyperlinked Environment. SIGIR Forum 51(2): 194-201 (2017) - [j53]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. ACM Trans. Algorithms 13(4): 51:1-51:24 (2017) - [c99]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Improved Set-Based Symbolic Algorithms for Parity Games. CSL 2017: 18:1-18:21 - [c98]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. ESA 2017: 44:1-44:14 - [c97]Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. ESA 2017: 45:1-45:14 - [c96]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic Clustering to Minimize the Sum of Radii. ESA 2017: 48:1-48:10 - [c95]Monika Henzinger:
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk). ICALP 2017: 2:1-2:1 - [c94]Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao:
Capacity Releasing Diffusion for Speed and Locality. ICML 2017: 3598-3607 - [c93]Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams:
Conditional Hardness for Sensitivity Problems. ITCS 2017: 26:1-26:31 - [c92]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. IPCO 2017: 86-98 - [c91]Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil:
Faster Algorithms for Mean-Payoff Parity Games. MFCS 2017: 39:1-39:14 - [c90]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. SODA 2017: 470-489 - [c89]Monika Henzinger, Satish Rao, Di Wang:
Local Flow Partitioning for Faster Edge Connectivity. SODA 2017: 1919-1938 - [i46]Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. CoRR abs/1702.01136 (2017) - [i45]Monika Henzinger, Andrea Lincoln, Stefan Neumann, Virginia Vassilevska Williams:
Conditional Hardness for Sensitivity Problems. CoRR abs/1703.01638 (2017) - [i44]Monika Henzinger, Satish Rao, Di Wang:
Local Flow Partitioning for Faster Edge Connectivity. CoRR abs/1704.01254 (2017) - [i43]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3n) Worst Case Update Time. CoRR abs/1704.02844 (2017) - [i42]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Improved Set-based Symbolic Algorithms for Parity Games. CoRR abs/1706.04889 (2017) - [i41]Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W. Mahoney, Satish Rao:
Capacity Releasing Diffusion for Speed and Locality. CoRR abs/1706.05826 (2017) - [i40]Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil:
Faster Algorithms for Mean-Payoff Parity Games. CoRR abs/1706.06139 (2017) - [i39]Monika Henzinger, Dariusz Leniowski, Claire Mathieu:
Dynamic clustering to minimize the sum of radii. CoRR abs/1707.02577 (2017) - [i38]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. CoRR abs/1708.06127 (2017) - [i37]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. CoRR abs/1711.04355 (2017) - [i36]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. CoRR abs/1711.09148 (2017) - [i35]Gramoz Goranci, Monika Henzinger, Pan Peng:
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms. CoRR abs/1712.06473 (2017) - 2016
- [j52]Luca Aceto, Mariangiola Dezani-Ciancaglini, Yuri Gurevich, David Harel, Monika Henzinger, Giuseppe F. Italiano, Scott A. Smolka, Paul G. Spirakis, Wolfgang Thomas:
EATCS Fellows' Advice to the Young Theoretical Computer Scientist. Bull. EATCS 119 (2016) - [j51]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM J. Comput. 45(3): 947-1006 (2016) - [c88]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. ESA 2016: 46:1-46:17 - [c87]Monika Henzinger, Stefan Neumann:
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. ESA 2016: 48:1-48:11 - [c86]Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger:
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. ICALP 2016: 131:1-131:14 - [c85]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. LICS 2016: 197-206 - [c84]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Conditionally Optimal Algorithms for Generalized Büchi Games. MFCS 2016: 25:1-25:15 - [c83]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New deterministic approximation algorithms for fully dynamic matching. STOC 2016: 398-411 - [c82]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. STOC 2016: 489-498 - [r4]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. Encyclopedia of Algorithms 2016: 600-602 - [r3]Monika Henzinger:
PageRank Algorithm. Encyclopedia of Algorithms 2016: 1509-1511 - [i34]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. CoRR abs/1602.02670 (2016) - [i33]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. CoRR abs/1604.05337 (2016) - [i32]Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer:
Ad Exchange: Envy-Free Auctions with Mediators. CoRR abs/1604.05562 (2016) - [i31]Wolfgang Dvorák, Monika Henzinger:
Online Ad Assignment with an Ad Exchange. CoRR abs/1604.05603 (2016) - [i30]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New Deterministic Approximation Algorithms for Fully Dynamic Matching. CoRR abs/1604.05765 (2016) - [i29]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016) - [i28]Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger:
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. CoRR abs/1604.08342 (2016) - [i27]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Conditionally Optimal Algorithms for Generalized Büchi Games. CoRR abs/1607.05850 (2016) - [i26]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time. CoRR abs/1611.00198 (2016) - [i25]Monika Henzinger, Stefan Neumann:
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning. CoRR abs/1611.05248 (2016) - [i24]Wolfgang Dvorák, Monika Henzinger, David P. Williamson:
Maximizing a Submodular Function with Viability Constraints. CoRR abs/1611.05753 (2016) - [i23]Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. CoRR abs/1611.06500 (2016) - [i22]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. CoRR abs/1612.03856 (2016) - 2015
- [j50]Monika Henzinger, Veronika Loitzenbauer:
Truthful unit-demand auctions with budgets revisited. Theor. Comput. Sci. 573: 1-15 (2015) - [j49]Paul Dütting, Monika Henzinger, Ingmar Weber:
An Expressive Mechanism for Auctions on the Web. ACM Trans. Economics and Comput. 4(1): 1:1-1:34 (2015) - [j48]Riccardo Colini-Baldeschi, Stefano Leonardi, Monika Henzinger, Martin Starnberger:
On Multiple Keyword Sponsored Search Auctions with Budgets. ACM Trans. Economics and Comput. 4(1): 2:1-2:34 (2015) - [j47]Paul Dütting, Monika Henzinger, Martin Starnberger:
Auctions for Heterogeneous Items and Budget Limits. ACM Trans. Economics and Comput. 4(1): 4:1-4:17 (2015) - [c81]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) 2015: 206-218 - [c80]Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. ICALP (1) 2015: 713-724 - [c79]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) 2015: 725-736 - [c78]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for One-Pair and k-Pair Streett Objectives. LICS 2015: 269-280 - [c77]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA 2015: 785-804 - [c76]Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger:
Welfare Maximization with Friends-of-Friends Network Externalities. STACS 2015: 90-102 - [c75]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC 2015: 21-30 - [c74]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC 2015: 173-182 - [c73]Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer:
Ad Exchange: Envy-Free Auctions with Mediators. WINE 2015: 104-117 - [c72]Yun Kuen Cheung, Monika Henzinger, Martin Hoefer, Martin Starnberger:
Combinatorial Auctions with Conflict-Based Externalities. WINE 2015: 230-243 - [i21]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR abs/1504.02268 (2015) - [i20]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. CoRR abs/1504.07056 (2015) - [i19]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. CoRR abs/1504.07959 (2015) - [i18]Yun Kuen Cheung, Monika Henzinger, Martin Hoefer, Martin Starnberger:
Combinatorial Auctions with Conflict-Based Externalities. CoRR abs/1509.09147 (2015) - [i17]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. CoRR abs/1511.06773 (2015) - [i16]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. CoRR abs/1512.08147 (2015) - [i15]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. CoRR abs/1512.08148 (2015) - 2014
- [j46]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - [j45]Krishnendu Chatterjee, Monika Henzinger:
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition. J. ACM 61(3): 15:1-15:40 (2014) - [j44]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin:
Approximating the minimum cycle mean. Theor. Comput. Sci. 547: 104-116 (2014) - [c71]Moses Charikar, Monika Henzinger, Huy L. Nguyen:
Online Bipartite Matching with Decomposable Weights. ESA 2014: 260-271 - [c70]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. FOCS 2014: 146-155 - [c69]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. SODA 2014: 1053-1072 - [c68]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. STOC 2014: 674-683 - [c67]Wolfgang Dvorák, Monika Henzinger:
Online Ad Assignment with an Ad Exchange. WAOA 2014: 156-167 - [c66]Ludek Cigler, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger:
Limiting Price Discrimination when Selling Products with Positive Network Externalities. WINE 2014: 44-57 - [i14]Moses Charikar, Monika Henzinger, Huy L. Nguyen:
Online Bipartite Matching with Decomposable Weights. CoRR abs/1409.2139 (2014) - [i13]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for One-Pair and k-Pair Streett Objectives. CoRR abs/1410.0833 (2014) - [i12]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. CoRR abs/1412.1318 (2014) - [i11]Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Finding 2-edge and 2-vertex strongly connected components in quadratic time. CoRR abs/1412.6466 (2014) - 2013
- [j43]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods Syst. Des. 42(3): 301-327 (2013) - [j42]Luca Aceto, Monika Henzinger, Jirí Sgall:
38th International Colloquium on Automata, Languages and Programming. Inf. Comput. 222: 1 (2013) - [j41]Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored search, market equilibria, and the Hungarian Method. Inf. Process. Lett. 113(3): 67-73 (2013) - [j40]Paul Dütting, Monika Henzinger, Ingmar Weber:
Bidder optimal assignments for general utilities. Theor. Comput. Sci. 478: 22-32 (2013) - [j39]Eda Baykan, Monika Henzinger, Ingmar Weber:
A Comprehensive Study of Techniques for URL-Based Web Page Language Classification. ACM Trans. Web 7(1): 3:1-3:37 (2013) - [c65]Wolfgang Dvorák, Monika Henzinger, David P. Williamson:
Maximizing a Submodular Function with Viability Constraints. ESA 2013: 409-420 - [c64]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. FOCS 2013: 538-547 - [c63]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. ICALP (2) 2013: 607-619 - [c62]Paul Dütting, Monika Henzinger, Martin Starnberger:
Valuation Compressions in VCG-Based Combinatorial Auctions. WINE 2013: 146-159 - [c61]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Approximating the minimum cycle mean. GandALF 2013: 136-149 - [i10]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. CoRR abs/1308.0776 (2013) - [i9]Paul Duetting, Monika Henzinger, Martin Starnberger:
Valuation Compressions in VCG-Based Combinatorial Auctions. CoRR abs/1310.3153 (2013) - 2012
- [j38]Monika Henzinger:
The Presburger Award 2013: Call for Nominations. Bull. EATCS 108: 22-23 (2012) - [c60]Paul Dütting, Monika Henzinger, Ingmar Weber:
Maximizing revenue from strategic recommendations under decaying trust. CIKM 2012: 2283-2286 - [c59]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312 - [c58]Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger:
On Multiple Keyword Sponsored Search Auctions with Budgets. ICALP (2) 2012: 1-12 - [c57]Krishnendu Chatterjee, Monika Henzinger:
An O(n2) time algorithm for alternating Büchi games. SODA 2012: 1386-1399 - [c56]Paul Dütting, Monika Henzinger, Martin Starnberger:
Auctions with Heterogeneous Items and Budget Limits. WINE 2012: 44-57 - [i8]Paul Dütting, Monika Henzinger, Martin Starnberger:
Auctions with Heterogeneous Items and Budget Limits. CoRR abs/1209.6448 (2012) - 2011
- [j37]Paul Dütting, Monika Henzinger, Ingmar Weber:
Offline file assignments for online load balancing. Inf. Process. Lett. 111(4): 178-183 (2011) - [j36]Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber:
A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification. ACM Trans. Web 5(3): 15:1-15:29 (2011) - [c55]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CAV 2011: 260-276 - [c54]Monika Henzinger, Angelina Vidali:
Multi-parameter Mechanism Design under Budget and Matroid Constraints. ESA 2011: 192-202 - [c53]Krishnendu Chatterjee, Monika Henzinger:
Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SODA 2011: 1318-1336 - [c52]Paul Dütting, Monika Henzinger, Ingmar Weber:
An expressive mechanism for auctions on the web. WWW 2011: 127-136 - [e2]Luca Aceto, Monika Henzinger, Jirí Sgall:
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I. Lecture Notes in Computer Science 6755, Springer 2011, ISBN 978-3-642-22005-0 [contents] - [e1]Luca Aceto, Monika Henzinger, Jirí Sgall:
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II. Lecture Notes in Computer Science 6756, Springer 2011, ISBN 978-3-642-22011-1 [contents] - [i7]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CoRR abs/1104.3348 (2011) - [i6]Krishnendu Chatterjee, Monika Henzinger:
An O(n^2) Time Algorithm for Alternating Büchi Games. CoRR abs/1109.5018 (2011) - [i5]Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger:
On Multiple Round Sponsored Search Auctions with Budgets. CoRR abs/1112.6361 (2011) - 2010
- [j35]Monika Henzinger, Jacob Suñol, Ingmar Weber:
The stability of the h-index. Scientometrics 84(2): 465-479 (2010) - [c51]Paul Dütting, Monika Henzinger:
Mechanisms for the Marriage and the Assignment Game. CIAC 2010: 6-12 - [c50]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194 - [c49]Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored Search, Market Equilibria, and the Hungarian Method. STACS 2010: 287-298 - [c48]Paul Dütting, Monika Henzinger, Ingmar Weber:
How much is your personal recommendation worth? WWW 2010: 1085-1086 - [i4]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010)
2000 – 2009
- 2009
- [c47]Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler:
A Comparison of Techniques for Sampling Web Pages. STACS 2009: 13-30 - [c46]Paul Dütting, Monika Henzinger, Ingmar Weber:
Bidder Optimal Assignments for General Utilities. WINE 2009: 575-582 - [c45]Ossama Abdel Hamid, Behshad Behzadi, Stefan Christoph, Monika Henzinger:
Detecting the origin of text segments efficiently. WWW 2009: 61-70 - [c44]Eda Baykan, Monika Henzinger, Ludmila Marian, Ingmar Weber:
Purely URL-based topic classification. WWW 2009: 1109-1110 - [i3]Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler:
A Comparison of Techniques for Sampling Web Pages. CoRR abs/0902.1604 (2009) - [i2]Paul Dütting, Monika Henzinger, Ingmar Weber:
On the Pricing of Recommendations and Recommending Strategically. CoRR abs/0911.1619 (2009) - [i1]Paul Dütting, Monika Henzinger, Ingmar Weber:
Sponsored Search, Market Equilibria, and the Hungarian Method. CoRR abs/0912.1934 (2009) - 2008
- [j34]Eda Baykan, Monika Henzinger, Ingmar Weber:
Web page language identification based on URLs. Proc. VLDB Endow. 1(1): 176-187 (2008) - [j33]Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos:
Theory research at Google. SIGACT News 39(2): 10-28 (2008) - [r2]Monika Henzinger:
PageRank Algorithm. Encyclopedia of Algorithms 2008 - 2007
- [c43]Monika Henzinger:
Combinatorial algorithms for web search engines: three success stories. SODA 2007: 1022-1026 - 2006
- [c42]Monika Henzinger:
Finding near-duplicate web pages: a large-scale evaluation of algorithms. SIGIR 2006: 284-291 - 2005
- [j32]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:
An online throughput-competitive algorithm for multicast routing and admission control. J. Algorithms 55(1): 1-20 (2005) - [j31]Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin:
Query-Free News Search. World Wide Web 8(2): 101-126 (2005) - [c41]Monika Henzinger:
Hyperlink analysis on the world wide web. Hypertext 2005: 1-3 - 2004
- [c40]Monika Henzinger:
The past, present, and future of web information retrieval. DRR 2004: 23-26 - [c39]Monika Henzinger:
Algorithmic Aspects of Web Search Engines. ESA 2004: 3 - [c38]Monika Henzinger:
The Past, Present, and Future of Web Search Engines p. ICALP 2004: 3 - [c37]Monika Henzinger:
The Past, Present and Future of Web Information Retrieval. PODS 2004: 46 - [r1]Monika Henzinger:
Data Structures in Web Information Retrieval. Handbook of Data Structures and Applications 2004 - 2003
- [j30]Monika Rauch Henzinger:
Algorithmic Challenges in Web Search Engines. Internet Math. 1(1): 115-123 (2003) - [j29]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling data transfers in a network and the set scheduling problem. J. Algorithms 48(2): 314-332 (2003) - [j28]Monika Rauch Henzinger, Stefano Leonardi:
Scheduling multicasts on unit-capacity trees and meshes. J. Comput. Syst. Sci. 66(3): 567-611 (2003) - [c36]Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein:
Challenges in Web Search Engines. IJCAI 2003: 1573-1579 - [c35]Monika Henzinger:
The Past, Present and Future of Web Information Retrieval. INFOS 2003: 52 - [c34]Monika Henzinger, Bay-Wei Chang, Brian Milch, Sergey Brin:
Query-free news search. WWW 2003: 1-10 - 2002
- [j27]Monika Rauch Henzinger, Rajeev Motwani, Craig Silverstein:
Challenges in web search engines. SIGIR Forum 36(2): 11-22 (2002) - [c33]Monika Henzinger:
Indexing the Web - A Challenge for Supercomputers. CLUSTER 2002: 343 - 2001
- [j26]Monika Rauch Henzinger:
Hyperlink Analysis for the Web. IEEE Internet Comput. 5(1): 45-50 (2001) - [j25]Monika Rauch Henzinger, Valerie King:
Maintaining Minimum Spanning Forests in Dynamic Graphs. SIAM J. Comput. 31(2): 364-374 (2001) - [c32]Krishna Bharat, Bay-Wei Chang, Monika Henzinger, Matthias Ruhl:
Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001: 51-58 - 2000
- [j24]Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork:
On near-uniform URL sampling. Comput. Networks 33(1-6): 295-308 (2000) - [j23]Monika Rauch Henzinger:
Link Analysis in Web Information Retrieval. IEEE Data Eng. Bull. 23(3): 3-8 (2000) - [j22]Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger:
A Comparison of Techniques to Find Mirrored Hosts on the WWW. IEEE Data Eng. Bull. 23(4): 21-26 (2000) - [j21]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. J. Algorithms 34(2): 222-250 (2000) - [j20]Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger:
A comparison of techniques to find mirrored hosts on the WWW. J. Am. Soc. Inf. Sci. 51(12): 1114-1122 (2000) - [j19]Susanne Albers, Monika Rauch Henzinger:
Exploring Unknown Environments. SIAM J. Comput. 29(4): 1164-1188 (2000) - [j18]Monika Rauch Henzinger:
Improved Data Structures for Fully Dynamic Biconnectivity. SIAM J. Comput. 29(6): 1761-1815 (2000) - [c31]Monika Henzinger:
Web Information Retrieval - an Algorithmic Perspective. ESA 2000: 1-8 - [c30]Monika Rauch Henzinger:
Web Information Retrieval. ICDE 2000: 693
1990 – 1999
- 1999
- [j17]Monika Rauch Henzinger, Valerie King, Tandy J. Warnow:
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. Algorithmica 24(1): 1-13 (1999) - [j16]Monika Rauch Henzinger, Allan Heydon, Michael Mitzenmacher, Marc Najork:
Measuring Index Quality Using Random Walks on the Web. Comput. Networks 31(11-16): 1291-1303 (1999) - [j15]Jeffrey Dean, Monika Rauch Henzinger:
Finding Related Pages in the World Wide Web. Comput. Networks 31(11-16): 1467-1479 (1999) - [j14]Monika Rauch Henzinger, Valerie King:
Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM 46(4): 502-516 (1999) - [j13]Craig Silverstein, Monika Henzinger, Hannes Marais, Michael Moricz:
Analysis of a Very Large Web Search Engine Query Log. SIGIR Forum 33(1): 6-12 (1999) - [c29]Krishna Bharat, Andrei Z. Broder, Jeffrey Dean, Monika Rauch Henzinger:
A Comparison of Techniques to Find Mirrored Hosts on the WWW. WOWS 1999: 2-12 - [c28]Monika Rauch Henzinger, Stefano Leonardi:
Scheduling Multicasts on Unit-Capacity Trees and Meshes. SODA 1999: 438-447 - [c27]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos:
Scheduling Data Transfers in a Network and the Set Scheduling Problem. STOC 1999: 189-197 - 1998
- [j12]David Alberts, Monika Rauch Henzinger:
Average-Case Analysis of Dynamic Graph Algorithms. Algorithmica 20(1): 31-60 (1998) - [j11]Monika Rauch Henzinger, Michael L. Fredman:
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22(3): 351-362 (1998) - [j10]Krishna Bharat, Andrei Z. Broder, Monika Henzinger, Puneet Kumar, Suresh Venkatasubramanian:
The Connectivity Server: Fast Access to Linkage Information on the Web. Comput. Networks 30(1-7): 469-477 (1998) - [c26]Monika Rauch Henzinger, Prabhakar Raghavan, Sridhar Rajagopalan:
Computing on data streams. External Memory Algorithms 1998: 107-118 - [c25]Andrei Z. Broder, Monika Rauch Henzinger:
Information Retrieval on the Web. FOCS 1998: 6 - [c24]Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger:
Parametric and Kinetic Minimum Spanning Trees. FOCS 1998: 596-605 - [c23]Krishna Bharat, Monika Rauch Henzinger:
Improved Algorithms for Topic Distillation in a Hyperlinked Environment. SIGIR 1998: 104-111 - [c22]Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin:
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. SODA 1998: 97-106 - 1997
- [j9]Monika Rauch Henzinger:
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. J. Algorithms 24(1): 194-220 (1997) - [j8]Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian:
Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55(1): 3-23 (1997) - [j7]Monika Rauch Henzinger, Mikkel Thorup:
Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Struct. Algorithms 11(4): 369-379 (1997) - [j6]Jennifer-Ann M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika Rauch Henzinger, Shun-Tak Leung, Richard L. Sites, Mark T. Vandevoorde, Carl A. Waldspurger, William E. Weihl:
Continuous Profiling: Where Have All the Cycles Gone? ACM Trans. Comput. Syst. 15(4): 357-390 (1997) - [c21]Monika Rauch Henzinger, Valerie King:
Maintaining Minimum Spanning Trees in Dynamic Graphs. ICALP 1997: 594-604 - [c20]Jennifer-Ann M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika Rauch Henzinger, Shun-Tak Leung, Richard L. Sites, Mark T. Vandevoorde, Carl A. Waldspurger, William E. Weihl:
Continuous Profiling: Where Have All the Cycles Gone? SOSP 1997: 1-14 - [c19]Susanne Albers, Monika Rauch Henzinger:
Exploring Unknown Environments. STOC 1997: 416-425 - 1996
- [j5]Monika Henzinger, David P. Williamson:
On the Number of Small Cuts in a Graph. Inf. Process. Lett. 59(1): 41-44 (1996) - [c18]Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques. FOCS 1996: 462-471 - [c17]Monika Rauch Henzinger, Mikkel Thorup:
Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996: 290-299 - [c16]Monika Rauch Henzinger, Valerie King, Tandy J. Warnow:
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. SODA 1996: 333-340 - [c15]Monika Rauch Henzinger, Jan Arne Telle:
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. SWAT 1996: 16-27 - 1995
- [j4]Monika Rauch Henzinger:
Fully Dynamic Biconnectivity in Graphs. Algorithmica 13(6): 503-538 (1995) - [c14]Monika Rauch Henzinger, Johannes A. La Poutré:
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. ESA 1995: 171-184 - [c13]Monika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke:
Computing Simulations on Finite and Infinite Graphs. FOCS 1995: 453-462 - [c12]Monika Rauch Henzinger, Valerie King:
Fully Dynamic Biconnectivity and Transitive Closure. FOCS 1995: 664-672 - [c11]Monika Rauch Henzinger:
Approximating Minimum Cuts under Insertions. ICALP 1995: 280-291 - [c10]David Alberts, Monika Rauch Henzinger:
Average Case Analysis of Dynamic Graph Algorithms. SODA 1995: 312-321 - [c9]Monika Rauch Henzinger, Valerie King:
Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC 1995: 519-527 - 1994
- [j3]John Hershberger, Monika Rauch, Subhash Suri:
Data Structures for Two-Edge Connectivity in Planar Graphs. Theor. Comput. Sci. 130(1): 139-161 (1994) - [c8]Monika Rauch Henzinger:
Fully Dynamic Cycle-Equivalence in Graphs. FOCS 1994: 744-755 - [c7]Philip N. Klein, Satish Rao, Monika Rauch, Sairam Subramanian:
Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37 - [c6]Monika Rauch:
Improved data structures for fully dynamic biconnectivity. STOC 1994: 686-695 - 1993
- [c5]Giuseppe F. Italiano, Johannes A. La Poutré, Monika Rauch:
Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract). ESA 1993: 212-223 - [c4]Bruce M. Maggs, Monika Rauch:
An Algorithm for Finding Predecessors in Integer Sets. WADS 1993: 483-493 - 1992
- [j2]Brandon Dixon, Monika Rauch, Robert Endre Tarjan:
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM J. Comput. 21(6): 1184-1192 (1992) - [c3]Monika Rauch:
Fully Dynamic Biconnectivity in Graphs. FOCS 1992: 50-59 - [c2]John Hershberger, Monika Rauch, Subhash Suri:
Fully Dynamic 2-Edge-Connectivity in Planar Graphs. SWAT 1992: 233-244 - 1990
- [j1]Kurt Mehlhorn, Stefan Näher, Monika Rauch:
On the Complexity of a Game Related to the Dictionary Problem. SIAM J. Comput. 19(5): 902-906 (1990)
1980 – 1989
- 1989
- [c1]Kurt Mehlhorn, Stefan Näher, Monika Rauch:
On the Complexity of a Game Related to the Dictionary Problem. FOCS 1989: 546-548
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-07 22:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
