No. |
Title |
Author |
Year |
---|

1 |
A Tree Structure For Dynamic Facility Location |
Goranci, Gramoz et al. |
2018 |

2 |
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs |
Goranci, Gramoz et al. |
2018 |

3 |
Memetic Graph Clustering |
Biedermann, Sonja et al. |
2018 |

4 |
Conditional Hardness for Sensitivity Problems |
Henzinger, Monika et al. |
2017 |

5 |
Dynamic Clustering to Minimize the Sum of Radii |
Henzinger, Monika et al. |
2017 |

6 |
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk) |
Henzinger, Monika |
2017 |

7 |
Faster Algorithms for Mean-Payoff Parity Games |
Chatterjee, Krishnendu et al. |
2017 |

8 |
Improved Guarantees for Vertex Sparsification in Planar Graphs |
Goranci, Gramoz et al. |
2017 |

9 |
Improved Set-Based Symbolic Algorithms for Parity Games |
Chatterjee, Krishnendu et al. |
2017 |

10 |
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms |
Goranci, Gramoz et al. |
2017 |