Pages that link to "Item:Q5111879"
From MaRDI portal
The following pages link to Smaller Parameters for Vertex Cover Kernelization (Q5111879):
Displaying 8 items.
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
