The following pages link to On the hardness of losing width (Q2441542):
Displaying 14 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- Vertex Cover Structural Parameterization Revisited (Q3181056) (← links)
- (Q5002795) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- (Q5111250) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
