Similar Items: Succinct Graph Representations and Algorithmic Applications
- A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch
- Online Coloring for Graphs of Large Odd Girth
- The Impact of Approximation on Algorithmic Progress
- Loop Composition in Quantum Algorithms