Get started
Author

Guillaume Escamocher

Variable and value elimination in binary constraint satisfaction via forbidden patterns
2015 · David A. Cohen, Martin C. Cooper, et al. · Journal of Computer and System Sciences · 24
Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems
2016 · Martin C. Cooper, Aymeric Duchein, et al. · Artificial Intelligence · 19
PDF
A Dichotomy for 2-Constraint Forbidden CSP Patterns
2021 · Martin Cooper, Guillaume Escamocher · Proceedings of the AAAI Conference on Artificial Intelligence · 13
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
2014 · Martin C. Cooper, Guillaume Escamocher · Discrete Applied Mathematics · 13
Variable elimination in binary CSP via forbidden patterns
2026 · David A. Cohen, Martin C. Cooper, et al. · Open Archive Toulouse Archive Ouverte (University of Toulouse) · 11
PDF
Existence and computation of equilibria of first-price auctions with integral valuations and bids
2009 · Guillaume Escamocher, Peter Bro Miltersen, et al. · Adaptive Agents and Multi-Agents Systems · 9
PDF
Three-Dimensional Matching Instances Are Rich in Stable Matchings
2018 · Guillaume Escamocher, Barry O’Sullivan · Lecture notes in computer science · 7
Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior
2019 · Escamocher, Guillaume, O'Sullivan, Barry · arXiv (Cornell University) · 6
PDF
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
2022 · Ágnes Cseh, Guillaume Escamocher, et al. · Constraints · 4
PDF
Generating Difficult CNF Instances in Unexplored Constrainedness Regions
2020 · Guillaume Escamocher, Barry O'Sullivan, et al. · ACM Journal of Experimental Algorithmics · 4
PDF
Forbidden patterns in constraint satisfaction problems
2014 · Guillaume Escamocher · Thèses en ligne de l'Université Toulouse III (Université Toulouse III) · 4
PDF
Interactive preference elicitation under noisy preference models: An efficient non-Bayesian approach
2024 · Guillaume Escamocher, Samira Pourkhajouei, et al. · International Journal of Approximate Reasoning · 3
Generation and Prediction of Difficult Model Counting Instances
2022 · Escamocher, Guillaume, O'Sullivan, Barry · arXiv (Cornell University) · 3
PDF
On the Minimal Constraint Satisfaction Problem: Complexity and Generation
2015 · Guillaume Escamocher, Barry O’Sullivan · Lecture notes in computer science · 3
A Dichotomy for 2-Constraint Forbidden CSP Patterns
2021 · Cooper, Martin, Escamocher, Guillaume · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · 2
PDF
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
2018 · Mark Antunes, Armant Vincent, et al. · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · 2
PDF
Broken Triangles Revisited
2015 · Martin C. Cooper, Aymeric Duchein, et al. · Lecture notes in computer science · 2
Partial Compilation of SAT Using Selective Backbones
2023 · Andrea Balogh, Guillaume Escamocher, et al. · Frontiers in artificial intelligence and applications · 1
PDF
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
2023 · Ágnes Cseh, Guillaume Escamocher, et al. · Constraints · 1
PDF
Leprechauns on the chessboard
2021 · Guillaume Escamocher, Barry O’Sullivan · Discrete Mathematics · 1
PDF
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences
2021 · Cseh, Ágnes, Escamocher, Guillaume, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 1
PDF
Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
2020 · Mark Antunes, Vincent Armant, et al. · International Journal of Artificial Intelligence Tools · 1
Pushing the frontier of minimality
2018 · Guillaume Escamocher, Barry O'Sullivan · Theoretical Computer Science · 1
PDF
From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP
2018 · Guillaume Escamocher, Mohamed Siala, et al. · Lecture notes in computer science · 1
A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP
2012 · Martin C. Cooper, Guillaume Escamocher, et al. · Lecture notes in computer science · 1
Works count: 39
Citation count: 137
H-index: 7
I10-index: 5
Year
Topic
Type