Similar Items: Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
- Optimal Learning-Augmented Algorithm for Online Bidding
- Online Coloring for Graphs of Large Odd Girth
- Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
- An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms