Pages that link to "Item:Q3429737"

The following pages link to The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (Q3429737):

Displaying 47 items.

• Ranking chain sum orders (Q290525) (← links)
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
• A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
• On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
• The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233) (← links)
• Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
• Kernels for feedback arc set in tournaments (Q657916) (← links)
• Boolean-width of graphs (Q719257) (← links)
• Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
• Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
• Computing the minimal covering set (Q943589) (← links)
• A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
• A survey on the complexity of tournament solutions (Q1042317) (← links)
• On the complexity of Slater's problems (Q1043351) (← links)
• Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
• Models for concurrent product and process design (Q1046061) (← links)
• Cycle reversions and dichromatic number in tournaments (Q1715622) (← links)
• Monocular extraction of 2.1D sketch using constrained convex optimization (Q1799939) (← links)
• Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
• Polynomial time algorithms for tracking path problems (Q2144269) (← 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)
• NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
• Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
• On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
• Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
• Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
• Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
• Binets: fundamental building blocks for phylogenetic networks (Q2359132) (← links)
• Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
• Hardness of fully dense problems (Q2643075) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
• Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Robust Learning of Consumer Preferences (Q5080653) (← links)
• Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
• Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
• Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
• Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← links)
• Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
• Invertibility of Digraphs and Tournaments (Q6141864) (← links)
• The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al.. (Q6494939) (← links)