| 1 | -- | 6 | Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On the reification of global constraints |
| 7 | -- | 37 | Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu. On the hardness of solving edge matching puzzles as SAT or CSP problems |
| 38 | -- | 74 | Gianluigi Greco, Francesco Scarcello. Structural tractability of enumerating CSP solutions |
| 75 | -- | 107 | Christian Schulte, Guido Tack. View-based propagator derivation |
| 108 | -- | 140 | Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson. On matrices, automata, and double counting in constraint programming |