Pages that link to "Item:Q5111388"
From MaRDI portal
The following pages link to Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5111388):
Displaying 11 items.
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
