Lectures notes: (currently posted last year's notes; updates in notes and coverage time may occur)

1. Introduction (Lect 1a)
2. Generating elementary combinatorial objects (3.5 weeks) (Lect 1b,2,3,4a)
   Lect 4b: Talk by Aaron Williams on Universal Cycles for Permutations.
3. Backtracking and Branch-and-Bound (2.5 weeks) (Lect 5, Lect 6)
4. Heuristic Search (Lect 7 (Oct 20); 2 weeks)
   
5. Computing Isomorphism (2.5 weeks)
6. Isomorph-free Exhaustive Generation (1.5 week)