Similar Items: Set Parameterized Matching via Multi-Layer Hashing
- On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
- Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
- 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
- Dynamic Rank, Basis, and Matching
- On the Complexity of the Matching Problem of Regular Expressions with Backreferences