On planar valued CSPs (Q2396724): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2017.03.005
@@ Property / DOI: 10.1016/j.jcss.2017.03.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2280355158
@@ Property / OpenAlex ID: W2280355158 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06323
@@ Property / arXiv ID: 1602.06323 / rank @@
+Normal rank
@@ Property / cites work @@
+On Planar Valued CSPs
@@ Property / cites work: On Planar Valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring, constraint satisfaction, and complexity
+Normal rank
@@ Property / cites work @@
+The Complexity of Valued CSPs
@@ Property / cites work: The Complexity of Valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of soft constraint satisfaction
@@ Property / cites work: The complexity of soft constraint satisfaction / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3821582
@@ Property / cites work: Q3821582 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Cut of a Planar Graph in Polynomial Time
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+On Planar Boolean CSP
@@ Property / cites work: On Planar Boolean CSP / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of conservative valued CSPs
@@ Property / cites work: The complexity of conservative valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+Sherali-Adams Relaxations for Valued CSPs
@@ Property / cites work: Sherali-Adams Relaxations for Valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Sherali--Adams Relaxations for General-Valued CSPs
+Normal rank
@@ Property / cites work @@
+Complexity of conservative constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q3184605
@@ Property / cites work: Q3184605 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algebraic Theory of Complexity for Discrete Optimization
+Normal rank
@@ Property / cites work @@
+A Galois Connection for Valued Constraint Languages of Infinite Size
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Tractability in constraint satisfaction problems: a survey
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+Necessary Conditions for Tractability of Valued CSPs
+Normal rank
@@ Property / cites work @@
+Algebraic Properties of Valued Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Skew Bisubmodularity and Valued CSPs
@@ Property / cites work: Skew Bisubmodularity and Valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Linear Programming for General-Valued CSPs
+Normal rank
@@ Property / cites work @@
+The Complexity of Finite-Valued CSPs
@@ Property / cites work: The Complexity of Finite-Valued CSPs / rank @@
+Normal rank
@@ Property / cites work @@
+Effectiveness of Structural Restrictions for Hybrid CSPs
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Bounded Tree-Width and CSP-Related Problems
@@ Property / cites work: Bounded Tree-Width and CSP-Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The challenges of unbounded treewidth in parameterised subgraph counting problems
+Normal rank
@@ Property / cites work @@
+Even Delta-Matroids and the Complexity of Planar Boolean CSPs
+Normal rank
@@ Property / cites work @@
+The complexity of planar Boolean \#CSP with complex weights
+Normal rank
@@ Property / cites work @@
+Q4228486
@@ Property / cites work: Q4228486 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Constraints, consistency and closure
@@ Property / cites work: Constraints, consistency and closure / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
+Normal rank
@@ Property / cites work @@
+A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2017.03.005
@@ Property / DOI: 10.1016/J.JCSS.2017.03.005 / rank @@
+Normal rank