Chapters in Books

1. C.J. Colbourn and D.R. Shier, Computational issues in network reliability, Encyclopedia of Statistics for Quality and Reliability, F. Ruggeri, R.S. Kennet, F.W. Faltin (editors), Wiley, 2008.
2. Y.M. Chee and C.J. Colbourn, Scalable Optimal Test Patterns for Crosstalk-Induced Faults on Deep Submicron Global Interconnects, Coding and Cryptology, Y. Li, S. Ling, H. Niederreiter, H.X. Wang, C.P. Xing, S.Y. Yang (editors), World Scientific, pp. 80-91.
3. C.J. Colbourn, Constructing Perfect Hash Families using a Greedy Algorithm, Coding and Cryptology, Y. Li, S. Ling, H. Niederreiter, H.X. Wang, C.P. Xing, S.Y. Yang (editors), World Scientific, pp. 109-118.
4. chapters in the Handbook of Combinatorial Designs, Second Edition (C.J. Colbourn and J.H. Dinitz, editors), CRC Press, 2007:

   Sect	Title	Authors	Pages
   I.1	Opening the Door	Charles J. Colbourn	3-10
   I.2	Design Theory: Antiquity to 1950	Ian Anderson, Charles J. Colbourn, Jeffrey H. Dinitz, Terry S. Griggs	11-22
   II.2	Triple Systems	Charles J. Colbourn	58-70
   II.5	Steiner Systems	Charles J. Colbourn, Rudolf Mathon	101-109
   III.1	Latin Squares	Charles J. Colbourn, Jeffrey H. Dinitz, Ian M. Wanless	135-152
   III.3	Mutually Orthogonal Latin Squares (MOLS)	R. Julian R. Abel, Charles J. Colbo urn, Jeffrey H. Dinitz	160-192
   III.4	Incomplete MOLS	R. Julian R. Abel, Charles J. Colbourn, Jeffrey H. Dinitz	193-210
   III.6	Orthogonal Arrays of Index More Than One	Malcolm Greig, Charles J. Colbourn	219-223
   III.7	Orthogonal Arrays of Strength More Than Two	Charles J. Colbourn	224- 228
   VI.10	Covering Arrays	Charles J. Colbourn	361-365
   VI.17	Difference Matrices	Charles J. Colbourn	410-417
   VI.43	Perfect Hash Families	Robert A. Walker II, Charles J. Colbourn	565-5 68
   VI.56	Superimposed Codes and Combinatorial Group Testing	Charles J. Colbourn, Frank K. Hwang	628-632
   VI.65	Youden Squares and Generalized Youden Designs	Donald A. Preece, Charles J. Colbourn	668-674

