Pages that link to "Item:Q2266940"
From MaRDI portal
The following pages link to Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940):
Displayed 27 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Algorithms for deletion problems on split graphs (Q2656339) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- (Q5002795) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- (Q5092387) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)