APES-72-2003: TETRAVEX is NP-complete
Toby Walsh, October 2003.   (Bibtex entry).

APES-71-2003: Why SBDD can be worse than SBDS
Karen Petrie, August 2003.   (Bibtex entry), (pdf).

APES-70-2003: Search Strategies for Optimization: Modelling the SONET Problem
Barbara Smith, August 2003.   (Bibtex entry).

APES-69-2003: Symmetry Breaking Ordering Constraints
Zeynep Kiziltan, April 2003.   (Bibtex entry), (pdf).

APES-68-2003: Encoding Connect-4 using Quantified Boolean Formulae
Ian Gent and Andrew Rowley, July 2003.   (Bibtex entry), (pdf).

APES-67-2003: Constraint Programming in Practice: Scheduling a Rehearsal
Barbara Smith, September 2003.   (Bibtex entry).

APES-66-2003: Super CSPs
Emmanuel Hebrard, Brahim Hnich and Toby Walsh, July 2003.   (Bibtex entry), (pdf).

APES-65-2003: A Framework for Comparing Symmetry Breaking methods
Karen E. Petrie, June 2003.   (Bibtex entry), (pdf).

APES-64-2003: Learning Good Variable Orderings
Paula Sturdy, June 2003.   (Bibtex entry), (pdf).

APES-63-2003: CPPlaner: A Temporal Planning System using Critical Paths
Tien Ba Dinh, and Barbara Smith, July 2003.   (Bibtex entry), (pdf).

APES-62-2003: Watching Clauses in Quantified Boolean Formulae
Andrew G D Rowley, July 2003.   (Bibtex entry), (pdf).

APES-61-2003: NuSBDS: Symmetry Breaking made Easy
Iain McDonald, July 2003.   (Bibtex entry), (pdf).

APES-60-2003: Symmetry Group generation for CSPs
Warwick Harvey, Tom Kelsey, and Karen Petrie, July 2003.   (Bibtex entry), (pdf).

APES-59-2003: Global constraints by composition: lexicographic ordering with sums
Brahim Hnich, Zeynep Kiziltan, and Toby Walsh, April 2003.   (Bibtex entry), (pdf).

APES-58-2003: Using Stochastic Local Search to Solve Quantified Boolean Formulae
Ian P Gent, Holger H Hoos, Andrew G D Rowley and Kevin Smyth, January 2003.   (Bibtex entry), (pdf).

APES-57-2003: Generic SBDD using GAP and ECLiPSe
Ian Gent, Warwick Harvey, Tom Kelsey and Steve Linton, January 2003.   (Bibtex entry), (pdf).

APES-56a-2003: Symmetry Breaking in Graceful Graphs
Karen E. Petrie and Barbara M. Smith, June 2003.   (Bibtex entry)

APES-56-2003: Symmetry Breaking in Graceful Graphs
Karen E. Petrie and Barbara M. Smith, January 2003.   (Bibtex entry)

APES-55-2003: Multiset ordering constraints Alan Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel and Toby Walsh, January 2003.  (pdf).

APES-54-2003: Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques Carmel Domshlak, Francesca Rossi, Brent Venable, and Toby Walsh, January 2003.  (pdf).

APES-53-2003: Scenario Based Stochastic Constraint Programming
Suresh Manandhar, Armagan Tarim, Toby Walsh, January 2003.   (pdf). This paper has been submitted to IJCAI2003.

APES-52-2002: Supertree Construction with Constraint Programming: first steps
Ian P. Gent, Patrick Prosser, Barabra M. Smith, December 2002.   (Bibtex entry), (pdf).

APES-51-2002: Global constraints for lexicographic orderings
Alan Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh, September 2002.   (Bibtex entry), (pdf). This paper has been submitted to the CP2002.

