The following pages link to (Q4694754):
Displaying 21 items.
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
- Polynomial time algorithms for tracking path problems (Q2144269) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms (Q2509535) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Safe sets and in-dominating sets in digraphs (Q6153473) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