5. C.J. Colbourn and G. Xue, ``Grade of Service Steiner Trees in Series-Parallel Networks'', Advances in Steiner Trees (D.Z. Du, J.M. Smith, J.H. Rubinstein; eds.) Kluwer Academic Press, 2000, pp. 163-174.
6. C.J. Colbourn, ``Reliability issues in telecommunications network planning'', in: Telecommunications Network Planning (B. Sans\'o, ed.) Kluwer Academic Press, 1999, pp. 135-146.
7. chapters in the CRC Handbook of Discrete and Combinatorial Mathematics (K. Rosen et al., editors), CRC Press, 2000:

   Sect	Authors	Title	Pages
   8.1	C.J. Colbourn, J.H. Dinitz	Block Designs	754-770
   8.2	C.J. Colbourn, J.H. Dinitz	Symmetric Designs and Finite Geometries	770-778
   8.3	C.J. Colbourn, J.H. Dinitz	Latin Squares and Orthogonal Arrays	778-786

8. C.J. Colbourn, J.H. Dinitz and D.R. Stinson, ``Applications of Combinatorial Designs to Communications, Cryptography, and Networking'', Surveys in Combinatorics 1999 (J.D. Lamb and D.A. Preece, eds.), Cambridge University Press, pp. 37-100.
9. A.C.H. Ling and C.J. Colbourn, ``Rosa triple systems'', in: Geometry, Combinatorial Designs and Related Structures (J.W.P. Hirschfeld, S.S. Magliveras, M.J. de Resmini; editors) Cambridge University Press, 1997, pp. 149-159.
10. C.J. Colbourn and J.H. Dinitz, N($n$) and $\nu(n)$: similarities and differences, in Combinatorics, Complexity and Logic (D.S. Bridges, et al, eds.), Springer, 1996, pp. 35-46.
11. chapters in the CRC Handbook of Combinatorial Designs (C.J. Colbourn and J.H. Dinitz, editors), CRC Press, 1996:

    Sect	Authors	Title	Pages
    I.4	C.J. Colbourn, R. Mathon	Steiner Systems	66-75
    II.1	C.J. Colbourn, J.H. Dinitz	Latin Squares	97-110
    II.2	R.J.R. Abel, A.E. Brouwer, C.J. Colbourn, J.H. Dinitz	Mutually Orthogonal Latin Squares (MOLS)	111-142
    II.3	R.J.R. Abel, C.J. Colbourn, J.H. Dinitz	Incomplete MOLS	142-172
    II.4	C.J. Colbourn	Orthogonal Arrays of Index More Than One	172-178
    II.5	J. Bierbrauer, C.J. Colbourn	Orthogonal Arrays of Strength More Two	179-182
    IV.11	C.J. Colbourn, W. de Launey	Difference Matrices	287-297
    IV.14	C.J. Colbourn	Difference Triangle Sets	312-317
    IV.47	C.J. Colbourn	(t,m,s)-Nets in Base b	478-480
    IV.54	C.J. Colbourn	Youden Designs, Generalized	508-514
    V.2	C.J. Colbourn	Computer Science: Selected Applications	543-549
    V.6	C.J. Colbourn	Group Testing	564-565
    V.8	C.J. Colbourn	Winning the Lottery	578-584

12. C.J. Colbourn and J.H. Dinitz, ``Making the MOLS table'', in: Computational and Constructive Design Theory (W.D.Wallis, ed.) Kluwer Academic Press, 1996, 67-134.
13. C.J. Colbourn, ``Construction techniques for mutually orthogonal latin squares'', in: Combinatorics Advances (C.J. Colbourn and E.S. Mahmoodian, eds.) Kluwer Academic Press, 1995, 27-48.
14. C.J. Colbourn and L. Zhu, ``The spectrum of $r$-orthogonal latin squares'', in: Combinatorics Advances (C.J. Colbourn and E.S. Mahmoodian, eds.) Kluwer Academic Press, 1995, 49-75.
15. D.L. Erickson and C.J. Colbourn, ``Conflict-free access to rectangular subarrays of constant perimeter'', Interconnection Networks and Mapping and Scheduling Parallel Computations, ACM/DIMACS, 1995, pp. 105-124..
16. M.O. Ball, C.J. Colbourn and J.S. Provan, ``Network reliability'', Handbook of Operations Research: Network Models, Elsevier North-Holland, 1995, pp. 673-762.
17. D.D. Harms, J.S. Devitt and C.J. Colbourn, ``Networks and reliability in Maple'', Computational Support for Discrete Mathematics (N. Dean and G.E. Shannon, eds.) AMS/DIMACS, 1994, pp. 223-243.
18. D.C. Bigelow and C.J. Colbourn, ``Faithful enclosing of triple systems: a generalization of a theorem of Stern'', in: Graphs, Matrices and Designs (R. Rees, editor) Dekker, 1992, pp. 31-42.
19. J.S. Devitt and C.J. Colbourn, ``On implementing an environment for investigating network reliability'', in: Computer Science and Operations Research: New Developments in their Interfaces, Pergamon Press, 1992, pp. 159-173.
20. C.J. Colbourn and A. Rosa, ``Directed and Mendelsohn triple systems'', Contemporary Design Theory, Chapter 4, 1992, pp. 97-136.
21. A. Rosa and C.J. Colbourn, ``Colorings of block designs'', Contemporary Design Theory, Chapter 10, 1992, pp. 401-430.
22. C.J. Colbourn and E.I. Litvak, ``Bounding network parameters by approximating graphs'', Reliability of Computer and Communications Networks, AMS/ACM, 1991, pp. 91-104.