Preface.
1. A Bridge Club Design; W.D. Wallis.
2. The First Time; S. Furino.
3. Computational Methods in Design Theory; R. Mathon.
4. Finding Designs with Genetic Algorithms; D. Ashlock.
5. Making the Mols Table; C.J. Colbourn, J.H. Dinitz.
6. On Writing Isomorphism Programs; W. Kocay.
7. The Nonexistence of 4-(12,6,6) Designs; B.D. McKay, S.P. Radziszowski.
8. BIBDS with k = 6 and lambda = 1.; W.H. Mills.
9. Polyhedral Methods in Design Theory; L. Moura.
10. Another Look at Large Sets of Steiner Triple Systems; M.J. Sharry, A. Penfold Street.
11. (22, 33, 12, 8,4)- BIBD, an Update; G.H.J. van Rees.

Over the last several years, there has been a significant increase in compu­ tational combinatorics. The most widely reported results were, of course, the proof of the Four Color Theorem and the proof that there is no projective plane of parameter 10. Although the computer was essential in both proofs, the only reason for this was the fact that life is short. The computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were just longer. Another important fact to notice is that both problems were theoretical, pure­ mathematical ones. The pursuit of the Four-Color Theorem has led to the development of whole branches of graph theory. The plane of parameter 10 is not an isolated case; its nonexistence is the first (and so far, the only) coun­ terexample to the conjecture that the Bruck-Chowla-Ryser conditions were necessary and sufficient for the existence of a symmetric balanced incomplete block design; the study of this problem has also led to a number of theoretical advances, including investigation of the relationship between codes and designs.