Benoît Larose

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