 | 2009 |
|---|
| 27 |       | Gábor Kun,
Benoit Larose:
Maximum stable sets in analogs of Kneser and complete graphs.
Eur. J. Comb. 30(1): 17-29 (2009) |
| 26 | | Benoit Larose,
Matt Valeriote,
László Zádori:
Omitting Types, Bounded Width and the Ability to Count.
IJAC 19(5): 647-668 (2009) |
| 25 | | Benoit Larose,
Pascal Tesson:
Universal algebra and hardness results for constraint satisfaction problems.
Theor. Comput. Sci. 410(18): 1629-1647 (2009) |
| 2008 |
|---|
| 24 | | Andrei A. Bulatov,
Andrei A. Krokhin,
Benoit Larose:
Dualities for Constraint Satisfaction Problems.
Complexity of Constraints 2008: 93-124 |
| 23 | | László Egri,
Benoit Larose,
Pascal Tesson:
Directed st-Connectivity Is Not Expressible in Symmetric Datalog.
ICALP (2) 2008: 172-183 |
| 22 | | Víctor Dalmau,
Benoit Larose:
Maltsev + Datalog --> Symmetric Datalog.
LICS 2008: 297-306 |
| 21 | | Víctor Dalmau,
Andrei A. Krokhin,
Benoit Larose:
Retractions onto series-parallel posets.
Discrete Mathematics 308(11): 2104-2114 (2008) |
| 20 | | Andrei A. Krokhin,
Benoit Larose:
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction.
SIAM J. Discrete Math. 22(1): 312-328 (2008) |
| 2007 |
|---|
| 19 | | Benoit Larose,
Pascal Tesson:
Universal Algebra and Hardness Results for Constraint Satisfaction Problems.
ICALP 2007: 267-278 |
| 18 | | László Egri,
Benoit Larose,
Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace.
LICS 2007: 193-202 |
| 17 | | Benoit Larose,
Cynthia Loten,
Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems
CoRR abs/0707.2562: (2007) |
| 16 | | László Egri,
Benoit Larose,
Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace.
Electronic Colloquium on Computational Complexity (ECCC) 14(024): (2007) |
| 15 | | Benoit Larose,
Pascal Tesson:
Universal Algebra and Hardness Results for Constraint Satisfaction Problems.
Electronic Colloquium on Computational Complexity (ECCC) 14(025): (2007) |
| 14 | | Víctor Dalmau,
Andrei A. Krokhin,
Benoit Larose:
First-order Definable Retraction Problems for Posets and Reflexive Graphs.
J. Log. Comput. 17(1): 31-51 (2007) |
| 13 | | Benoit Larose,
Cynthia Loten,
Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems.
Logical Methods in Computer Science 3(4): (2007) |
| 2006 |
|---|
| 12 | | Benoit Larose,
Cynthia Loten,
Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems.
LICS 2006: 201-210 |
| 11 | | Ondrej Klíma,
Benoit Larose,
Pascal Tesson:
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.
MFCS 2006: 584-595 |
| 10 | | Benoit Larose,
László Zádori:
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.
IJAC 16(3): 563-582 (2006) |
| 2005 |
|---|
| 9 | | Andrei A. Krokhin,
Benoit Larose:
Maximum Constraint Satisfaction on Diamonds.
CP 2005: 388-402 |
| 8 | | Benoit Larose,
Cynthia Loten,
László Zádori:
A polynomial-time algorithm for near-unanimity graphs.
J. Algorithms 55(2): 177-191 (2005) |
| 2004 |
|---|
| 7 | | Víctor Dalmau,
Andrei A. Krokhin,
Benoit Larose:
First-Order Definable Retraction Problems for Posets and Reflexive Graph.
LICS 2004: 232-241 |
| 6 | | Benoit Larose,
Claudia Malvenuto:
Stable sets of maximal size in Kneser-type graphs.
Eur. J. Comb. 25(5): 657-673 (2004) |
| 2003 |
|---|
| 5 | | Andrei A. Krokhin,
Benoit Larose:
Solving Order Constraints in Logarithmic Space.
STACS 2003: 379-390 |
| 4 | | Benoit Larose,
László Zádori:
The Complexity of the Extendibility Problem for Finite Posets.
SIAM J. Discrete Math. 17(1): 114-121 (2003) |
| 2000 |
|---|
| 3 | | Benoit Larose,
Claude Tardif:
Hedetniemi's Conjecture and the Retracts of a Product of Graphs.
Combinatorica 20(4): 531-544 (2000) |
| 1998 |
|---|
| 2 | | Benoit Larose,
François Laviolette,
Claude Tardif:
On Normal Cayley Graphs and Hom-idempotent Graphs.
Eur. J. Comb. 19(7): 867-881 (1998) |
| 1997 |
|---|
| 1 | | Benoit Larose,
László Zádori:
Algebraic properties and dismantlability of finite posets.
Discrete Mathematics 163(1-3): 89-99 (1997) |
