Similar Items: The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
- On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
- Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
- Set Parameterized Matching via Multi-Layer Hashing
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- Temporal Routing in Static Networks: The Schedule Completion Problem
- Towards Settling the Complexity of the Lettericity Problem