Author of the publication

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.

, , , , , and . Artif. Intell., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Extending Broken Triangles and Enhanced Value-Merging., , and . CP, volume 9892 of Lecture Notes in Computer Science, page 173-188. Springer, (2016)Combining restarts, nogoods and bag-connected decompositions for solving CSPs., and . Constraints An Int. J., 22 (2): 191-229 (2017)Computing and Exploiting Tree-Decompositions for Solving Constraint Networks., , and . CP, volume 3709 of Lecture Notes in Computer Science, page 777-781. Springer, (2005)An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP., , and . CP, volume 4204 of Lecture Notes in Computer Science, page 741-745. Springer, (2006)Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size., , and . CP, volume 9892 of Lecture Notes in Computer Science, page 298-315. Springer, (2016)A CP Approach for the Liner Shipping Network Design Problem., , and . CP, volume 280 of LIPIcs, page 16:1-16:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Microstructures for CSPs with Constraints of Arbitrary Arity., , and . SARA, AAAI, (2013)A Tree Decomposition Based Approach to Solve Structured SAT Instances., , and . ICTAI, page 115-122. IEEE Computer Society, (2009)Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry., , , , and . CP, volume 12333 of Lecture Notes in Computer Science, page 690-706. Springer, (2020)Recherche coopérative et Nogood Recording.. JFPLC, page 173-188. Hermes, (2001)