The following pages link to (Q3113683):
Displaying 23 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← 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)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- (Q5111863) (← links)
