Guillaume Escamocher

Available identifiers

Publication	Date of Publication	Type
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences	2023-09-15	Paper
Generating Difficult CNF Instances in Unexplored Constrainedness Regions	2023-05-23	Paper
A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences	2022-09-29	Paper
Regular pattern-free coloring	2022-09-15	Paper
Leprechauns on the chessboard	2021-03-25	Paper
From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP	2018-11-21	Paper
Three-dimensional matching instances are rich in stable matchings	2018-11-21	Paper
Pushing the frontier of minimality	2018-09-24	Paper
Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems	2016-03-08	Paper
On the Minimal Constraint Satisfaction Problem: Complexity and Generation	2016-02-05	Paper
Variable and value elimination in binary constraint satisfaction via forbidden patterns	2015-07-13	Paper
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns	2015-04-28	Paper

This page was built for person: Guillaume Escamocher