APES-50-2002: Models and Symmetry breaking for `Peaceable Armies of Queens'
Barbara Smith, Karen Petrie and Ian Gent, May 2002.   (Bibtex entry), (pdf). This paper has been submitted to the ECAI2002 workshop on Modelling and Solving Problems with Constraints.

APES-49-2002: Partial Symmetry Breaking
Iain McDonald, Barbara Smith, May 2002.   (Bibtex entry), (pdf). This paper has been submitted to CP2002.

APES-48-2002: Groups and Constraints: Symmetry Breaking During Search
I.P. Gent, W. Harvey, T. Kelsey, May 2002.   (Bibtex entry), (pdf). This paper has been submitted to CP2002.

APES-47-2002: Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems
J.C. Beck, P. Prosser, E. Selensky, March 2002.   (Bibtex entry), (pdf). This paper has been submitted to ICGT02.

APES-46-2002: Solving 2-CNF Quantified Boolean Formulae using Variable Assignment and Propagation
Ian P. Gent and Andrew G. D. Rowley.  (Bibtex entry), (ps) This paper has been submitted to the QBF workshop at SAT-2002.

APES-45-2002: A case study of constraint programming for configuration problems
Kevin McDonald and Patrick Prosser.  (Bibtex entry), (pdf). This paper has been submitted to AIEDAM Special ssue on Configuration.

APES-44-2002: On the Reformulation of Vehicle Routing Problems and Scheduling Problems
J.C. Beck, P. Prosser, E. Selensky, February 2002.   (Bibtex entry), (pdf). This paper has been submitted to SARA2002.

APES-43-2002: Adding resolution to the DPLL procedure for Boolean satisfiability
L. Drake, A.M. Frisch, and T. Walsh, February 2002.   (Bibtex entry), (pdf). This paper has been submitted to SAT-2002.

APES-42-2002: CGRASS: A System for Transforming Constraint Satisfaction Problems
A.M. Frisch, I. Miguel and T. Walsh, January 2002.   (Bibtex entry), (pdf). This paper has been submitted to ECAI-2002.

APES-41-2002: Using Fixpoint Characterisations of LTL for Bounded Model Checking
D. Sheridan, January 2002.   (Bibtex entry), (pdf).

APES-40-2002: An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists
I.P. Gent and P. Prosser, January 2002.   (Bibtex entry), (pdf). This paper has been submitted to ECAI-2002.

APES-39A-2002: Arc Consistency in SAT
I.P. Gent, June 2002.   (Bibtex entry), (pdf). This is an extended version of a paper appearing in ECAI-2002, and replaces an earlier version of this report which is no longer available.

APES-38-2002: A Dual Graph Translation of a Problem in `Life'
B.M. Smith, January 2002.   (Bibtex entry), (pdf). This paper has been submitted to ECAI-2002.

APES-37-2002: The Interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT
T. Walsh, 2002.   (Bibtex entry), (pdf).

APES-36-2001: Matrix Modelling
P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel and T. Walsh, 2001.   (Bibtex entry), (pdf).

APES-35-2001: Finding the Answer by Looking in the Wrong Place
E. Oliveira and Barbara M. Smith, September 2001.   (Bibtex entry) , (pdf).

APES-34-2001: On the Encoding of Constraint Satisfaction Problems with 0/1 variables
Patrick Prosser and Evgeny Selensky , 2001.   (Bibtex entry), (pdf).

APES-33-2001: A Symmetry Breaking Constraint for Indistinguishable Values
I.P. Gent, 2001.   (Bibtex entry), (pdf).

APES-32-2001: Automatic Generation of Implied and Induced Constraints
S. Colton and I. Miguel, 2001.   (Bibtex entry), (pdf).

APES-31-2001: Reducing Symmetry in Matrix Models: SBDS vs. Constraints
B.M. Smith and I.P. Gent, 2001.   (Bibtex entry), (pdf).

APES-30-2001: Symmetry in Matrix Models
P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson and T. Walsh, October 2001.   (Bibtex entry), (pdf).

APES-29-2001: Tightness of Constraint Satisfaction Problems
J. Culberson and T. Walsh, January 2001.   (Bibtex entry), (pdf).

APES-28-2001: Relational Consistencies
T. Walsh, January 2001.   (Bibtex entry), (pdf).

APES-27-2001: Search on High Degree Graphs
T. Walsh, January 2001.   (Bibtex entry), (pdf).

APES-26-2001: Permutation Problems and Channelling Constraints
T. Walsh, January 2001.   (Bibtex entry), (pdf).

APES-25-2001: Benford's Law
I.P. Gent and T. Walsh, January 2001.   (Bibtex entry), (pdf).

APES-24-2001: Backbones in Optimization and Approximation
J. Slaney and T. Walsh, January 2001.   (Bibtex entry), (pdf).