Pages that link to "Item:Q2790404"
From MaRDI portal
The following pages link to Hitting Forbidden Minors: Approximation and Kernelization (Q2790404):
Displaying 17 items.
- Scattered packings of cycles (Q306707) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- Packing and Covering Induced Subdivisions (Q4986803) (← links)
- (Q5009491) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- Subset feedback vertex set in chordal and split graphs (Q5919404) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
