The following pages link to (Q3113682):
Displayed 13 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)
- 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)
- 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 complexity for iterated type partitions and modular-width (Q6126724) (← links)