No. Title Author Year
1 Algorithms and Hardness for Diameter in Dynamic Graphs Ancona, Bertie et al. 2019
2 Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs Chatterjee, Krishnendu et al. 2019
3 A Tree Structure For Dynamic Facility Location Goranci, Gramoz et al. 2018
4 Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs Goranci, Gramoz et al. 2018
5 Memetic Graph Clustering Biedermann, Sonja et al. 2018
6 Conditional Hardness for Sensitivity Problems Henzinger, Monika et al. 2017
7 Dynamic Clustering to Minimize the Sum of Radii Henzinger, Monika et al. 2017
8 Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk) Henzinger, Monika 2017
9 Faster Algorithms for Mean-Payoff Parity Games Chatterjee, Krishnendu et al. 2017
10 Improved Guarantees for Vertex Sparsification in Planar Graphs Goranci, Gramoz et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 19

DROPS-Home | Imprint | Privacy Published by LZI