Pages that link to "Item:Q3113682"
From MaRDI portal
The following pages link to Vertex cover kernelization revisited: upper and lower bounds for a refined parameter (Q3113682):
Displaying 18 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← 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)
- On the hardness of losing width (Q2441542) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← 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)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Parameterized and Exact Computation (Q5311519) (← links)
- Kernels for structural parameterizations of vertex cover -- case of small degree modulators (Q5363786) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
