| 2001 | Symmetry Breaking. | Torsten Fahle, Stefan Schamberger, Meinolf Sellmann |
| 2001 | Hybrid Benders Decomposition Algorithms in Constraint Logic Programming. | Andrew Eremin, Mark Wallace |
| 2001 | Collaborative Learning for Constraint Solving. | Susan L. Epstein, Eugene C. Freuder |
| 2001 | Evaluation of Search Heuristics for Embedded System Scheduling Problems. | Cecilia Ekelin, Jan Jonsson |
| 2001 | The Traveling Tournament Problem Description and Benchmarks. | Kelly Easton, George L. Nemhauser, Michael A. Trick |
| 2001 | The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. | Olivier Dubois, Gilles Dequen |
| 2001 | Automatic Generation of Implied Clauses for SAT. | Lyndon Drake |
| 2001 | Constraint-Based Verification of Client-Server Protocols. | Giorgio Delzanno, Tevfik Bultan |
| 2001 | A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. | Rina Dechter, Kalev Kask, Javier Larrosa |
| 2001 | Constraint Generation via Automated Theory Formation. | Simon Colton, Ian Miguel |
| 2001 | Components for State Restoration in Tree Search. | Chiu Wo Choi, Martin Henz, Ka Boon Ng |
| 2001 | Formal Models of Heavy-Tailed Behavior in Combinatorial Search. | Hubie Chen, Carla P. Gomes, Bart Selman |
| 2001 | The Expressive Power of Binary Linear Programming. | Marco Cadoli |
| 2001 | Network Flow Problems in Constraint Programming. | Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun |
| 2001 | Distributed Dynamic Backtracking. | Christian Bessire, Arnold Maestre, Pedro Meseguer |
| 2001 | Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. | Christian Bessire, Assef Chmeiss, Lakhdar Sais |
| 2001 | Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines. | Thierry Benoist, Eric Bourreau, Yves Caseau, Benot Rottembourg |
| 2001 | Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency. | Hachemi Bennaceur, Mohamed-Salah Affane |
| 2001 | Non-overlapping Constraints between Convex Polytopes. | Nicolas Beldiceanu, Qi Guo, Sven Thiel |
| 2001 | Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. | Nicolas Beldiceanu, Mats Carlsson |
| 2001 | Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family. | Nicolas Beldiceanu |
| 2001 | Capturing Structure with Satisfiability. | Ramn Bjar, Alba Cabiscol, Csar Fernndez, Felip Many, Carla P. Gomes |
| 2001 | Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies. | Peter van Beek, Kent D. Wilken |
| 2001 | On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems. | Amy M. Beckwith, Berthe Y. Choueiry |
| 2001 | Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores. | Rolf Backofen, Sebastian Will |