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

1 |
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems |
Henzinger, Monika et al. |
2023 |

2 |
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks |
El-Hayek, Antoine et al. |
2023 |

3 |
Dynamic Maintenance of Monotone Dynamic Programs and Applications |
Henzinger, Monika et al. |
2023 |

4 |
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow |
Goranci, Gramoz et al. |
2023 |

5 |
Faster Submodular Maximization for Several Classes of Matroids |
Henzinger, Monika et al. |
2023 |

6 |
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs |
Henzinger, Monika et al. |
2022 |

7 |
Fully Dynamic Four-Vertex Subgraph Counting |
Hanauer, Kathrin et al. |
2022 |

8 |
Leximax Approximations and Representative Cohort Selection |
Henzinger, Monika et al. |
2022 |

9 |
Modern Dynamic Data Structures (Invited Talk) |
Henzinger, Monika |
2022 |

10 |
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) |
Hanauer, Kathrin et al. |
2022 |

11 |
Differentially Private Algorithms for Graphs Under Continual Observation |
Fichtenberger, Hendrik et al. |
2021 |

12 |
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs |
Chatterjee, Krishnendu et al. |
2021 |

13 |
Constant-Time Dynamic (Δ+1)-Coloring |
Henzinger, Monika et al. |
2020 |

14 |
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles |
Henzinger, Monika et al. |
2020 |

15 |
Dynamic Matching Algorithms in Practice |
Henzinger, Monika et al. |
2020 |

16 |
Faster Fully Dynamic Transitive Closure in Practice |
Hanauer, Kathrin et al. |
2020 |

17 |
Finding All Global Minimum Cuts in Practice |
Henzinger, Monika et al. |
2020 |

18 |
Fully-Dynamic Coresets |
Henzinger, Monika et al. |
2020 |

19 |
Algorithms and Hardness for Diameter in Dynamic Graphs |
Ancona, Bertie et al. |
2019 |

20 |
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs |
Chatterjee, Krishnendu et al. |
2019 |

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

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

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

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

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

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

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

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

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

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

31 |
Conditionally Optimal Algorithms for Generalized Büchi Games |
Chatterjee, Krishnendu et al. |
2016 |

32 |
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds |
Cheung, Yun Kuen et al. |
2016 |

33 |
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning |
Henzinger, Monika et al. |
2016 |

34 |
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time |
Goranci, Gramoz et al. |
2016 |

35 |
Welfare Maximization with Friends-of-Friends Network Externalities |
Bhattacharya, Sayan et al. |
2015 |

36 |
Sponsored Search, Market Equilibria, and the Hungarian Method |
Dütting, Paul et al. |
2010 |

37 |
A Comparison of Techniques for Sampling Web Pages |
Baykan, Eda et al. |
2009 |