Pages that link to "Item:Q3181056"
From MaRDI portal
The following pages link to Vertex Cover Structural Parameterization Revisited (Q3181056):
Displaying 13 items.
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← 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)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Vertex Cover Structural Parameterization Revisited (Q3181056) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← 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)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
