Author of the publication

The Complexity of the List Homomorphism Problem for Graphs.

, , , and . STACS, volume 5 of LIPIcs, page 335-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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

The approximability of MAX CSP with fixed-value constraints, , , and . CoRR, (2006)Polymorphisms, and How to Use Them., , and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Constraint Satisfaction Problems and Finite Algebras., , and . ICALP, volume 1853 of Lecture Notes in Computer Science, page 272-282. Springer, (2000)Robust Satisfiability for CSPs: Hardness and Algorithmic Results., and . TOCT, 5 (4): 15:1-15:25 (2013)Retractions onto series-parallel posets., , and . Discret. Math., 308 (11): 2104-2114 (2008)Identifying Efficiently Solvable Cases of Max CSP., , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 152-163. Springer, (2004)The Complexity of Evaluating First-Order Sentences over a Fixed Structure.. LICS, page 331. IEEE Computer Society, (2011)The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)., , and . Dagstuhl Reports, 2 (11): 1-19 (2012)Majority constraints have bounded pathwidth duality., and . Eur. J. Comb., 29 (4): 821-837 (2008)Algebraic approach to promise constraint satisfaction., , and . STOC, page 602-613. ACM, (2019)