Pages that link to "Item:Q3448821"
From MaRDI portal
The following pages link to Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821):
Displayed 22 items.
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- (Q4962666) (redirect page) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- On the lossy kernelization for connected treedepth deletion set (Q6043184) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)