No. Title Author Year
1 Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs Henzinger, Monika et al. 2022
2 Fully Dynamic Four-Vertex Subgraph Counting Hanauer, Kathrin et al. 2022
3 Leximax Approximations and Representative Cohort Selection Henzinger, Monika et al. 2022
4 Modern Dynamic Data Structures (Invited Talk) Henzinger, Monika 2022
5 Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) Hanauer, Kathrin et al. 2022
6 Differentially Private Algorithms for Graphs Under Continual Observation Fichtenberger, Hendrik et al. 2021
7 Faster Algorithms for Bounded Liveness in Graphs and Game Graphs Chatterjee, Krishnendu et al. 2021
8 Constant-Time Dynamic (Δ+1)-Coloring Henzinger, Monika et al. 2020
9 Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles Henzinger, Monika et al. 2020
10 Dynamic Matching Algorithms in Practice Henzinger, Monika et al. 2020
11 Faster Fully Dynamic Transitive Closure in Practice Hanauer, Kathrin et al. 2020
12 Finding All Global Minimum Cuts in Practice Henzinger, Monika et al. 2020
13 Fully-Dynamic Coresets Henzinger, Monika et al. 2020
14 Algorithms and Hardness for Diameter in Dynamic Graphs Ancona, Bertie et al. 2019
15 Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs Chatterjee, Krishnendu et al. 2019
16 A Tree Structure For Dynamic Facility Location Goranci, Gramoz et al. 2018
17 Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs Goranci, Gramoz et al. 2018
18 Memetic Graph Clustering Biedermann, Sonja et al. 2018
19 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
20 Dynamic Clustering to Minimize the Sum of Radii Henzinger, Monika et al. 2017
21 Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk) Henzinger, Monika 2017
22 Faster Algorithms for Mean-Payoff Parity Games Chatterjee, Krishnendu et al. 2017
23 Improved Guarantees for Vertex Sparsification in Planar Graphs Goranci, Gramoz et al. 2017
24 Improved Set-Based Symbolic Algorithms for Parity Games Chatterjee, Krishnendu et al. 2017
25 The Power of Vertex Sparsifiers in Dynamic Graph Algorithms Goranci, Gramoz et al. 2017
26 Conditionally Optimal Algorithms for Generalized Büchi Games Chatterjee, Krishnendu et al. 2016
27 Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds Cheung, Yun Kuen et al. 2016
28 Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning Henzinger, Monika et al. 2016
29 Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time Goranci, Gramoz et al. 2016
30 Welfare Maximization with Friends-of-Friends Network Externalities Bhattacharya, Sayan et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 32


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI