Benoît Larose

David Emmanuel Pazmiño Pullas

CoRR, 2022

2021

Dismantlability, connectedness, and mixing in relational structures.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2021

2019

Surjective H-Colouring over Reflexive Digraphs.

[BibT_eX]

[DOI]

Barnaby Martin

Daniël Paulusma

ACM Trans. Comput. Theory, 2019

Long range actions, connectedness, and dismantlability in relational structures.

[BibT_eX]

[DOI]

CoRR, 2019

2018

NU Polymorphisms on Reflexive Digraphs.

[BibT_eX]

[DOI]

Mark H. Siggers

SIAM J. Discret. Math., 2018

2017

Asking the Metaquestions in Constraint Tractability.

[BibT_eX]

[DOI]

Hubie Chen

ACM Trans. Comput. Theory, 2017

Algebra and the Complexity of Digraph CSPs: a Survey.

[BibT_eX]

[DOI]

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2015

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Space complexity of list <i>H</i>-colouring: a dichotomy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

List-homomorphism problems on graphs and arc consistency.

[BibT_eX]

[DOI]

Adrien Lemaître

Discret. Math., 2013

Space complexity of list H-colouring: a dichotomy.

[BibT_eX]

[DOI]

CoRR, 2013

2012

The Complexity of the List Homomorphism Problem for Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

2009

Universal algebra and hardness results for constraint satisfaction problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Omitting Types, Bounded Width and the Ability to Count.

[BibT_eX]

[DOI]

Matthew Valeriote

Int. J. Algebra Comput., 2009

Maximum stable sets in analogs of Kneser and complete graphs.

[BibT_eX]

[DOI]

Gábor Kun

Eur. J. Comb., 2009

2008

Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Retractions onto series-parallel posets.

[BibT_eX]

[DOI]

Discret. Math., 2008

Maltsev + Datalog --> Symmetric Datalog.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Directed st-Connectivity Is Not Expressible in Symmetric Datalog.

[BibT_eX]

[DOI]

László Egri

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Dualities for Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Andrei A. Bulatov

Proceedings of the Complexity of Constraints, 2008

2007

First-order Definable Retraction Problems for Posets and Reflexive Graphs.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

A Characterisation of First-Order Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Cynthia Loten

Log. Methods Comput. Sci., 2007

Symmetric Datalog and Constraint Satisfaction Problems in Logspace.

[BibT_eX]

[DOI]

László Egri

Electron. Colloquium Comput. Complex., 2007

2006

Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.

[BibT_eX]

[DOI]

Ondrej Klíma

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

A polynomial-time algorithm for near-unanimity graphs.

[BibT_eX]

[DOI]

Cynthia Loten

J. Algorithms, 2005

Maximum Constraint Satisfaction on Diamonds.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Stable sets of maximal size in Kneser-type graphs.

[BibT_eX]

[DOI]

Claudia Malvenuto

Eur. J. Comb., 2004

First-Order Definable Retraction Problems for Posets and Reflexive Graph.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

The Complexity of the Extendibility Problem for Finite Posets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Solving Order Constraints in Logarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Projectivity and independent sets in powers of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Families of strongly projective graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2002

2000

Hedetniemi's Conjecture and the Retracts of a Product of Graphs.

[BibT_eX]

[DOI]

Comb., 2000

1999

Notes on Coalition Lattices.

[BibT_eX]

[DOI]

Gábor Czédli

György Pollák

Order, 1999

1998

On Normal Cayley Graphs and Hom-idempotent Graphs.

[BibT_eX]

[DOI]

François Laviolette

Eur. J. Comb., 1998

1997

Algebraic properties and dismantlability of finite posets.

[BibT_eX]

[DOI]

Discret. Math., 1997

1995

Minimal automorphic Posets and the Projection Property.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1995

1992

A property of projective ordered sets.

[BibT_eX]

[DOI]