The following pages link to Hardness of fully dense problems (Q2643075):
Displaying 15 items.
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions (Q3191585) (← links)
- On Random Ordering Constraints (Q3392946) (← links)
- The Complexity and Distribution of Hard Problems (Q4834381) (← links)
- On Random Betweenness Constraints (Q4911112) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Polynomial time approximation schemes for some dense instances of NP-hard optimization problems (Q5945918) (← links)
- (Q6084404) (← links)
