Similar Items: A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
- Faster Deterministic Streaming Vertex Coloring
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- Randomized $k$-server in polynomial time
- New Bounds for Kernel Sums via Fast Spherical Embeddings
- EPTAS for Hard Graph Cut Problems for Dense Graphs