Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.06.021
@@ Property / DOI: 10.1016/j.tcs.2015.06.021 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+MiniZinc
@@ Property / describes a project that uses: MiniZinc / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2964101983
@@ Property / OpenAlex ID: W2964101983 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2371
@@ Property / arXiv ID: 1410.2371 / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
+Normal rank
@@ Property / cites work @@
+The complexity of temporal constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+The circular chromatic number of a digraph
@@ Property / cites work: The circular chromatic number of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
+Normal rank
@@ Property / cites work @@
+New results on optimizing rooted triplets consistency
+Normal rank
@@ Property / cites work @@
+A Geometric Approach to Betweenness
@@ Property / cites work: A Geometric Approach to Betweenness / rank @@
+Normal rank
@@ Property / cites work @@
+Domino Tatami Covering Is NP-Complete
@@ Property / cites work: Domino Tatami Covering Is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic ordering is NP-complete
@@ Property / cites work: Cyclic ordering is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel and fast algorithm for dense triplet inconsistency
+Normal rank
@@ Property / cites work @@
+Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
+Normal rank
@@ Property / cites work @@
+Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
+Normal rank
@@ Property / cites work @@
+Q2741464
@@ Property / cites work: Q2741464 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing tree and character compatibility across several phylogenetic trees
+Normal rank
@@ Property / cites work @@
+The maximum agreement subtree problem
@@ Property / cites work: The maximum agreement subtree problem / rank @@
+Normal rank
@@ Property / cites work @@
+The dichromatic number of a digraph
@@ Property / cites work: The dichromatic number of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved bound on the maximum agreement subtree problem
+Normal rank
@@ Property / cites work @@
+Constructing the maximum consensus tree from rooted Triples
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.06.021
@@ Property / DOI: 10.1016/J.TCS.2015.06.021 / rank @@
+Normal rank