Pages that link to "Item:Q2662677"
From MaRDI portal
The following pages link to A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677):
Displaying 7 items.
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- Hitting forbidden minors: approximation and kernelization (Q3113683) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)
