Benoît Larose

Publication Activity (10 Years)

Years Active: 1992-2022
Publications (10 Years): 14

Top Topics

Intuitionistic Fuzzy

Constraint Satisfaction

Association Graph

Conformant Planning

Top Venues

SIAM J. Discret. Math.

ACM Trans. Comput. Theory

Publications

Isabelle Larivière, Benoît Larose, David Emmanuel Pazmiño Pullas
Surjective polymorphisms of reflexive cycles. CoRR (2022)
Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23 (3) (2022)
Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose
Dismantlability, connectedness, and mixing in relational structures. J. Comb. Theory, Ser. B 147 (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ESA (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. CoRR (2021)
Benoît Larose, Barnaby Martin, Daniël Paulusma
Surjective H-Colouring over Reflexive Digraphs. ACM Trans. Comput. Theory 11 (1) (2019)
Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose
Dismantlability, Connectedness, and Mixing in Relational Structures. ICALP (2019)
Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose
Long range actions, connectedness, and dismantlability in relational structures. CoRR (2019)
Benoît Larose, Barnaby Martin, Daniël Paulusma
Surjective H-Colouring over Reflexive Digraphs. STACS (2018)
Benoît Larose, Mark H. Siggers
NU Polymorphisms on Reflexive Digraphs. SIAM J. Discret. Math. 32 (1) (2018)
Benoît Larose, Barnaby Martin, Daniël Paulusma
Surjective H-Colouring over Reflexive Digraphs. CoRR (2017)
Hubie Chen, Benoît Larose
Asking the Metaquestions in Constraint Tractability. ACM Trans. Comput. Theory 9 (3) (2017)
Hubie Chen, Benoît Larose
Asking the metaquestions in constraint tractability. CoRR (2016)
Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS (2015)
László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
-colouring: a dichotomy. SODA (2014)
Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28 (2) (2014)
Benoît Larose, Adrien Lemaître
List-homomorphism problems on graphs and arc consistency. Discret. Math. 313 (22) (2013)
László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
Space complexity of list H-colouring: a dichotomy. CoRR (2013)
Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27 (4) (2013)
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
The Complexity of the List Homomorphism Problem for Graphs. Theory Comput. Syst. 51 (2) (2012)
Benoît Larose, Adrien Lemaître
List-Homomorphism Problems on Graphs and Arc Consistency. ISMVL (2012)
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
The Complexity of the List Homomorphism Problem for Graphs. STACS (2010)
Gábor Kun, Benoît Larose
Maximum stable sets in analogs of Kneser and complete graphs. Eur. J. Comb. 30 (1) (2009)
Benoît Larose, Pascal Tesson
Universal algebra and hardness results for constraint satisfaction problems. Theor. Comput. Sci. 410 (18) (2009)
Benoît Larose, Matthew Valeriote, László Zádori
Omitting Types, Bounded Width and the Ability to Count. Int. J. Algebra Comput. 19 (5) (2009)
László Egri, Andrei A. Krokhin, Benoît Larose, Pascal Tesson
The complexity of the list homomorphism problem for graphs CoRR (2009)
Víctor Dalmau, Benoît Larose
Maltsev + Datalog --> Symmetric Datalog. LICS (2008)
László Egri, Benoît Larose, Pascal Tesson
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. ICALP (2) (2008)
Andrei A. Bulatov, Andrei A. Krokhin, Benoît Larose
Dualities for Constraint Satisfaction Problems. Complexity of Constraints (2008)
Andrei A. Krokhin, Benoît Larose
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction. SIAM J. Discret. Math. 22 (1) (2008)
Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
Retractions onto series-parallel posets. Discret. Math. 308 (11) (2008)
Benoît Larose, Cynthia Loten, Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems CoRR (2007)
Benoît Larose, Pascal Tesson
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. ICALP (2007)
László Egri, Benoît Larose, Pascal Tesson
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. LICS (2007)
Benoît Larose, Pascal Tesson
Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Electron. Colloquium Comput. Complex. 14 (025) (2007)
Benoît Larose, Cynthia Loten, Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems. Log. Methods Comput. Sci. 3 (4) (2007)
Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
First-order Definable Retraction Problems for Posets and Reflexive Graphs. J. Log. Comput. 17 (1) (2007)
László Egri, Benoît Larose, Pascal Tesson
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. Electron. Colloquium Comput. Complex. 14 (024) (2007)
Ondrej Klíma, Benoît Larose, Pascal Tesson
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. MFCS (2006)
Benoît Larose, Cynthia Loten, Claude Tardif
A Characterisation of First-Order Constraint Satisfaction Problems. LICS (2006)
Benoît Larose, László Zádori
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. Int. J. Algebra Comput. 16 (3) (2006)
Andrei A. Krokhin, Benoît Larose
Maximum Constraint Satisfaction on Diamonds. CP (2005)
Benoît Larose, Cynthia Loten, László Zádori
A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55 (2) (2005)
Benoît Larose, Claudia Malvenuto
Stable sets of maximal size in Kneser-type graphs. Eur. J. Comb. 25 (5) (2004)
Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
First-Order Definable Retraction Problems for Posets and Reflexive Graph. LICS (2004)
Andrei A. Krokhin, Benoît Larose
Solving Order Constraints in Logarithmic Space. STACS (2003)
Benoît Larose, László Zádori
The Complexity of the Extendibility Problem for Finite Posets. SIAM J. Discret. Math. 17 (1) (2003)
Benoît Larose
Families of strongly projective graphs. Discuss. Math. Graph Theory 22 (2) (2002)
Benoît Larose, Claude Tardif
Projectivity and independent sets in powers of graphs. J. Graph Theory 40 (3) (2002)
Benoît Larose, Claude Tardif
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. Comb. 20 (4) (2000)
Gábor Czédli, Benoît Larose, György Pollák
Notes on Coalition Lattices. Order 16 (1) (1999)
Benoît Larose, François Laviolette, Claude Tardif
On Normal Cayley Graphs and Hom-idempotent Graphs. Eur. J. Comb. 19 (7) (1998)
Benoît Larose, László Zádori
Algebraic properties and dismantlability of finite posets. Discret. Math. 163 (1-3) (1997)
Benoît Larose
Minimal automorphic Posets and the Projection Property. Int. J. Algebra Comput. 5 (1) (1995)
Benoît Larose
A property of projective ordered sets. Eur. J. Comb. 13 (5) (1992)