Similar Items: Streaming Complexity Separations for Dense and Sparse Graphs
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Designing sparse temporal graphs satisfying connectivity requirements
- A Separator for Minor-Free Graphs Beyond the Flow Barrier
- Small Independent Sets versus Small Separator in Geometric Intersection Graphs
- Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
- Faster Deterministic Streaming Vertex Coloring