( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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.

Cooper Baker

Simon Cooper

Jason Cooper

Maria Cooper

Sam Cooper

 

Другие публикации лиц с тем же именем

Tractable Monotone Temporal Planning., , и . ICAPS, AAAI, (2012)The tractability of CSP classes defined by forbidden patterns, , , и . CoRR, (2011)Hybrid Tractable Classes of Constraint Problems., и . The Constraint Satisfaction Problem, том 7 из Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP., , и . CP, том 7514 из Lecture Notes in Computer Science, стр. 265-273. Springer, (2012)Binarisation for Valued Constraint Satisfaction Problems., , , , , и . SIAM J. Discret. Math., 31 (4): 2279-2300 (2017)Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract)., , и . CP, том 8656 из Lecture Notes in Computer Science, стр. 928-932. Springer, (2014)Domain Reduction for Valued Constraints by Generalising Methods from CSP., , и . CP, том 11008 из Lecture Notes in Computer Science, стр. 64-80. Springer, (2018)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)Abductive Explanations of Classifiers Under Constraints: Complexity and Properties., и . ECAI, том 372 из Frontiers in Artificial Intelligence and Applications, стр. 469-476. IOS Press, (2023)