The following pages link to Guillaume Escamocher (Q253985):
Displayed 12 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Three-dimensional matching instances are rich in stable matchings (Q1626726) (← links)
- From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP (Q1626727) (← links)
- Pushing the frontier of minimality (Q1786605) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Leprechauns on the chessboard (Q2659226) (← links)
- On the Minimal Constraint Satisfaction Problem: Complexity and Generation (Q5743544) (← links)
- Generating Difficult CNF Instances in Unexplored Constrainedness Regions (Q6039929) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)