Author of the publication

On Guaranteeing Polynomially Bounded Search Tree Size.

, , , and . CP, volume 6876 of Lecture Notes in Computer Science, page 160-171. Springer, (2011)

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)The tractability of CSP classes defined by forbidden patterns, , , and . CoRR, (2011)Transformation of optimal planning problems., , and . J. Exp. Theor. Artif. Intell., 23 (2): 181-199 (2011)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)Binarisation for Valued Constraint Satisfaction Problems., , , , , and . SIAM J. Discret. Math., 31 (4): 2279-2300 (2017)Binary constraint satisfaction problems defined by excluded topological minors., , , and . Inf. Comput., (2019)Hybrid Tractable Classes of Constraint Problems., and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)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)Efficient systematic analysis of occlusion.. Pattern Recognit. Lett., 7 (4): 259-264 (1988)