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


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