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 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)Universal algebra and hardness results for constraint satisfaction problems., and . Theor. Comput. Sci., 410 (18): 1629-1647 (2009)QCSP on Reflexive Tournaments., , , , , and . ESA, volume 204 of LIPIcs, page 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dismantlability, Connectedness, and Mixing in Relational Structures., , , and . ICALP, volume 132 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Asking the Metaquestions in Constraint Tractability., and . TOCT, 9 (3): 11:1-11:27 (2017)Universal Algebra and Hardness Results for Constraint Satisfaction Problems., and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 267-278. Springer, (2007)Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy., , , , and . LICS, page 487-498. IEEE Computer Society, (2015)A Characterisation of First-Order Constraint Satisfaction Problems., , and . LICS, page 201-210. IEEE Computer Society, (2006)Surjective H-Colouring over Reflexive Digraphs., , and . STACS, volume 96 of LIPIcs, page 49:1-49:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Directed st-Connectivity Is Not Expressible in Symmetric Datalog., , and . ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 172-183. Springer, (2008)