Similar Items: Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Matroid Algorithms Under Size-Sensitive Independence Oracles
- Faster Deterministic Streaming Vertex Coloring
- New Diameter Approximations via Distance Oracle Techniques
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time