Similar Items: Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
- On (In)approximability of MaxMin Independent Set Reconfiguration
- Solving Hypergraph Laplacian Systems in Almost-Linear Time
- Matroid Algorithms Under Size-Sensitive Independence Oracles
- Small Independent Sets versus Small Separator in Geometric Intersection Graphs
- Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
- EPTAS for Hard Graph Cut Problems for Dense Graphs