Similar Items: Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- Faster Deterministic Streaming Vertex Coloring
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Robust Inverse Quadratic Error Decay with Meshing and Beam Search for Random Subset Sum
- On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
- A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
- Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility