Pages that link to "Item:Q2322700"
From MaRDI portal
The following pages link to Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700):
Displaying 15 items.
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q2963898) (← links)
- Vertex cover kernelization revisited: upper and lower bounds for a refined parameter (Q3113682) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q4606331) (← 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)
- Kernels for structural parameterizations of vertex cover -- case of small degree modulators (Q5363786) (← links)
- (Q6089666) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
