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


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