( en | de | ru )

 

Disambiguation of "Cooper, Martin C."

Author of the publication

copydeleteadd this publication to your clipboard
Linear-Time Algorithms for Testing the Realisability of Line Drawings of Curved Objects.

. Artif. Intell., 108 (1-2): 31-67 (1999)

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.

Cooper Baker

Simon Cooper

Jason Cooper

Sam Cooper

Maria Cooper

 

Other publications of authors with the same name

The tractability of CSP classes defined by forbidden patterns, , , and . CoRR, (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)Tractable Monotone Temporal Planning., , and . ICAPS, AAAI, (2012)Binarisation for Valued Constraint Satisfaction Problems., , , , , and . SIAM J. Discret. Math., 31 (4): 2279-2300 (2017)An Optimal k-Consistency Algorithm.. Artif. Intell., 41 (1): 89-95 (1989)Fundamental Properties of Neighbourhood Substitution in Constraint Satisfaction Problems.. Artif. Intell., 90 (1-2): 1-24 (1997)Analysis of planning instances without search., , and . JIAF, page 200-210. (2023)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)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)