Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMonika Henzinger
Monika Rauch Henzinger – Monika Rauch
Person information
- affiliation: University of Vienna, Faculty of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j68]Sayan Bhattacharya
, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Dynamic Matching in O(1) Update Time. Algorithmica 82(4): 1057-1080 (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) - [c119]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - [c118]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX 2020: 106-119 - [c117]Monika Henzinger, Pan Peng:
Constant-Time Dynamic (Δ+1)-Coloring. STACS 2020: 53:1-53:18 - [p1]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Vienna Graph Clustering. Protein-Protein Interaction Networks 2020: 215-231 - [i75]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. CoRR abs/2002.00813 (2020) - [i74]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - [i73]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs/2002.10142 (2020) - [i72]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020) - [i71]Monika Henzinger, Stefan Neumann, Andreas Wiese:
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. CoRR abs/2003.02605 (2020) - [i70]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. CoRR abs/2004.09099 (2020) - [i69]Sebastian Forster, Gramoz Goranci, Monika Henzinger:
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. CoRR abs/2004.10319 (2020) - [i68]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. CoRR abs/2004.11666 (2020) - [i67]Monika Henzinger, Sagar Kale:
Fully-Dynamic Coresets. CoRR abs/2004.14891 (2020) - [i66]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)
2010 – 2019
- 2019
- [j65]Monika Henzinger, Stefan Neumann, Stefan Schmid:
Efficient Distributed Workload (Re-)Embedding. POMACS 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(Part): 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 Journal of Experimental 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. Logical Methods in Computer Science 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. Bulletin of the 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)