Existence and computation of equilibria of first-price auctions with integral valuations and bids. - Guillaume Escamocher; Peter Bro Miltersen; Rocio Santillan R. (AAMAS (2), 2009)

A Dichotomy for 2-Constraint Forbidden CSP Patterns. - Martin C. Cooper; Guillaume Escamocher (AAAI, 2012)

A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. - Martin C. Cooper; Guillaume Escamocher; Stanislav Zivný (CP, 2012)

Variable Elimination in Binary CSP via Forbidden Patterns. - David A. Cohen; Martin C. Cooper; Guillaume Escamocher; Stanislav Zivný (IJCAI, 2013)

On the Minimal Constraint Satisfaction Problem: Complexity and Generation. - Guillaume Escamocher; Barry O'Sullivan (COCOA, 2015)

Broken Triangles Revisited. - Martin C. Cooper; Aymeric Duchein; Guillaume Escamocher (CP, 2015)

Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. - Martin C. Cooper; Guillaume Escamocher (Discret. Appl. Math., 2015)

Variable and value elimination in binary constraint satisfaction via forbidden patterns. - David A. Cohen; Martin C. Cooper; Guillaume Escamocher; Stanislav Zivný (J. Comput. Syst. Sci., 2015)

Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. - Martin C. Cooper; Aymeric Duchein; Achref El Mouelhi; Guillaume Escamocher; Cyril Terrioux; Bruno Zanuttini (Artif. Intell., 2016)

From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP. - Guillaume Escamocher; Mohamed Siala 002; Barry O'Sullivan (CPAIOR, 2018)

Three-Dimensional Matching Instances Are Rich in Stable Matchings. - Guillaume Escamocher; Barry O'Sullivan (CPAIOR, 2018)

Constrainedness in Stable Matching. - Guillaume Escamocher; Barry O'Sullivan (ICTAI, 2018)

Pushing the frontier of minimality. - Guillaume Escamocher; Barry O'Sullivan (Theor. Comput. Sci., 2018)

Generating Difficult SAT Instances by Preventing Triangles. - Guillaume Escamocher; Barry O'Sullivan; Steven David Prestwich (CoRR, 2019)

Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior. - Guillaume Escamocher; Barry O'Sullivan (CoRR, 2019)

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 001; et al. (Int. J. Artif. Intell. Tools, 2020)

Generating Difficult CNF Instances in Unexplored Constrainedness Regions. - Guillaume Escamocher; Barry O'Sullivan; Steven David Prestwich (ACM J. Exp. Algorithmics, 2020)

Leprechauns on the chessboard. - Guillaume Escamocher; Barry O'Sullivan (Discret. Math., 2021)

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Begüm Genç; Luis Quesada 001 (Constraints An Int. J., 2022)

Generation and Prediction of Difficult Model Counting Instances. - Guillaume Escamocher; Barry O'Sullivan (CoRR, 2022)

Regular pattern-free coloring. - Guillaume Escamocher; Barry O'Sullivan (Discret. Appl. Math., 2022)

Partial Compilation of SAT Using Selective Backbones. - Andrea Balogh; Guillaume Escamocher; Barry O'Sullivan (ECAI, 2023)

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. - Ágnes Cseh; Guillaume Escamocher; Luis Quesada 001 (Constraints An Int. J., 2023)

Determining the Most Promising Selective Backbone Size for Partial Knowledge Compilation. - Andrea Balogh; Guillaume Escamocher; Barry O'Sullivan (CPAIOR (1), 2025)

Interactive preference elicitation under noisy preference models: An efficient non-Bayesian approach. - Guillaume Escamocher; Samira Pourkhajouei; Federico Toffano; Paolo Viappiani; Nic Wilson (Int. J. Approx. Reason., 2025)