Pages that link to "Item:Q820159"

The following pages link to Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159):

Displaying 34 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)
• Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
• An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
• \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
• Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
• Kernels for feedback arc set in tournaments (Q657916) (← links)
• Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
• The solution space of sorting with recurring comparison faults (Q726101) (← 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)
• Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← 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)
• Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
• Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
• Parameterized complexity of the induced subgraph problem in directed graphs (Q2380001) (← links)
• Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
• Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
• The Solution Space of Sorting with Recurring Comparison Faults (Q2819522) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Recurring Comparison Faults: Sorting and Finding the Minimum (Q2947883) (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Acyclic Digraphs (Q3120435) (← links)
• Improved Parameterized Algorithms for the Kemeny Aggregation Problem (Q3656872) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)