Similar Items: The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Succinct Graph Representations and Algorithmic Applications
- Online Coloring for Graphs of Large Odd Girth
- Streaming Complexity Separations for Dense and Sparse Graphs
- Designing sparse temporal graphs satisfying connectivity requirements
- Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm