| 2018 | STACS | Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. | Lszl Egri, Dniel Marx, Pawel Rzazewski |
| 2016 | ESA | Fixed-Parameter Approximability of Boolean MinCSPs. | douard Bonnet, Lszl Egri, Dniel Marx |
| 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 |
| 2013 | ESA | List H-Coloring a Graph by Removing Few Vertices. | Rajesh Hemant Chitnis, Lszl Egri, Dniel Marx |
| 2011 | CSL | On Constraint Satisfaction Problems below P. | Lszl Egri |
| 2011 | CSR | On Maltsev Digraphs. | Catarina Carvalho, Lszl Egri, Marcel Jackson, Todd Niven |
| 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 |
| 2007 | LICS | Symmetric Datalog and Constraint Satisfaction Problems in Logspace. | Lszl Egri, Benot Larose, Pascal Tesson |