| 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 |
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs |
Henzinger, Monika et al. |
2022 |
| 5 |
Fully Dynamic Four-Vertex Subgraph Counting |
Hanauer, Kathrin et al. |
2022 |
| 6 |
Leximax Approximations and Representative Cohort Selection |
Henzinger, Monika et al. |
2022 |
| 7 |
Modern Dynamic Data Structures (Invited Talk) |
Henzinger, Monika |
2022 |
| 8 |
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) |
Hanauer, Kathrin et al. |
2022 |
| 9 |
Differentially Private Algorithms for Graphs Under Continual Observation |
Fichtenberger, Hendrik et al. |
2021 |
| 10 |
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs |
Chatterjee, Krishnendu et al. |
2021 |
| 11 |
Constant-Time Dynamic (Δ+1)-Coloring |
Henzinger, Monika et al. |
2020 |
| 12 |
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles |
Henzinger, Monika et al. |
2020 |
| 13 |
Dynamic Matching Algorithms in Practice |
Henzinger, Monika et al. |
2020 |
| 14 |
Faster Fully Dynamic Transitive Closure in Practice |
Hanauer, Kathrin et al. |
2020 |
| 15 |
Finding All Global Minimum Cuts in Practice |
Henzinger, Monika et al. |
2020 |
| 16 |
Fully-Dynamic Coresets |
Henzinger, Monika et al. |
2020 |
| 17 |
Algorithms and Hardness for Diameter in Dynamic Graphs |
Ancona, Bertie et al. |
2019 |
| 18 |
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs |
Chatterjee, Krishnendu et al. |
2019 |
| 19 |
A Tree Structure For Dynamic Facility Location |
Goranci, Gramoz et al. |
2018 |
| 20 |
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs |
Goranci, Gramoz et al. |
2018 |
| 21 |
Memetic Graph Clustering |
Biedermann, Sonja et al. |
2018 |
| 22 |
Conditional Hardness for Sensitivity Problems |
Henzinger, Monika et al. |
2017 |
| 23 |
Dynamic Clustering to Minimize the Sum of Radii |
Henzinger, Monika et al. |
2017 |
| 24 |
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk) |
Henzinger, Monika |
2017 |
| 25 |
Faster Algorithms for Mean-Payoff Parity Games |
Chatterjee, Krishnendu et al. |
2017 |
| 26 |
Improved Guarantees for Vertex Sparsification in Planar Graphs |
Goranci, Gramoz et al. |
2017 |
| 27 |
Improved Set-Based Symbolic Algorithms for Parity Games |
Chatterjee, Krishnendu et al. |
2017 |
| 28 |
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms |
Goranci, Gramoz et al. |
2017 |
| 29 |
Conditionally Optimal Algorithms for Generalized Büchi Games |
Chatterjee, Krishnendu et al. |
2016 |
| 30 |
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds |
Cheung, Yun Kuen et al. |
2016 |
