Workshop on Search Techniques for Constraint Satisfaction

59 - A Generalized Two-watched-literal Scheme in a mixed Boolean and Non-linear Arithmetic Constraint Solver
Tino Teige, Christian Herde, Martin Fränzle, Natalia Kalinnik, Andreas Eggers

83 - Pruning by Dominance: A Case Study of Best-First Search applied to the Job Shop Scheduling with Makespan Minimization
María Sierra, Ramiro Varela

197 - Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony using Delayed Haplotype Selection
João Marques-Silva, Inês Lynce, Ana Graça, Arlindo Oliveira

189 - Mapping characteristics of instances to Evolutionary Algorithm operators: an empirical study on the basic Job-shop scheduling problem
Pedro Abreu, Carlos Soares

207 - GRASPER: A framework for graph constraint satisfaction problems
Ruben Viegas, Francisco Azevedo