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

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences., , , and . Constraints An Int. J., 27 (3): 249-283 (2022)Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences., , and . CP, volume 235 of LIPIcs, page 16:1-16:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP., , and . CP, volume 7514 of Lecture Notes in Computer Science, page 265-273. Springer, (2012)Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns., and . Discret. Appl. Math., (2015)Regular pattern-free coloring., and . Discret. Appl. Math., (2022)Variable and value elimination in binary constraint satisfaction via forbidden patterns., , , and . J. Comput. Syst. Sci., 81 (7): 1127-1143 (2015)Three-Dimensional Matching Instances Are Rich in Stable Matchings., and . CPAIOR, volume 10848 of Lecture Notes in Computer Science, page 182-197. Springer, (2018)Leprechauns on the chessboard., and . Discret. Math., 344 (5): 112316 (2021)Variable Elimination in Binary CSP via Forbidden Patterns., , , and . IJCAI, page 517-523. IJCAI/AAAI, (2013)A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences., , , and . CP, volume 210 of LIPIcs, page 22:1-22:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)