Computing relaxations for the three-dimensional stable matching problem with cyclic preferences von Cseh, Ágnes, Escamocher, Guillaume, Quesada, Luis

Volltext

A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences von Cseh, Ágnes, Escamocher, Guillaume, Genç, Begüm, Quesada, Luis

Volltext

Pushing the frontier of minimality von Escamocher, Guillaume, O'Sullivan, Barry

Volltext

Regular pattern-free coloring von Escamocher, Guillaume, O’Sullivan, Barry

Volltext

Leprechauns on the chessboard von Escamocher, Guillaume, O’Sullivan, Barry

Volltext

Generating Difficult CNF Instances in Unexplored Constrainedness Regions von Escamocher, Guillaume, O'Sullivan, Barry, Prestwich, Steven David

Volltext

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

Volltext

Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns von Cooper, Martin C., Escamocher, Guillaume

Volltext

Variable and value elimination in binary constraint satisfaction via forbidden patterns von Cohen, David A., Cooper, Martin C., Escamocher, Guillaume, Živný, Stanislav

Volltext

From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP von Escamocher, Guillaume, Siala, Mohamed, O’Sullivan, Barry

Volltext

Three-Dimensional Matching Instances Are Rich in Stable Matchings von Escamocher, Guillaume, O’Sullivan, Barry

Volltext

Generation and Prediction of Difficult Model Counting Instances von Escamocher, Guillaume, O'Sullivan, Barry

Volltext bestellen

On the Minimal Constraint Satisfaction Problem: Complexity and Generation von Escamocher, Guillaume, O’Sullivan, Barry

Volltext

Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior von Escamocher, Guillaume, O'Sullivan, Barry

Volltext bestellen

Generation and Prediction of Difficult Model Counting Instances von Escamocher, Guillaume, O'Sullivan, Barry

Volltext

Broken Triangles Revisited von Cooper, Martin C., Duchein, Aymeric, Escamocher, Guillaume

Volltext

Generating Difficult SAT Instances by Preventing Triangles von Escamocher, Guillaume, O'Sullivan, Barry, Prestwich, Steven David

Volltext bestellen

Solving Logic Grid Puzzles with an Algorithm that Imitates Human Behavior von Escamocher, Guillaume, O'Sullivan, Barry

Volltext

A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP von Cooper, Martin C., Escamocher, Guillaume, Živný, Stanislav

Volltext

Supplementary material for "A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences" von Cseh, Ágnes, Escamocher, Guillaume, Genç, Begüm, Quesada, Luis

Volltext bestellen