| 2021 | ESA | QCSP on Reflexive Tournaments. | Benot Larose, Petar Markovic, Barnaby Martin, Danil Paulusma, Siani Smith, Stanislav Zivn |
| 2019 | ICALP | Dismantlability, Connectedness, and Mixing in Relational Structures. | Raimundo Briceo, Andrei A. Bulatov, Vctor Dalmau, Benot Larose |
| 2018 | STACS | Surjective H-Colouring over Reflexive Digraphs. | Benot Larose, Barnaby Martin, Danil Paulusma |
| 2015 | LICS | Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. | Vctor Dalmau, Lszl Egri, Pavol Hell, Benot Larose, Arash Rafiey |
| 2014 | SODA | Space complexity of list | Lszl Egri, Pavol Hell, Benot Larose, Arash Rafiey |
| 2010 | STACS | The Complexity of the List Homomorphism Problem for Graphs. | Lszl Egri, Andrei A. Krokhin, Benot Larose, Pascal Tesson |
| 2008 | ICALP | Directed st-Connectivity Is Not Expressible in Symmetric Datalog. | Lszl Egri, Benot Larose, Pascal Tesson |
| 2008 | LICS | Maltsev + Datalog --> Symmetric Datalog. | Vctor Dalmau, Benot Larose |
| 2007 | ICALP | Universal Algebra and Hardness Results for Constraint Satisfaction Problems. | Benot Larose, Pascal Tesson |
| 2007 | LICS | Symmetric Datalog and Constraint Satisfaction Problems in Logspace. | Lszl Egri, Benot Larose, Pascal Tesson |
| 2006 | LICS | A Characterisation of First-Order Constraint Satisfaction Problems. | Benot Larose, Cynthia Loten, Claude Tardif |
| 2006 | MFCS | Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. | Ondrej Klma, Benot Larose, Pascal Tesson |
| 2005 | CP | Maximum Constraint Satisfaction on Diamonds. | Andrei A. Krokhin, Benot Larose |
| 2004 | LICS | First-Order Definable Retraction Problems for Posets and Reflexive Graph. | Vctor Dalmau, Andrei A. Krokhin, Benot Larose |
| 2003 | STACS | Solving Order Constraints in Logarithmic Space. | Andrei A. Krokhin, Benot Larose |