The following pages link to On the Hardness of Losing Width (Q2891345):
Displaying 4 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)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)