Get started
Author

Benoît Larose

Stable sets of maximal size in Kneser-type graphs
2003 · Benoit Larose, Claudia Malvenuto · European Journal of Combinatorics · 116
PDF
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
2007 · Benoît Larose, Pascal Tesson · Lecture notes in computer science · 94
PDF
Bounded width problems and algebras
2007 · Benoit Larose, László Zádori · Algebra Universalis · 94
A Characterisation of First-Order Constraint Satisfaction Problems
2007 · Benoit Larose, Cynthia Loten, et al. · Logical Methods in Computer Science · 70
PDF
Dualities for Constraint Satisfaction Problems
2008 · Andrei A. Bulatov, Andrei Krokhin, et al. · Lecture notes in computer science · 67
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations Over Finite Algebras
2006 · BENOIT LAROSE, LÁSZLÓ ZÁDORI · International Journal of Algebra and Computation · 45
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
2007 · Laszlo Egri, Benoit Larose, et al. · Proceedings - Symposium on Logic in Computer Science · 34
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
2008 · Andrei Krokhin, Benoit Larose · SIAM Journal on Discrete Mathematics · 33
Asking the Metaquestions in Constraint Tractability
2017 · Hubie Chen, Benoit Larose · ACM Transactions on Computation Theory · 28
PDF
A Characterisation of First-Order Constraint Satisfaction Problems
2006 · B. Larose, C. Loten, et al. · Proceedings - Symposium on Logic in Computer Science · 28
The Complexity of the Extendibility Problem for Finite Posets
2003 · Benoit Larose, László Zádori · SIAM Journal on Discrete Mathematics · 25
The Complexity of the List Homomorphism Problem for Graphs
2011 · László Egri, Andrei Krokhin, et al. · Theory of Computing Systems · 24
Projectivity and independent sets in powers of graphs
2002 · Benoit Larose, Claude Tardif · Journal of Graph Theory · 22
On Normal Cayley Graphs and Hom-idempotent Graphs
1998 · Benoit Larose, François Laviolette, et al. · European Journal of Combinatorics · 22
Algebraic properties and dismantlability of finite posets
1997 · Benoit Larose, László Zádori · Discrete Mathematics · 21
PDF
Omitting Types, Bounded Width and the Ability to Count
2009 · BENOIT LAROSE, MATT VALERIOTE, et al. · International Journal of Algebra and Computation · 20
Maltsev + Datalog --≫ Symmetric Datalog
2008 · Victor Dalmau, Benoit Larose · Proceedings - Symposium on Logic in Computer Science · 18
Hedetniemi's Conjecture and the Retracts of a Product of Graphs
2000 · Benoit Larose, Claude Tardif · COMBINATORICA · 16
Finite posets and topological spaces in locally finite varieties
2005 · Benoit Larose, L�szl� Z�dori · Algebra Universalis · 15
A polynomial-time algorithm for near-unanimity graphs
2004 · Benoit Larose, Cynthia Loten, et al. · Journal of Algorithms · 14
A discrete homotopy theory for binary reflexive structures
2004 · Benoit Larose, Claude Tardif · Advances in Mathematics · 11
Maximum Constraint Satisfaction on Diamonds
2005 · Andrei Krokhin, Benoit Larose · Lecture notes in computer science · 10
Finite projective ordered sets
1991 · Benoit Larose · Order · 10
Dismantlability, connectedness, and mixing in relational structures
2021 · Briceño, Raimundo, Bulatov, Andrei A., et al. · Repositori digital de la UPF (Universitat Pompeu Fabra) · 9
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
2013 · Tomás Feder, Pavol Hell, et al. · SIAM Journal on Discrete Mathematics · 9
Works count: 86
Citation count: 968
H-index: 17
I10-index: 23
Year
Topic
Type