default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Escamocher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Guillaume Escamocher, Samira Pourkhajouei, Federico Toffano, Paolo Viappiani, Nic Wilson:
Interactive preference elicitation under noisy preference models: An efficient non-Bayesian approach. Int. J. Approx. Reason. 178: 109333 (2025)- 2023
- [j10]Ágnes Cseh, Guillaume Escamocher
, Luis Quesada:
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28(2): 138-165 (2023) - [c13]Andrea Balogh, Guillaume Escamocher, Barry O'Sullivan:
Partial Compilation of SAT Using Selective Backbones. ECAI 2023: 174-181 - 2022
- [j9]Á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): 249-283 (2022) - [j8]Guillaume Escamocher, Barry O'Sullivan:
Regular pattern-free coloring. Discret. Appl. Math. 321: 109-125 (2022) - [c12]Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
Computing Relaxations for the Three-Dimensional Stable Matching Problem with Cyclic Preferences. CP 2022: 16:1-16:19 - [i5]Guillaume Escamocher, Barry O'Sullivan:
Generation and Prediction of Difficult Model Counting Instances. CoRR abs/2212.02893 (2022) - 2021
- [j7]Guillaume Escamocher, Barry O'Sullivan:
Leprechauns on the chessboard. Discret. Math. 344(5): 112316 (2021) - [c11]Á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: 22:1-22:19 - 2020
- [j6]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): 2060007:1-2060007:31 (2020) - [j5]Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich:
Generating Difficult CNF Instances in Unexplored Constrainedness Regions. ACM J. Exp. Algorithmics 25: 1-12 (2020)
2010 – 2019
- 2019
- [i4]Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich:
Generating Difficult SAT Instances by Preventing Triangles. CoRR abs/1903.03592 (2019) - [i3]Guillaume Escamocher, Barry O'Sullivan:
Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior. CoRR abs/1910.06636 (2019) - 2018
- [j4]Guillaume Escamocher, Barry O'Sullivan:
Pushing the frontier of minimality. Theor. Comput. Sci. 745: 172-201 (2018) - [c10]Guillaume Escamocher, Barry O'Sullivan:
Three-Dimensional Matching Instances Are Rich in Stable Matchings. CPAIOR 2018: 182-197 - [c9]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: 198-214 - [c8]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: 114-121 - [c7]Guillaume Escamocher, Barry O'Sullivan:
Constrainedness in Stable Matching. ICTAI 2018: 710-717 - 2016
- [j3]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: 196-218 (2016) - 2015
- [j2]Martin C. Cooper, Guillaume Escamocher:
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. Discret. Appl. Math. 184: 89-113 (2015) - [j1]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): 1127-1143 (2015) - [c6]Guillaume Escamocher, Barry O'Sullivan:
On the Minimal Constraint Satisfaction Problem: Complexity and Generation. COCOA 2015: 731-745 - [c5]Martin C. Cooper, Aymeric Duchein, Guillaume Escamocher:
Broken Triangles Revisited. CP 2015: 58-73 - [i2]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable and value elimination in binary constraint satisfaction via forbidden patterns. CoRR abs/1502.03796 (2015) - 2013
- [c4]David A. Cohen, Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
Variable Elimination in Binary CSP via Forbidden Patterns. IJCAI 2013: 517-523 - 2012
- [c3]Martin C. Cooper, Guillaume Escamocher:
A Dichotomy for 2-Constraint Forbidden CSP Patterns. AAAI 2012: 464-470 - [c2]Martin C. Cooper, Guillaume Escamocher, Stanislav Zivný:
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. CP 2012: 265-273 - [i1]Martin C. Cooper, Guillaume Escamocher:
A Dichotomy for 2-Constraint Forbidden CSP Patterns. CoRR abs/1201.3868 (2012)
2000 – 2009
- 2009
- [c1]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: 1227-1228
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
