Similar Items: On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
- Fast decremental tree sums in forests
- Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
- Set Parameterized Matching via Multi-Layer Hashing
- New Bounds for Kernel Sums via Fast Spherical Embeddings
- The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial