Similar Items: Matroid Algorithms Under Size-Sensitive Independence Oracles
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- A note on the parameter $ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
- An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
- New Diameter Approximations via Distance Oracle Techniques
- Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
- Solution independence and self-referential instances