Author of the publication

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)

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

Tractable Monotone Temporal Planning., , and . ICAPS, AAAI, (2012)Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract)., , and . CP, volume 8656 of Lecture Notes in Computer Science, page 928-932. Springer, (2014)Domain Reduction for Valued Constraints by Generalising Methods from CSP., , and . CP, volume 11008 of Lecture Notes in Computer Science, page 64-80. Springer, (2018)On Singleton Arc Consistency for CSPs Defined by Monotone Patterns., , , and . STACS, volume 96 of LIPIcs, page 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Lightweight Parallel Multi-Agent Epistemic Planning., , , , and . KR, page 274-283. (2020)A Complete Characterization of Complexity for Boolean Constraint Optimization Problems., , and . CP, volume 3258 of Lecture Notes in Computer Science, page 212-226. Springer, (2004)Analysis of planning instances without search., , and . JIAF, page 200-210. (2023)Abductive Explanations of Classifiers Under Constraints: Complexity and Properties., and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 469-476. IOS Press, (2023)Soft Constraints: Complexity and Multimorphisms., , , and . CP, volume 2833 of Lecture Notes in Computer Science, page 244-258. Springer, (2003)Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay., , , , and . NeurIPS, (2020)