Pages that link to "Item:Q5895104"
From MaRDI portal
The following pages link to A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104):
Displaying 10 items.
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs (Q2938754) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- (Q5136298) (← links)
- Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization (Q5739833) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5892184) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5919400) (← links)