Pages that link to "Item:Q3656868"
From MaRDI portal
The following pages link to Two Edge Modification Problems without Polynomial Kernels (Q3656868):
Displaying 4 items.
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
