The following pages link to (Q2965491):
Displaying 8 items.
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems (Q3467861) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
