1. On the reification of global constraints

   • Nicolas Beldiceanu
   • Mats Carlsson
   • Justin Pearson

   Letter 13 November 2012 Pages: 1 - 6

2. On the hardness of solving edge matching puzzles as SAT or CSP problems

   • Carlos Ansótegui
   • Ramón Béjar
   • Carles Mateu

   OriginalPaper 22 September 2012 Pages: 7 - 37

3. Structural tractability of enumerating CSP solutions

   • Gianluigi Greco
   • Francesco Scarcello

   OriginalPaper 01 November 2012 Pages: 38 - 74

4. View-based propagator derivation

   • Christian Schulte
   • Guido Tack

   OriginalPaper 01 December 2012 Pages: 75 - 107

5. On matrices, automata, and double counting in constraint programming

   • Nicolas Beldiceanu
   • Mats Carlsson
   • Justin Pearson

   OriginalPaper 11 December 2012 Pages: 108 - 140