Similar Items: Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
- An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
- Improved Approximation Algorithm for Maximum Balanced Biclique
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover