Pages that link to "Item:Q5892184"
From MaRDI portal
The following pages link to A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5892184):
Displaying 15 items.
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
- 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)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- Another disjoint compression algorithm for odd cycle transversal (Q2445321) (← links)
- Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs (Q2938754) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← 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 (Q5895104) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5919400) (← links)
