No. Title Author Year
1 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
2 Dynamic Clustering to Minimize the Sum of Radii Henzinger, Monika et al. 2017
3 Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk) Henzinger, Monika 2017
4 Faster Algorithms for Mean-Payoff Parity Games Chatterjee, Krishnendu et al. 2017
5 Improved Guarantees for Vertex Sparsification in Planar Graphs Goranci, Gramoz et al. 2017
6 Improved Set-Based Symbolic Algorithms for Parity Games Chatterjee, Krishnendu et al. 2017
7 The Power of Vertex Sparsifiers in Dynamic Graph Algorithms Goranci, Gramoz et al. 2017
8 Conditionally Optimal Algorithms for Generalized Büchi Games Chatterjee, Krishnendu et al. 2016
9 Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds Cheung, Yun Kuen et al. 2016
10 Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning Henzinger, Monika et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint Published by LZI