A property of projective ordered sets. - Benoît Larose (Eur. J. Comb., 1992)

Minimal automorphic Posets and the Projection Property. - Benoît Larose (Int. J. Algebra Comput., 1995)

Algebraic properties and dismantlability of finite posets. - Benoît Larose; László Zádori (Discret. Math., 1997)

On Normal Cayley Graphs and Hom-idempotent Graphs. - Benoît Larose; François Laviolette; Claude Tardif (Eur. J. Comb., 1998)

Notes on Coalition Lattices. - Gábor Czédli; Benoît Larose; György Pollák (Order, 1999)

Hedetniemi's Conjecture and the Retracts of a Product of Graphs. - Benoît Larose; Claude Tardif (Comb., 2000)

Families of strongly projective graphs. - Benoît Larose (Discuss. Math. Graph Theory, 2002)

Projectivity and independent sets in powers of graphs. - Benoît Larose; Claude Tardif (J. Graph Theory, 2002)

Solving Order Constraints in Logarithmic Space. - Andrei A. Krokhin; Benoît Larose (STACS, 2003)

The Complexity of the Extendibility Problem for Finite Posets. - Benoît Larose; László Zádori (SIAM J. Discret. Math., 2003)

First-Order Definable Retraction Problems for Posets and Reflexive Graph. - Víctor Dalmau; Andrei A. Krokhin; Benoît Larose (LICS, 2004)

Stable sets of maximal size in Kneser-type graphs. - Benoît Larose; Claudia Malvenuto (Eur. J. Comb., 2004)

Maximum Constraint Satisfaction on Diamonds. - Andrei A. Krokhin; Benoît Larose (CP, 2005)

A polynomial-time algorithm for near-unanimity graphs. - Benoît Larose; Cynthia Loten; László Zádori (J. Algorithms, 2005)

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. - Ondrej Klíma 001; Benoît Larose; Pascal Tesson (MFCS, 2006)

Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. - Benoît Larose; László Zádori (Int. J. Algebra Comput., 2006)

Symmetric Datalog and Constraint Satisfaction Problems in Logspace. - László Egri; Benoît Larose; Pascal Tesson (Electron. Colloquium Comput. Complex., 2007)

A Characterisation of First-Order Constraint Satisfaction Problems. - Benoît Larose; Cynthia Loten; Claude Tardif (Log. Methods Comput. Sci., 2007)

First-order Definable Retraction Problems for Posets and Reflexive Graphs. - Víctor Dalmau; Andrei A. Krokhin; Benoît Larose (J. Log. Comput., 2007)

Dualities for Constraint Satisfaction Problems. - Andrei A. Bulatov; Andrei A. Krokhin; Benoît Larose (Complexity of Constraints, 2008)

Directed st-Connectivity Is Not Expressible in Symmetric Datalog. - László Egri; Benoît Larose; Pascal Tesson (ICALP (2), 2008)

Maltsev + Datalog –> Symmetric Datalog. - Víctor Dalmau; Benoît Larose (LICS, 2008)

Retractions onto series-parallel posets. - Víctor Dalmau; Andrei A. Krokhin; Benoît Larose (Discret. Math., 2008)

Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction. - Andrei A. Krokhin; Benoît Larose (SIAM J. Discret. Math., 2008)

Maximum stable sets in analogs of Kneser and complete graphs. - Gábor Kun; Benoît Larose (Eur. J. Comb., 2009)

Omitting Types, Bounded Width and the Ability to Count. - Benoît Larose; Matthew Valeriote; László Zádori (Int. J. Algebra Comput., 2009)

Universal algebra and hardness results for constraint satisfaction problems. - Benoît Larose; Pascal Tesson (Theor. Comput. Sci., 2009)

The Complexity of the List Homomorphism Problem for Graphs. - László Egri; Andrei A. Krokhin; Benoît Larose; Pascal Tesson (Theory Comput. Syst., 2012)

Space complexity of list H-colouring: a dichotomy. - László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (CoRR, 2013)

List-homomorphism problems on graphs and arc consistency. - Benoît Larose; Adrien Lemaître (Discret. Math., 2013)

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Cynthia Loten; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2013)

Space complexity of list H-colouring: a dichotomy. - László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (SODA, 2014)

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2014)

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. - Víctor Dalmau; László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (LICS, 2015)

Algebra and the Complexity of Digraph CSPs: a Survey. - Benoît Larose (The Constraint Satisfaction Problem, 2017)

Asking the Metaquestions in Constraint Tractability. - Hubie Chen; Benoît Larose (ACM Trans. Comput. Theory, 2017)

NU Polymorphisms on Reflexive Digraphs. - Benoît Larose; Mark H. Siggers (SIAM J. Discret. Math., 2018)

Long range actions, connectedness, and dismantlability in relational structures. - Raimundo Briceño; Andrei Bulatov 001; Víctor Dalmau; Benoît Larose (CoRR, 2019)

Surjective H-Colouring over Reflexive Digraphs. - Benoît Larose; Barnaby Martin; Daniël Paulusma (ACM Trans. Comput. Theory, 2019)

Dismantlability, connectedness, and mixing in relational structures. - Raimundo Briceño; Andrei Bulatov 001; Víctor Dalmau; Benoît Larose (J. Comb. Theory B, 2021)

Surjective polymorphisms of reflexive cycles. - Isabelle Larivière; Benoît Larose; David Emmanuel Pazmiño Pullas (CoRR, 2022)

QCSP on Reflexive Tournaments. - Benoît Larose; Barnaby Martin; Petar Markovic; Daniël Paulusma; Siani Smith; Stanislav Zivný (ACM Trans. Comput. Log., 2022)