Pages that link to "Item:Q329279"
From MaRDI portal
The following pages link to Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279):
Displaying 10 items.
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- A Polynomial Kernel for Funnel Arc Deletion Set. (Q6089658) (← links)
