Similar Items: EPTAS for Hard Graph Cut Problems for Dense Graphs
- Streaming Complexity Separations for Dense and Sparse Graphs
- A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
- Succinct Graph Representations and Algorithmic Applications
- Online Coloring for Graphs of Large Odd Girth
- Designing sparse temporal graphs satisfying connectivity requirements
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs