The following pages link to (Q6089665):
Displaying 3 items.
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)