B. Larose

Most-cited papers

Stable sets of maximal size in Kneser-type graphs
B. Larose, C. Malvenuto
2004European journal of combinatorics (Print)160 citations Open access
Semantic Scholar
A Characterisation of First-Order Constraint Satisfaction Problems
B. Larose, C. Loten, Claude Tardif
2006Logic in Computer Science107 citations Open access
Semantic Scholar
Bounded width problems and algebras
B. Larose, L. Zádori
2007100 citations
Semantic Scholar
Universal algebra and hardness results for constraint satisfaction problems
B. Larose, Pascal Tesson
2007Theoretical Computer Science96 citations Open access
Semantic Scholar
Dualities for Constraint Satisfaction Problems
A. Bulatov, A. Krokhin, B. Larose
2008Complexity of Constraints75 citations Open access
Semantic Scholar
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras
B. Larose, L. Zádori
2006International journal of algebra and computation52 citations
Semantic Scholar
Asking the Metaquestions in Constraint Tractability
Hubie Chen, B. Larose
2016TOCT43 citations Open access
Semantic Scholar
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
László Egri, B. Larose, Pascal Tesson
2007Logic in Computer Science41 citations
Semantic Scholar
Projectivity and independent sets in powers of graphs
B. Larose, Claude Tardif
2002Journal of Graph Theory39 citations
Semantic Scholar
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
A. Krokhin, B. Larose
2008SIAM Journal on Discrete Mathematics36 citations Open access
Semantic Scholar
The Complexity of the Extendibility Problem for Finite Posets
B. Larose, L. Zádori
2003SIAM Journal on Discrete Mathematics32 citations Open access
Semantic Scholar
On Normal Cayley Graphs and Hom-idempotent Graphs
B. Larose, F. Laviolette, Claude Tardif
1998European journal of combinatorics (Print)29 citations Open access
Semantic Scholar
The Complexity of the List Homomorphism Problem for Graphs
László Egri, A. Krokhin, B. Larose, Pascal Tesson
2009Theory of Computing Systems26 citations
Semantic Scholar
Algebraic properties and dismantlability of finite posets
B. Larose, L. Zádori
1997Discrete Mathematics26 citations Open access
Semantic Scholar
Omitting Types, Bounded Width and the Ability to Count
B. Larose, M. Valeriote, L. Zádori
2009International journal of algebra and computation22 citations
Semantic Scholar
Finite posets and topological spaces in locally finite varieties
B. Larose, L. Zádori
200522 citations
Semantic Scholar
Finite projective ordered sets
B. Larose
199121 citations
Semantic Scholar
Hedetniemi's Conjecture and the Retracts of a Product of Graphs
B. Larose, Claude Tardif
2000Comb.20 citations
Semantic Scholar
Space complexity of list H-colouring: a dichotomy
László Egri, P. Hell, B. Larose, A. Rafiey
2013ACM-SIAM Symposium on Discrete Algorithms18 citations
Semantic Scholar
A discrete homotopy theory for binary reflexive structures
B. Larose, Claude Tardif
200418 citations Open access
Semantic Scholar
Citation for Published Item: Use Policy First-order Definable Retraction Problems for Posets and Reflexive Graphs *
V. Dalmau, Krokhin, A. Larose, V. Dalmau +2 more
18 citations
Semantic Scholar
A polynomial-time algorithm for near-unanimity graphs
B. Larose, C. Loten, L. Zádori
2005J. Algorithms17 citations Open access
Semantic Scholar
Algebra and the Complexity of Digraph CSPs: a Survey
B. Larose
2017The Constraint Satisfaction Problem15 citations
Semantic Scholar
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy
V. Dalmau, László Egri, P. Hell, B. Larose +1 more
20152015 30th Annual ACM/IEEE Symposium on Logic in Computer Science14 citations
Semantic Scholar
A property of projective ordered sets
B. Larose
1992European journal of combinatorics (Print)14 citations Open access
Semantic Scholar
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case
T. Feder, P. Hell, B. Larose, C. Loten +2 more
2013SIAM Journal on Discrete Mathematics13 citations Open access
Semantic Scholar
Maximum Constraint Satisfaction on Diamonds
A. Krokhin, B. Larose
2005International Conference on Principles and Practice of Constraint Programming12 citations Open access
Semantic Scholar
Surjective H-Colouring over Reflexive Digraphs
B. Larose, Barnaby Martin, D. Paulusma
2017Symposium on Theoretical Aspects of Computer Science11 citations Open access
Semantic Scholar
Families of strongly projective graphs
B. Larose
2002Discussiones Mathematicae Graph Theory11 citations Open access
Semantic Scholar
Dismantlability, Connectedness, and Mixing in Relational Structures
Raimundo Briceño, A. Bulatov, V. Dalmau, B. Larose
2019International Colloquium on Automata, Languages and Programming10 citations Open access
Semantic Scholar
Retractions onto series-parallel posets
V. Dalmau, A. Krokhin, B. Larose
2008Discrete Mathematics8 citations Open access
Semantic Scholar
Minimal automorphic Posets and the Projection Property
B. Larose
1995International journal of algebra and computation8 citations
Semantic Scholar
List-Homomorphism Problems on Graphs and Arc Consistency
B. Larose, A. Lemaître
2012IEEE International Symposium on Multiple-Valued Logic7 citations Open access
Semantic Scholar
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
László Egri, B. Larose, Pascal Tesson
2008International Colloquium on Automata, Languages and Programming7 citations
Semantic Scholar
Solving Order Constraints in Logarithmic Space
A. Krokhin, B. Larose
2003Symposium on Theoretical Aspects of Computer Science7 citations Open access
Semantic Scholar
On the centralizer of the join operation of a finite lattice
B. Larose
19956 citations
Semantic Scholar
A monoidal interval of isotone clones on a finite chain.
A. Krokhin, B. Larose
20025 citations
Semantic Scholar
Surjective polymorphisms of directed reflexive cycles
Isabelle Larivière, B. Larose, D. E. P. Pullas
2022Algebra Universalis4 citations
Semantic Scholar
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case
T. Feder, P. Hell, B. Larose, M. Siggers +1 more
2014SIAM Journal on Discrete Mathematics4 citations Open access
Semantic Scholar
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
Ondřej Klíma, B. Larose, Pascal Tesson
2006International Symposium on Mathematical Foundations of Computer Science4 citations
Semantic Scholar
QCSP on Reflexive Tournaments
B. Larose, Barnaby Martin, P. Markovic, D. Paulusma +2 more
2021Embedded Systems and Applications3 citations Open access
Semantic Scholar
Long range actions, connectedness, and dismantlability in relational structures
Raimundo Briceño, A. Bulatov, V. Dalmau, B. Larose
2019arXiv.org3 citations
Semantic Scholar
Strongly Projective Graphs
B. Larose
2002Canadian Journal of Mathematics - Journal Canadien de Mathematiques3 citations Open access
Semantic Scholar
Some Results on Two Conjectures of Schützenberger
Marc Desgroseilliers, B. Larose, C. Malvenuto, C. Vincent
2010Canadian mathematical bulletin2 citations Open access
Semantic Scholar
A note on supermodular sublattices in finite relatively complemented lattices
A. Krokhin, B. Larose
20082 citations
Semantic Scholar
Colourings of hypergraphs, permutation groups and CSP's
B. Larose, L. Haddad, Alessandro Andretta, K. Kearnes +1 more
20072 citations
Semantic Scholar
NU Polymorphisms on Reflexive Digraphs
B. Larose, M. Siggers
2018SIAM Journal on Discrete Mathematics1 citations
Semantic Scholar
Mailbox¶A Note on minimal varieties generated by order-primal algebras
B. Larose
20031 citations
Semantic Scholar
Notes on Coalition Lattices
G. Czédli, B. Larose, G. Pollák
1999Order1 citations
Semantic Scholar
Maximum stable sets in analogs of Kneser and complete graphs
G. Kun, B. Larose
2009European journal of combinatorics (Print)0 citations Open access
Semantic Scholar