| 2026 | CPAIOR | Computing Minimax Regret by Bounding the Weight Space From Within and Without. | Guillaume Escamocher, Paolo Viappiani, Nic Wilson |
| 2025 | CPAIOR | Determining the Most Promising Selective Backbone Size for Partial Knowledge Compilation. | Andrea Balogh, Guillaume Escamocher, Barry O'Sullivan |
| 2023 | ECAI | Partial Compilation of SAT Using Selective Backbones. | Andrea Balogh, Guillaume Escamocher, Barry O'Sullivan |
| 2022 | CP | Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. | gnes Cseh, Guillaume Escamocher, Luis Quesada |
| 2021 | CP | A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. | gnes Cseh, Guillaume Escamocher, Begm Gen, Luis Quesada |
| 2018 | CPAIOR | From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP. | Guillaume Escamocher, Mohamed Siala, Barry O'Sullivan |
| 2018 | CPAIOR | Three-Dimensional Matching Instances Are Rich in Stable Matchings. | Guillaume Escamocher, Barry O'Sullivan |
| 2018 | ICTAI | Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. | Mark Antunes, Vincent Armant, Kenneth N. Brown, Daniel A. Desmond, Guillaume Escamocher, Anne-Marie George, Diarmuid Grimes, Mike O'Keeffe, Yiqing Lin, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada, Mohamed Siala, Helmut Simonis, Nic Wilson |
| 2018 | ICTAI | Constrainedness in Stable Matching. | Guillaume Escamocher, Barry O'Sullivan |
| 2015 | COCOA | On the Minimal Constraint Satisfaction Problem: Complexity and Generation. | Guillaume Escamocher, Barry O'Sullivan |
| 2015 | CP | Broken Triangles Revisited. | Martin C. Cooper, Aymeric Duchein, Guillaume Escamocher |
| 2013 | IJCAI | Variable Elimination in Binary CSP via Forbidden Patterns. | David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivn |
| 2012 | AAAI | A Dichotomy for 2-Constraint Forbidden CSP Patterns. | Martin C. Cooper, Guillaume Escamocher |
| 2012 | CP | A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. | Martin C. Cooper, Guillaume Escamocher, Stanislav Zivn |