Pages that link to "Item:Q1941715"

The following pages link to \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms (Q1941715):

Displayed 14 items.

• Exact solutions to generalized vertex covering problems: a comparison of two models (Q499689) ‎ (← links)
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) ‎ (← links)
• Vertex deletion problems on chordal graphs (Q1786595) ‎ (← links)
• Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) ‎ (← links)
• Faster parameterized algorithms for deletion to split graphs (Q2350905) ‎ (← links)
• Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) ‎ (← links)
• FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) ‎ (← links)
• Communication Complexity of Pairs of Graph Families with Applications (Q5111227) ‎ (← links)
• Vertex Deletion Problems on Chordal Graphs (Q5136314) ‎ (← links)
• Quadratic vertex kernel for split vertex deletion (Q5896158) ‎ (← links)
• Walking through waypoints (Q5918830) ‎ (← links)
• Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) ‎ (← links)
• Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) ‎ (← links)
• Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) ‎ (← links)