Guillaume Escamocher

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 18

Top Topics

Constraint Programming

Top Venues

Discret. Appl. Math.

Publications

Andrea Balogh, Guillaume Escamocher, Barry O'Sullivan
Partial Compilation of SAT Using Selective Backbones. ECAI (2023)
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28 (2) (2023)
Guillaume Escamocher, Barry O'Sullivan
Generation and Prediction of Difficult Model Counting Instances. CoRR (2022)
Ágnes Cseh, Guillaume Escamocher, Luis Quesada
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP (2022)
Guillaume Escamocher, Barry O'Sullivan
Regular pattern-free coloring. Discret. Appl. Math. 321 (2022)
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 27 (3) (2022)
Ágnes Cseh, Guillaume Escamocher, Begüm Genç, Luis Quesada
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP (2021)
Guillaume Escamocher, Barry O'Sullivan
Leprechauns on the chessboard. Discret. Math. 344 (5) (2021)
Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich
Generating Difficult CNF Instances in Unexplored Constrainedness Regions. ACM J. Exp. Algorithmics 25 (2020)
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
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. Int. J. Artif. Intell. Tools 29 (03n04) (2020)
Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich
Generating Difficult SAT Instances by Preventing Triangles. CoRR (2019)
Guillaume Escamocher, Barry O'Sullivan
Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior. CoRR (2019)
Guillaume Escamocher, Barry O'Sullivan
Pushing the frontier of minimality. Theor. Comput. Sci. 745 (2018)
Guillaume Escamocher, Barry O'Sullivan
Three-Dimensional Matching Instances Are Rich in Stable Matchings. CPAIOR (2018)
Guillaume Escamocher, Mohamed Siala, Barry O'Sullivan
From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP. CPAIOR (2018)
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
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting. ICTAI (2018)
Guillaume Escamocher, Barry O'Sullivan
Constrainedness in Stable Matching. ICTAI (2018)
Martin C. Cooper, Aymeric Duchein, Achref El Mouelhi, Guillaume Escamocher, Cyril Terrioux, Bruno Zanuttini
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234 (2016)
Guillaume Escamocher, Barry O'Sullivan
On the Minimal Constraint Satisfaction Problem: Complexity and Generation. COCOA (2015)
David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
Variable and value elimination in binary constraint satisfaction via forbidden patterns. CoRR (2015)
David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
Variable and value elimination in binary constraint satisfaction via forbidden patterns. J. Comput. Syst. Sci. 81 (7) (2015)
Martin C. Cooper, Aymeric Duchein, Guillaume Escamocher
Broken Triangles Revisited. CP (2015)
Martin C. Cooper, Guillaume Escamocher
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. Discret. Appl. Math. 184 (2015)
David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
Variable Elimination in Binary CSP via Forbidden Patterns. IJCAI (2013)
Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. CP (2012)
Martin C. Cooper, Guillaume Escamocher
A Dichotomy for 2-Constraint Forbidden CSP Patterns. AAAI (2012)
Martin C. Cooper, Guillaume Escamocher
A Dichotomy for 2-Constraint Forbidden CSP Patterns CoRR (2012)
Guillaume Escamocher, Peter Bro Miltersen, Rocio Santillan R.
Existence and computation of equilibria of first-price auctions with integral valuations and bids. AAMAS (2) (2009)