Edit My Profile

Integrated Search Menu

Search in:

Charles Colbourn

Profile photo
School of Computing and Augmented Intelligence
Professor
Faculty, TEMPE Campus, Mailcode 8809
Biography: 

Charles Colbourn is a professor of computer science and engineering in the School of Computing and Augmented Intelligence of  in the Ira A. Fulton Schools of Engineering at Arizona State University. He joined ASU in 2001. He previously held faculty positions at the University of Saskatchewan and the University of Waterloo, and was the Dorothean Professor of Computer Science at the University of Vermont. He is co-editor of the CRC "Handbook of Combinatorial Designs" and author of "Triple Systems and The Combinatorics of Network Reliability," both from Oxford University Press. He is editor-in-chief of the Journal of Combinatorial Designs. He has more than 300 refereed journal papers, primarily concerning applications of combinatorial designs in networking, computing, and communications. He is the recipient of the 2003 Euler Medal for Lifetime Achievement in Research.

CV
Binary Data Curriculum Vitae
Education: 
  • Ph.D. Computer Science, University of Toronto 1980
  • M. Mathematics (Computer Science), University of Waterloo 1978
  • B.Sc. Computer Science, University of Toronto 1976
Research Interests: 

My research concentrates on areas in which combinatorics and computer science interact in an elegant way. Two main directions are:

  • combinatorial design theory
    • applications in computer science: erasure correction, error correction, combinatorial cryptography, computational biology.
    • triple systems, block designs, pairwise balanced designs, group-divisible designs, transversal designs, latin squares, orthogonal arrays.
    • algorithms and computational methods; combinatorial search techniques.
    • applications of designs to lotteries.
  • network algorithms and network design
    • network reliability: efficiently computable bounds, combinatorial structure from matroids, polyhedral and shellable complexes; exact algorithms; most probable state methods.
    • network design and analysis: graph algorithms, heuristics, search techniques.
    • network diagnosis and testing.

 

Publications: 

Books

  1. C.J. Colbourn (editor), Algebraic Design Theory and Hadamard Matrices, Springer, 2015. ISBN 9783319177281.
  2. C.J. Colbourn and J.H. Dinitz, Handbook of Combinatorial Designs, Second Edition, Chapman and Hall/CRC, 2007. ISBN-13 978-1584885061.
  3. Charles J. Colbourn and Alexander Rosa, Triple Systems, Oxford University Press, March 1999. ISBN 0 19 853576 7.
  4. C.J. Colbourn and J.H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press, 1996. ISBN: 0-8493-8948-8
  5. C.J. Colbourn and E.S. Mahmoodian (editors), Combinatorics Advances, Kluwer Academic, 1995, ISBN 0-7923-3574-0. The table of contents is available here.
  6. D.D. Harms, M. Kraetzl, C.J. Colbourn, and J.S. Devitt, Network Reliability: Experiments with a Symbolic Algebra Environment, CRC Press, Boca Raton FL, 1995. ISBN 0-8493-3980-4.
  7. C.J. Colbourn, D. Jungnickel and A. Rosa (editors), Designs and Graphs, special volume of Discrete Mathematics, 97 (1991); also Topics in Discrete Mathematics 4 (1991).
  8. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, 1987. ISBN 0-19-504920-9.
  9. C.J. Colbourn and R.A. Mathon (editors), Combinatorial Design Theory, Annals of Discrete Mathematics, North-Holland, volume 34, 1987.
  10. C.J. Colbourn and M.J. Colbourn (editors), Algorithms in Combinatorial Design Theory, Annals of Discrete Mathematics, volume 26, North-Holland, 1985.

Journal Papers

  • Darryn Bryant, Charles J. Colbourn, Daniel Horsley, and Ian M. Wanless, Steiner triple systems with high chromatic index, SIAM Journal on Discrete Mathematics, to appear (acc Jul17).
  • Charles J. Colbourn, Erin Lanus, and Kaushik Sarkar, Asymptotic and constructive methods for covering perfect hash families and covering arrays, Designs, Codes and Cryptography, to appear (acc May17).
  • Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, and Ugo Vaccaro, Partial Covering Arrays: Algorithms and Asymptotics, Theory of Computing Systems, to appear (acc May17).

    2017

  • Jonathan Lutz, Charles J. Colbourn, and Violet R. Syrotiuk, Variable-Weight Topology-Transparent Scheduling, Computer Networks 122 (2017), 16-28.
  • Darryn Bryant, Charles J. Colbourn, Daniel Horsley, and Padraig Ò Cathàin, Compressed sensing with combinatorial designs: theory and simulations, IEEE Transactions on Information Theory 63 (2017), 4850-4859.
  • Kaushik Sarkar and Charles J. Colbourn, Upper bounds on the size of covering arrays, SIAM Journal on Discrete Mathematics 31 (2017), 1277-1293.

    2016

  • Charles J. Colbourn, Bingli Fan, and Daniel Horsley, Disjoint Spread Systems and Fault Location, SIAM Journal on Discrete Mathematics 30 (2016), 2011-2016.
  • Charles J. Colbourn and Bingli Fan, Locating One Pairwise Interaction: Three Recursive Constructions, Journal of Algebra Combinatorics Discrete Structures and Applications 3 (2016) 125-134.
  • Charles J. Colbourn, Melissa S. Keranen, and Donald L. Kreher, The 3-GDDS of type $g^3 u^2$, Journal of Algebra Combinatorics Discrete Structures and Applications 3 (2016), 135-144.
  • Hengjia Wei, Gennian Ge, and Charles J. Colbourn, The existence of well balanced triple systems, Journal of Combinatorial Designs 24 (2016), 53-100.
  • Maria de Lourdes Merlini Giuliani, Giliard Souza dos Anjos, and Charles J. Colbourn, Steiner loops satisfying the statement of Moufang's theorem, Quasigroups Related Systems 24 (2016) 103-108.

    2015

  • Shi-Wei Gao, Jiang-Hun Lv, Bing-Lei Du, Charles J. Colbourn, and Shi-Long Ma, Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm, Journal of Computer Science and Technology 12 (2015), 957-968.
  • C.J. Colbourn, M. De Lourdes Merlini Giuliani, A. Rosa, and I. Stuhl, Steiner Loops Satisfying Moufang's Theorem, Australasian Journal of Combinatorics 61 (2015), 161-171.
  • Y.M. Chee, C.J. Colbourn, A.C.H. Ling, H. Zhang, and X. Zhang, Optimal Low-Power Coding for Error Correction and Crosstalk Avoidance in On-Chip Data Buses, Designs Codes Cryptography 77 (2015), 479-491.
  • H. Wu, C. Nie, F.-C. Kuo, H. Leung, and C.J. Colbourn, A Discrete Particle Swarm Optimization for Covering Array Generation, IEEE Transactions on Evolutionary Computation 19,4 (2015), 575-591.
  • C.J. Colbourn, Augmentation of Covering Arrays of Strength Two, Graphs and Combinatorics 31 (2015), 2137-2147.
  • C. Nie, H. Wu, X. Niu, F.-C. Kuo, H. Leung, and C.J. Colbourn, Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures, Information and Software Technology 62 (2015), 198-213.
  • A.N. Aldaco, C.J. Colbourn, and V.R. Syrotiuk, Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems, Operating Systems Review 49,1 (2015), 31-40.

    2014

  • J. Lutz, C.J. Colbourn, and V.R. Syrotiuk, ATLAS: Adaptive Topology- and Load-Aware Scheduling, IEEE Transactions on Mobile Computing 13,10 (2014), 2255-2268.
  • C.J. Colbourn, Conditional expectation algorithms for covering arrays, Journal of Combinatorial Mathematics and Combinatorial Computing 90 (2014), 97-115.
  • C.J. Colbourn, Covering Arrays, Augmentation, and Quilting Arrays, Discrete Mathematics, Algorithms and Applications 6 (2014), #1450034.
  • C.J. Colbourn, M.S. Keranen, and D.L. Kreher, F-Vectors of Pure Complexes and Pure Multicomplexes of Rank Three, Discrete Mathematics 320 (2014), 26-39.

    2013

  • R.C. Bryce and C.J. Colbourn, Expected time to detection of interaction faults, Journal of Combinatorial Mathematics and Combinatorial Computing 86 (2013), 87-110.
  • Y.M. Chee, C.J. Colbourn, D. Horsley, and J. Zhou, Sequence covering arrays, SIAM Journal on Discrete Mathematics 27 (2013), 1844-1861.
  • C.J. Colbourn and J. Torres-Jimenez, Profiles of Covering Arrays of Strength Two, Journal of Algorithms and Computation 44 (2013), 31-59.
  • C. Wang and C.J. Colbourn, The Existence of $(K_2 \times K_6)$-Designs, Graphs and Combinatorics 29 (2013), 1557-1567.
  • R.J.R. Abel, N. Chan, C.J. Colbourn, E.R. Lamken, C. Wang, and J. Wang, Doubly resolvable nearly Kirkman triple systems, Journal of Combinatorial Designs 21 (2013), 342-358.
  • C. J. Colbourn, Resolvable covering arrays, Journal of Statistical Theory and Practice 7 (2013), 630-649.
  • J. Lutz, C.J. Colbourn, and V.R. Syrotiuk, Topological Persistence for Medium Access Control, IEEE Transactions on Mobile Computing 12 (2013), 1598-1612.
  • Y.M. Chee, C.J. Colbourn, A.C.H. Ling, and R.M. Wilson, Covering and packing for pairs, Journal of Combinatorial Theory (A) 120 (2013), 1440-1449.
  • T. Farley, J. Kiefer, P. Lee, D. Von Hoff, J. M. Trent, C. Colbourn, and S. Mousses, The BioIntelligence Framework: a new computational platform for biomedical knowledge computing, Journal of the American Medical Informatics Association 20 (2013), 128-133.
  • P. Nayeri, C.J. Colbourn, and G. Konjevod, Randomized post-optimization of covering arrays, European Journal of Combinatorics 34 (2013), 91-103.

    2012

  • C.J. Colbourn, D. Horsley, and C. Wang, Colouring triples in every way: A conjecture, Quaderni di Matematica 28 (2012), 257-286.
  • C.J. Colbourn, D. Horsley, and C. Wang, Trails of triples in partial triple systems, Designs, Codes and Cryptography 65 (2012), 199-212.
  • C.J. Colbourn, D. Horsley, and V.R. Syrotiuk, Strengthening Hash Families and Compressive Sensing, Journal of Discrete Algorithms 16 (2012), 170-186.
  • C.J. Colbourn and J. Zhou, Improving Two Recursive Constructions for Covering Arrays, Journal of Statistical Theory and Practice 6 (2012) 30-47.
  • Y. Tang, C.J. Colbourn, and J. Yin, Optimality and constructions of locating arrays, Journal of Statistical Theory and Practice 6 (2012) 20-29.
  • J.R. Lobb, C.J. Colbourn, P. Danziger, B. Stevens, and J. Torres-Jimenez, Cover starters for covering arrays of strength two, Discrete Mathematics 312 (2012) 943-956.
  • C.J. Colbourn, A.C.H. Ling, G. Quattrocchi, and V.R. Syrotiuk, Grooming traffic to minimize load, Discrete Mathematics 312 (2012), 536-544.

    2011

  • C.J. Colbourn, Constructing heterogeneous hash families by puncturing linear transversal designs, Journal of Geometry 101 (2011) 99-113.
  • C.J. Colbourn, C. Shi, C. Wang, and J. Yan, Mixed covering arrays of strength three with few factors, Journal of Statistical Planning and Inference 141 (2011), 3640-3647.
  • C.J. Colbourn, D. Horsley, and C. McLean, Compressive sensing matrices and hash families, IEEE Transactions on Communications 59 (2011), 1840-1845.
  • C.J. Colbourn, P. Kaski, P.R.J. Östergård, D.A. Pike, and O. Pottonen, Nearly Kirkman Triple Systems of Order 18 and Hanani Triple Systems of Order 19, Discrete Mathematics 311 (2011), 827-834.
  • C.J. Colbourn, G. Ge, and A.C.H. Ling, Optical grooming with grooming ratio nine, Discrete Mathematics 311 (2011), 8-15.
  • C.J. Colbourn, G. Quattrocchi, and V.R. Syrotiuk, Grooming traffic to maximize throughput in SONET rings, Journal of Optical Communications and Networking 3 (2011), 10-16.

    2010

  • C.J. Colbourn, G. Kéri, P.P. Rivas Soriano, and J.-C. Schlage-Puchta, Covering and Radius-covering Arrays: Constructions and Classification, Discrete Applied Mathematics 158 (2010), 1158-1190.
  • C.J. Colbourn, A.D. Forbes, M.J. Grannell, T.S. Griggs, P. Kaski, P.R.J. Östergård, D.A. Pike, and O. Pottonen, Properties of the Steiner triple systems of order 19, Electronic Journal of Combinatorics 17 (2010), \#R98.
  • J.-C. Bermond, C.J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau, Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4, SIAM Journal on Discrete Mathematics 24 (2010), 400-419.
  • Y. Fujiwara and C.J. Colbourn, A Combinatorial Approach to X-Tolerant Compaction Circuits, IEEE Transactions on Information Theory 56 (2010), 3196-3206.
  • C.J. Colbourn, Covering arrays from cyclotomy, Designs, Codes, and Cryptography 55 (2010), 201-219.

    2009

  • C.J. Colbourn and A.C.H. Ling, A recursive construction for perfect hash families, Journal of Mathematical Cryptology 3 (2009), 291-306.
  • C.J. Colbourn, Distributing Hash Families and Covering Arrays, Journal of Combinatorics, Information, and System Sciences 34 (2009), 113-126.
  • D.S. Hoskins, C.J. Colbourn, and D.C. Montgomery, D-Optimal designs with interaction coverage, Journal of Statistical Theory and Practice 3 (2009), 817-830.
  • C.J. Colbourn, G. Ge, and A.C.H. Ling, Graph designs for the eight-edge five-vertex graphs, Discrete Mathematics 309 (2009), 6440-6445.
  • J.I. Brown, C.J. Colbourn, and R.J. Nowakowski, Chip Firing and All-Terminal Network Reliability Bounds, Discrete Optimization 6 (2009), 436-445.
  • T.R. Farley and C.J. Colbourn, Multiterminal network connectedness on series-parallel networks, Discrete Mathematics, Algorithms, and Applications 1 (2009), 253-265.
  • C.J. Colbourn, G. Ge, and A.C.H. Ling, Optical Grooming with Grooming Ratio Eight, Discrete Applied Mathematics 157 (2009), 2763-2772.
  • A. H. Ronneseth and C. J. Colbourn, Merging Covering Arrays and Compressing Multiple Sequence Alignments, Discrete Applied Mathematics 157 (2009), 2177-2190.
  • C.J. Colbourn and Y. Fujiwara, Small stopping sets in Steiner triple systems, Cryptography and Communications 1 (2009), 31-46.
  • C.J. Colbourn and A.C.H. Ling, Linear Hash Families and Forbidden Configurations, Designs, Codes and Cryptography 59 (2009), 25-55.
  • R.C. Bryce and C.J. Colbourn, A density-based greedy algorithm for higher strength covering arrays, Software Testing, Verification, and Reliability 19 (2009), 37-53.
  • A.C.H. Ling, C.J. Colbourn, and G. Quattrocchi, Minimum embeddings of Steiner triple systems into (K4-e)-designs II, Discrete Mathematics 309 (2009), 400-411.
  • C.J. Colbourn, The Configuration Polytope of $\ell$-Line Configurations in Steiner Triple Systems, Mathematica Slovaca 59 (2009), 77-108.
  • R.A. Walker II and C.J. Colbourn, Tabu search for covering arrays using permutation vectors, Journal of Statistical Planning and Inference 139 (2009), 69-80.

    2008

  • D.S. Hoskins, C.J. Colbourn, and M. Kulahci, Truncated D-Optimal Designs for Screening Experiments, American Journal of Mathematical and Management Sciences 28 (2008), 359-383.
  • C.J. Colbourn, G. Quattrocchi, and V.R. Syrotiuk, Lower Bounds for Two-Period Grooming Via Linear Programming Duality, Networks 58 (2008), 299-306.
  • C.J. Colbourn, G. Quattrocchi, and V.R. Syrotiuk, Grooming for Two-Period Optical Networks, Networks 58 (2008), 307-324.
  • C.J. Colbourn, H.-L. Fu, G. Ge, A.C.H. Ling, and H.-C. Lu, Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio 7, SIAM J. Discrete Mathematics 23 (2008), 109-122.
  • C.J. Colbourn, A.C.H. Ling, and G. Quattrocchi, Minimum embeddings of Steiner triple systems into (K4-e)-designs I, Discrete Mathematics 308 (2008), 5308-5311.
  • C.J. Colbourn and C. Huybrechts, Fully gated graphs: recognition and convex operations, Discrete Mathematics 308 (2008), 5184-5195.
  • M.P. McGarry, M. Reisslein, C.J. Colbourn, M. Maier, F. Aurzada, and M. Scheutzow, Just-in-Time Scheduling for Multichannel EPONs, IEEE/OSA Journal of Lightwave Technology 26,10 (2008), 1204-1216.
  • V.R. Syrotiuk, C.J. Colbourn, and S. Yellamraju, Rateless Forward Error Correction for Topology-Transparent Scheduling, IEEE/ACM Transactions on Networking 16,2 (2008), 464-472.
  • M.B. Cohen, C.J. Colbourn, and A.C.H. Ling, Constructing Strength Three Covering Arrays with Augmented Annealing, Discrete Mathematics 308 (2008), 2709-2722.
  • C.J. Colbourn, Strength two covering arrays: existence tables and projection, Discrete Mathematics 308 (2008), 772-786.
  • P.J. Dukes, C.J. Colbourn, and V.R. Syrotiuk, Directed Complete Bipartite Graph Decompositions: Indirect Constructions, Discrete Mathematics 308 (2008), 367-374.
  • C.J. Colbourn and D.W. McClary, Locating and detecting arrays for interaction faults, Journal of Combinatorial Optimization 15 (2008), 17-48.

    2007

  • T.R. Farley and C.J. Colbourn, Multiterminal Resilience for Series-Parallel Networks, Networks 50 (2007), 164-172.
  • R.C. Bryce and C.J. Colbourn, The density algorithm for pairwise interaction testing, Software Testing, Verification, and Reliability 17 (2007), 159-182.
  • R.C. Bryce, Y. Chen, and C.J. Colbourn, Biased Covering Arrays for Progressive Ranking and Composition of Web Services, International Journal Simulation and Process Modelling 3 (2007), 80-87.
  • V.R. Syrotiuk, Z. Zhang, and C.J. Colbourn, Transport schemes for topology-transparent scheduling, Journal of Combinatorial Optimization 14 (2007), 229-248.
  • C.J. Colbourn, M. Cui, E.L. Lloyd, and V.R. Syrotiuk, A Carrier Sense Multiple Access Protocol with Power Backoff (CSMA/PB), Ad Hoc Networks 5 (2007), 1233-1250.
  • P.J. Dukes, V.R. Syrotiuk, and C.J. Colbourn, Ternary schedules for energy-limited sensor networks, IEEE Transactions on Information Theory 53,8 (2007), 2791-2798.
  • R.A. Walker II and C.J. Colbourn, Perfect hash families: Construction and Existence, Journal of Mathematical Cryptology 1 (2007), 125-150.
  • K. Srinivasan and C.J. Colbourn, Failed disk recovery in double erasure RAID arrays, Journal of Discrete Algorithms 5 (2007), 115-128.
  • C. J. Colbourn and S. Kumar, Lower bounds on multiple sequence alignment using exact 3-way alignment, BMC Bioinformatics 8:140 (2007).

    2006

  • W. Chu, C.J. Colbourn, and V.R. Syrotiuk, The Effects of Synchronization on Topology-Transparent Scheduling, Wireless Networks 12 (2006), 681-690.
  • C.J. Colbourn, S.S. Martirosyan, Tran Van Trung, and R.A. Walker II, Roux-type Constructions for Covering Arrays of Strengths Three and Four, Designs, Codes and Cryptography 41 (2006), 33-57.
  • R.C. Bryce and C.J. Colbourn, Prioritized Interaction Testing for Pairwise Coverage with Seeding and Constraints, Journal of Information Science and Technology 48 (2006), 960-970.
  • G.B. Sherwood, S.S. Martirosyan, and C.J. Colbourn, Covering Arrays of Higher Strength From Permutation Vectors, Journal of Combinatorial Designs 14 (2006), 202-213.
  • W. Chu, C.J. Colbourn, and P. Dukes, On constant composition codes, Discrete Applied Math. 154 (2006), 912-929.
  • C.J. Colbourn, S.S. Martirosyan, G.L. Mullen, D.E. Shasha, G.B. Sherwood, and J.L. Yucas, Products of Mixed Covering Arrays of Strength Two, Journal of Combinatorial Designs 14 (2006), 124-138.
  • W. Chu, C.J. Colbourn, and V.R. Syrotiuk, Slot Synchronized Topology-Transparent Scheduling for Sensor Networks, Computer Communications 29 (2006), 421-428.

    2005

  • J.-C. Bermond, C.J. Colbourn, D. Coudert, G. Ge, A.C.H. Ling, and X. Munoz, Traffic grooming in unidirectional WDM rings with grooming ratio C=6, SIAM Journal on Discrete Mathematics 19 (2005), 523-542.
  • S.S. Martirosyan and C.J. Colbourn, Recursive Constructions for Covering Arrays, Bayreuther Mathematische Schriften 74 (2005), 266-275.
  • C.J. Colbourn and V.R. Syrotiuk, Cover-free families and topology-transparent communication, Bayreuther Mathematische Schriften 74 (2005), 79-99.
  • W. Chu, C.J. Colbourn, and P. Dukes, Tables for constant composition codes, J. Combinatorial Mathematics and Combinatorial Computing 54 (2005), 57--65.
  • C.J. Colbourn, A.C.H. Ling, and G. Quattrocchi, Embedding path designs into kite systems, Discrete Mathematics 297 (2005), 38-48.
  • C.J. Colbourn, D.A. Drake, and W.J. Myrvold, Ovals and hyperovals in nets, Discrete Mathematics 294 (2005), 53-74.
  • W. Chu, C.J. Colbourn, and S.W. Golomb, A recursive construction for regular difference triangle sets, SIAM J. Discrete Mathematics 18 (2005), 741-748.
  • W. Chu and C.J. Colbourn, Optimal Frequency Hopping Sequences via Cyclotomy, IEEE Transactions on Information Theory 51 (2005), 1139-1141.

    2004

  • C.J. Colbourn, Combinatorial aspects of covering arrays, Le Matematiche (Catania) 58 (2004), 121-167.
  • V.R. Syrotiuk, M. Cui, S. Ramkumar, and C.J. Colbourn, Dynamic spectrum utilization in ad hoc networks, Computer Networks 46 (2004), 665-678.
  • W. Chu and C.J. Colbourn, Sequence designs for ultra-wideband impulse radio with optimal correlation properties, IEEE Transactions on Information Theory 50 (2004), 2402-2407.
  • W. Chu and C.J. Colbourn, Recursive Constructions for Optimal $(n,4,2)$-OOCs, Journal of Combinatorial Designs 12 (2004), 333-345.
  • J.-C. Bermond, C.J. Colbourn, A.C.H. Ling, and M.L. Yu, Grooming in unidirectional rings: K_4 - e designs, Discrete Mathematics 284 (2004), 67-72.
  • C.J. Colbourn, T. Klove, and A.C.H. Ling, Permutation arrays for powerline communication and mutually orthogonal Latin squares, IEEE Transactions on Information Theory 50 (2004), 1289-1291.
  • C.J. Colbourn, A.C.H. Ling, and V.R. Syrotiuk, Cover-free families and topology-transparent scheduling in MANETs, Designs, Codes, and Cryptography 32 (2004), 65-95.
  • W. Chu, C.J. Colbourn, and P. Dukes, Constructions for Permutation Codes in Powerline Communications, Designs, Codes, and Cryptography 32 (2004), 51-64.
  • M.B. Cohen and C.J. Colbourn, Ladder orderings of pairs and RAID performance, Discrete Applied Mathematics 138 (2004), 35-46.
  • W. Chu and C.J. Colbourn, Optimal (n,4,2)-OOC of small orders, Discrete Mathematics 279 (2004), 163-172.
  • R.J.R. Abel, C.J. Colbourn, and M. Wojtas, Concerning seven and eight mutually orthogonal latin squares, Journal of Combinatorial Designs 12 (2004), 123-131.

    2003

  • C.J. Colbourn and A. Rosa, Specialized block-colourings of Steiner triple systems and the upper chromatic index, Graphs and Combinatorics 19 (2003), 335-345.
  • C.J. Colbourn, G. Quattrocchi, and A. Rosa, Resolving P(v,3,lambda) designs into regular P3-configurations, Australasian Journal of Combinatorics 27 (2003), 205-212.
  • C.J. Colbourn, A.C.H. Ling, and G. Quattrocchi, Minimum embedding of P3-designs into (K4-e)-designs, Journal of Combinatorial Designs 11 (2003), 352-366.
  • M.B. Cohen and C.J. Colbourn, Optimal and pessimal orderings of Steiner triple systems in disk arrays, Theoretical Computer Science 297 (2003), 103-117.
  • C.J. Colbourn and A.C.H. Ling, Wavelength add-drop multiplexing and minimizing SONET ADMs, Discrete Mathematics 261 (2003) 141-156.

    2002

  • C.J. Colbourn and A.C.H. Ling, Kirkman triple systems of orders 27, 33, and 39, Journal of Combinatorial Mathematics and Combinatorial Computing 43 (2002), 3-8.
  • F. Sagols, L. Riccio, and C.J. Colbourn, Dominated error-correcting codes with distance two, Journal of Combinatorial Designs 10 (2002), 294-302.
  • C.J. Colbourn, E.R. Lamken, A.C.H. Ling, and W.H. Mills, The existence of Kirkman squares -- doubly resolvable (v,3,1)-BIBDs, Designs, Codes and Cryptography 26 (2002), 169-196.
  • C.J. Colbourn, Projective planes and congestion-free networks, Discrete Applied Math. 122 (2002), 117-126.
  • C.J. Colbourn, A.C.H. Ling, and M. Tompa, Construction of optimal quality control for oligo arrays, Bioinformatics 18 (2002), 529-535.
  • F. Sagols and C.J. Colbourn, NS1D0 Sequences and Anti-Pasch Steiner Triple Systems, Ars Combinatoria 62 (2002), 17-31.
  • M.B. Cohen, C.J. Colbourn, L.A. Ives, and A.C.H. Ling, Kirkman triple systems of order 21 with nontrivial automorphism group, Mathematics of Computation 71 (2002) 873-881.
  • C.J. Colbourn, D.L. Kreher, J.P. McSorley, and D.R. Stinson, Orthogonal arrays of strength three from regular 3-wise balanced designs, J. Statistical Planning Inference 100 (2002), 191-195.

    2001

  • N. Alon, C.J. Colbourn, A.C.H. Ling, and M. Tompa, Equireplicate balanced binary codes for oligo arrays, SIAM Journal on Discrete Mathematics 14 (2001), 481-497.
  • C.J. Colbourn, J.H. Dinitz, and D.R. Stinson, Quorum systems constructed from combinatorial designs, Information and Computation 169 (2001), 160-173.
  • C.J. Colbourn and F. Sagols, Triangulations and a generalization of Bose's method, Discrete Mathematics 237 (2001), 97-107.
  • A.C.H. Ling and C.J. Colbourn, (M,S)-optimal designs with block size three, Australasian Journal of Combinatorics 23 (2001), 171-179. There is a supplement which gives small designs needed in this paper.
  • C.J. Colbourn, Minimum Weights of Point Codes of Steiner Triple Systems, Journal of Statistical Planning and Inference 95 (2001), 161-166.
  • C.J. Colbourn and J.H. Dinitz, Mutually orthogonal latin squares: a brief survey of constructions, J. Statistical Planning Inference 95 (2001), 9-48.
  • C.J. Colbourn and P.-J. Wan, Minimizing drop cost for SONET/WDM Networks with 1/8 wavelength requirements, Networks 37 (2001), 107-116.

    2000

  • L. Riccio and C.J. Colbourn, Sharper bounds in adaptive group testing, Taiwanese Journal of Mathematics 4 (2000), 669-673.
  • A.A. Bruen and C.J. Colbourn, Transversal designs in classical planes and spaces, Journal of Combinatorial Theory (A) 92 (2000), 88-94.
  • A.C.H. Ling, C.J. Colbourn, M.J. Grannell, and T.S. Griggs, Construction Techniques for Anti-Pasch Steiner Triple Systems, Journal of the London Mathematical Society (2) 61 (2000), 641-657.
  • C.J. Colbourn and A.C.H. Ling, Quorums from difference covers, Information Processing Letters 75 (2000), 9-12.
  • C.J. Colbourn and J.H. Dinitz, Generating sets in Steiner triple systems, Math. Slovaca 50 (2000), 259-269.
  • C.J. Colbourn and S. Zhao, Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems, Designs, Codes and Cryptography 20 (2000) 219-227.
  • A.C.H. Ling and C.J. Colbourn, Modified group divisible designs with block size four, Discrete Mathematics 219 (2000), 207-221.
  • Y.M. Chee, C.J. Colbourn, and A.C.H. Ling, Asymptotically optimal erasure-resilient codes for large disk arrays, Discrete Applied Mathematics 102 (2000), 3-36.
  • D.S. Archdeacon, C.J. Colbourn, I. Gitler, and J.S. Provan, Four-terminal reducibility and projective-planar wye-delta-wye reducible graphs, Journal of Graph Theory 33 (2000), 83-93.
  • C.J. Colbourn, M.A. Oravas and R.S. Rees, Steiner triple systems with disjoint or intersecting subsystems, Journal of Combinatorial Designs 8 (2000), 58-77.

    1999

  • C.J. Colbourn and A.C.H. Ling, Balanced sampling plans with block size four excluding contiguous units, Australasian Journal of Combinatorics 20 (1999), 37-46.
  • C.J. Colbourn, Group testing for consecutive positives, Annals Combinat. 3 (1999), 37-41.
  • M.A. Chateauneuf, C.J. Colbourn, D.L. Kreher, E.R. Lamken, and D.C. Torney, Pooling, lattice square, and union jack designs, Annals Combinat. 3 (1999), 27-35.
  • C.J. Colbourn, Weakly union-free maximum packings, Annals Combinat. 3 (1999), 43-52.
  • C.J. Colbourn, A Steiner 2-Design with an Automorphism Fixing Exactly r+2 Points, J. Combinatorial Designs 7 (1999), 375-380.
  • C.J. Colbourn and A.C.H. Ling, Kirkman school project designs, Discrete Math. 203 (1999) 49-60.
  • C.J. Colbourn, J.H. Dinitz, and A. Rosa, Bicoloring Steiner triple systems, Electronic Journal of Combinatorics 6 (1999), #R25.
  • M.A. Chateauneuf, C.J. Colbourn, and D.L. Kreher, Covering arrays of strength three, Designs, Codes and Cryptography 16 (1999), 235-242.

    1998

  • R.P. Gallant and C.J. Colbourn, On uncollapsing three factor orthogonal main effect plans, Utilitas Math. 54 (1998), 75-83.
  • F.E. Bennett, C.J. Colbourn, and R.C. Mullin, Quintessential pairwise balanced designs, J. Stat. Plann. Infer. 72 (1998), 15-66.
  • C.J. Colbourn and G. Xue, A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges, Theoretical Computer Science 209 (1998), 331-345.
  • R.P. Gallant and C.J. Colbourn, Asymptotic Existence of Tight Orthogonal Main Effect Plans, Canadian Math. Bull. 41 (1998), 33-40.
  • C.J. Colbourn and P.B. Gibbons, Uniform orthogonal group divisible designs with block size three, New Zealand J. Math. 27 (1998) 15-33. See also the research report version, number 16 in the DMTCS series.
  • R.P. Gallant and C.J. Colbourn, Tight 4-factor orthogonal main effect plans, Discrete Math. 184 (1998) 101-110.
  • C.J. Colbourn and A.C.H. Ling, Point code minimum Steiner triple systems, Designs, Codes and Cryptography 14 (1998), 141-146.
  • C.J. Colbourn and A.C.H. Ling, A class of partial triple systems with applications in survey sampling, Communications in Statistics: Theory and Methods 27 (1998), 1009-1018.
  • Z. Jiang and C.J. Colbourn, Completing the Spectrum of Rotational Mendelsohn Triple Systems, Discrete Math. 183 (1998), 153-160.
  • A.C.H. Ling and C.J. Colbourn, Deleting lines in projective planes, Ars Combinat. 50 (1998), 129-138.
  • C.J. Colbourn and J.X. Yin, On directed incomplete transversal designs with block size five, Ars Combinat. 50 (1998), 215-224.

    1997

  • M.K. Chari and C.J. Colbourn, Reliability polynomials: A survey, Journal of Combinatorics, Information and System Sciences 22 (1997), 177-193.
  • Y.M. Chee, C.J. Colbourn and A.C.H. Ling, Weakly union-free twofold triple systems, Annals of Combinatorics 1 (1997), 215-225.
  • C.J. Colbourn and J.H. Dinitz, Complete arcs in Steiner triple systems, J. Combin. Theory (A) 80 (1997) 320-333.
  • J.X. Yin, A.C.H. Ling, C.J. Colbourn, and R.J.R. Abel, The Existence of Uniform 5-GDDs, J. Combinat. Designs 5 (1997), 275-299.
  • Y.M. Chee and C.J. Colbourn, Constructions for difference triangle sets, IEEE Trans. Information Theory IT-43 (1997), 1346-1349.
  • C.J. Colbourn, L. Haddad, and V. Linek, Balanced Steiner triple systems, J. Combinat. Theory A 78 (1997), 292-302.
  • C.J. Colbourn and G. Nonay, A golf design of order 11, J. Stat. Plann. Infer. 58 (1997), 29-31.
  • H.J. Strayer and C.J. Colbourn, Bounding flow performance in probabilistic weighted networks, IEEE Trans. Reliability R-46 (1997), 3-10.
  • R.J.R. Abel, C.J. Colbourn, J.X. Yin and H. Zhang, Existence of Incomplete Transversal Designs with Block Size Five and Any Index \lambda, Des. Codes Crypt. 10 (1997), 275-307.
  • C.J. Colbourn and A.C.H. Ling, Pairwise balanced designs with block sizes 8, 9 and 10, J. Combinat. Theory (A) 77 (1997), 228-245.
  • Y.M. Chee, C.J. Colbourn, R.P. Gallant, and A.C.H. Ling, On a problem of Hartman and Heinrich concerning pairwise balanced designs with holes, J. Combin. Math. Combin. Comput. 23 (1997), 121-128.
  • C.J. Colbourn, D.R. Stinson and L. Zhu, More frames with block size four, J. Combin. Math. Combin. Comput. 23 (1997), 3-20.
  • A.C.H. Ling, X.J. Zhu, C.J. Colbourn and R.C. Mullin, Pairwise balanced designs with consecutive block sizes, Des. Codes Crypt. 10 (1997), 203-222.
  • V.R. Syrotiuk, C.J. Colbourn and J. Pachl, Wang Tilings and Distributed Verification on Anonymous Torus Networks, Theory of Computing Systems 30 (1997), 145-163.

    1996

  • C.J. Colbourn, Some direct constructions for incomplete transversal designs, J. Stat. Plann. Infer. 56 (1996), 93-104.
  • F.E. Bennett, C.J. Colbourn and L. Zhu, Existence of certain types of three HMOLS, Discrete Math. 160 (1996), 49-65 .
  • J.I. Brown, C.J. Colbourn and D.G. Wagner, Cohen-Macaulay rings in network reliability, SIAM J. Discrete Math. 9 (1996), 377-392.
  • C.J. Colbourn and D.L. Kreher, Concerning difference matrices, Des. Codes Crypt. 9 (1996), 61-70.
  • C.J. Colbourn, J.H. Dinitz and D.R. Stinson, More thwarts in transversal designs, Finite Fields Appl. 2 (1996), 293-303.
  • C.J. Colbourn and Z. Jiang, The spectrum for rotational Steiner triple systems, J. Combinat. Designs 4 (1996), 205-217.
  • C.J. Colbourn, W.J. Myrvold and E. Neufeld, Two algorithms for unranking arborescences, J. Algorithms 20 (1996), 268-281.
  • C.J. Colbourn, Transversal designs with block size eight and nine, Europ. J. Combinat. 17 (1996), 1-14.
  • C.J. Colbourn, L. Haddad and V. Linek, Equitable embeddings of Steiner triple systems, J. Combinat. Theory (A) 73 (1996), 229-247.
  • J.I. Brown and C.J. Colbourn, Non-Stanley bounds for network reliability, J. Algeb. Combinat. 5 (1996), 13-36.

    1995

  • C.J. Colbourn and L Zhu, Existence of six incomplete MOLS, Austral. J. Combin. 12 (1995), 175-191.
  • C.J. Colbourn, J.X. Yin and L. Zhu, Six MOLS of order 76, J. Combin. Math. Combin. Comput. 19 (1995), 207-208.
  • C.J. Colbourn and A. Rosa, Orthogonal resolutions of triple systems, Austral. J. Combin. 12 (1995), 259-269.
  • C.J. Colbourn, J.S. Provan and D. Vertigan, A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs, Discrete Appl. Math. 60 (1995), 119-129.
  • C.J. Colbourn, J.H. Dinitz and M. Wojtas, Thwarts in transversal designs, Des. Codes Crypt. 5 (1995), 189-197.
  • C.J. Colbourn, C.A. Cusack and D.L. Kreher, Partial Steiner triple systems with equal-sized holes, J. Combinat. Theory (A) 70 (1995), 56-65.
  • C.J. Colbourn, J.S. Provan and D. Vertigan, The complexity of computing the Tutte polynomial on transversal matroids, Combinatorica 15 (1995), 1-10.
  • H.J. Strayer and C.J. Colbourn, Consecutive cuts and paths, and bounds on k-terminal reliability, Networks 25 (1995), 165-175.
  • C.J. Colbourn, Four MOLS of order 26, J. Combin. Math. Combin. Comput. 26 (1995), 147-148.

    1994

  • C.J. Colbourn, E. Mendelsohn, A. Rosa and J. Siran, The spectrum of anti-mitre Steiner triple systems, Graphs Combinat. 10 (1994), 215-224.
  • D.D. Harms and C.J. Colbourn, Evaluating performability: most probable states and bounds, Telecomm. Syst. 2 (1994), 275-300.
  • P.L. Check and C.J. Colbourn, A note concerning difference families with block size four, Discrete Math. 133 (1994), 285-289.
  • C.J. Colbourn, P.B. Gibbons, R.A. Mathon, R.C. Mullin and A. Rosa, The spectrum of orthogonal Steiner triple systems, Canad. J. Math. 46 (1994), 239-252.
  • C.J. Colbourn, L.D. Nel, T.B. Boffey and D.F. Yates, Network reliability and the probabilistic estimation of damage from fire spread, Ann. Oper. Res. 50 (1994), 173-185.
  • J.I. Brown and C.J. Colbourn, On the log concavity of reliability and matroidal sequences, Adv. Appl. Math. 15 (1994), 114-127.

    1993

  • M. Kraetzl and C.J. Colbourn, Threshold channel graphs, Combin. Probab. Comput. 2 (1993), 337-349.
  • C.J. Colbourn, Small group divisible designs with block size three, J. Combin. Math. Combin. Comput. 14 (1993), 153-171.
  • C.J. Colbourn, J.S. Devitt, D.D. Harms and M. Kraetzl, Assessing reliability of multistage interconnection networks, IEEE Trans. Comput. C-42 (1993), 1207-1221.
  • C.J. Colbourn, D.D. Harms and W.J. Myrvold, Reliability polynomials can cross twice, J. Franklin Inst. 330 (1993), 629-633.
  • S.A. Vanstone, D.R. Stinson, P.J. Schellenberg, A. Rosa, R. Rees, C.J. Colbourn, M.J. Carter and J.A. Carter, Hanani triple systems, Israel J. Math. 83 (1993), 305-319.
  • D.D. Harms and C.J. Colbourn, Renormalization of two-terminal network reliability, Networks 23 (1993), 289-298.
  • J.I. Brown, C.J. Colbourn and J.S. Devitt, Network transformations and bounding network reliability, Networks 23 (1993), 1-17.
  • C.J. Colbourn, A. Rosa and S. Znam, The spectrum of maximal partial Steiner triple systems, Des. Codes Crypt. 3 (1993), 209-219.
  • M. Kraetzl and C.J. Colbourn, Transformations on channel graphs, IEEE Trans. Commun. 41 (1993), 664-666.
  • C.J. Colbourn and E.S. Elmallah, Reliable assignments of processors to tasks and factoring on matroids, Discrete Math. 114 (1993), 115-129.
  • C.J. Colbourn and E.S. Mahmoodian, Support sizes of sixfold triple systems, Discrete Math. 115 (1993), 103-131.
  • C.J. Colbourn, Analysis and synthesis problems for network resilience, Math. Computer Model. 17 (1993), 43-48.

    1992

  • C.J. Colbourn, E. Mendelsohn, C.E. Praeger and V.D. Tonchev, Concerning multiplier automorphisms of cyclic Steiner triple systems, Des. Codes Crypt. 2 (1992), 237-251.
  • C.J. Colbourn, D.R. Stinson and L. Teirlinck, A parallelization of Miller's n^\log n isomorphism technique, Infor. Proc. Lett. 42 (1992), 223-228.
  • J.I. Brown and C.J. Colbourn, Roots of the reliability polynomial, SIAM J. Discrete Math. 5 (1992), 571-585.
  • E.S. Elmallah and C.J. Colbourn, Series-parallel subgraphs of planar graphs, Networks 22 (1992), 607-614.
  • C.J. Colbourn, S.S. Magliveras and D.R. Stinson, Steiner triple systems of order 19 with nontrivial automorphism group, Math. Comput. 59 (1992), 283-295.
  • C.J. Colbourn and C.C. Lindner, Support sizes of triple systems, J. Combinat. Theory (A) 61 (1992), 193-210.
  • C.J. Colbourn and K.E. Heinrich, Conflict-free access to parallel memories, J. Parallel Distrib. Comput. 14 (1992), 193-200.
  • C.J. Colbourn and R.J. Simpson, A note on bounds on the minimum area of convex lattice polygons, Bull. Austral. Math. Soc. 45 (1992), 237-240.
  • C.J. Colbourn, D.G. Hoffman and C.A. Rodger, Directed star decompositions of the complete directed graph, J. Graph Th. 16 (1992), 517-528.
  • C.J. Colbourn, S.S. Magliveras and R.A. Mathon, Transitive Steiner and Kirkman triple systems of order 27, Math. Comput. 58 (1992), 441-450 and S23-S27.
  • C.J. Colbourn, A. Satyanarayana, C.L. Suffel and K. Sutner, Computing residual node connectedness for restricted classes of graphs, Discrete Appl. Math. 44 (1992), 221-232.
  • C.J. Colbourn, A note on bounding k-terminal reliability, Algorithmica 7 (1992), 303-307.
  • C.J. Colbourn, D.G. Hoffman and R. Rees, A new class of group divisible designs with block size three, J. Combinat. Theory (A) 45 (1992), 73-89.
  • C.J. Colbourn, D.G. Hoffman and C.C. Lindner, Intersections of S(2,4,v), designs, Ars Combinat. 33 (1992), 97-111.

    1991

  • C.J. Colbourn and A. Rosa, Leaves, excesses and neighbourhoods in triple systems, Austral. J. Combin. 4 (1991), 143-178.
  • D.C. Bigelow and C.J. Colbourn, Faithful enclosing of triple systems: doubling the index, Acta Math. Univ. Comen. 60 (1991), 133-151.
  • C.J. Colbourn and M.V. Lomonosov, Renewal networks: connectivity and reachability on a time interval, Prob. Engin. Infor. Sci. 5 (1991), 361-368.
  • C.J. Colbourn, R.A. Mathon and N. Shalaby, The fine structure of threefold triple systems: v \equiv 5 (mod 6), Austral. J. Combin. 3 (1991), 75-92.
  • C.J. Colbourn, Combinatorial aspects of network reliability, Ann. Oper. Res. 33 (1991), 3-15.
  • C.J. Colbourn, D.G. Hoffman, K.T. Phelps, V. Rodl and P.M. Winkler, The number of t-wise balanced designs, Combinatorica 11 (1991), 207-218.
  • C.J. Colbourn, Automorphisms of directed triple systems, Bull. Austral. Math. Soc. 43 (1991), 257-264.
  • C.J. Colbourn, A. Rosa and D.R. Stinson, Pairwise balanced designs with block sizes three and four, Canad. J. Math. 43 (1991), 673-704.
  • C.J. Colbourn, C.C. Lindner and C.A. Rodger, Neighbor designs and m-wheel systems, J. Stat. Plann. Infer. 27 (1991), 335-340.
  • C.J. Colbourn and A. Hartman, Intersections and supports of quadruple systems, Discrete Math. 97 (1991), 119-137.
  • C.J. Colbourn, D.G. Hoffman and C.A. Rodger, Directed star decompositions of complete directed multigraphs, Discrete Math. 97 (1991), 139-148.
  • C.J. Colbourn, J.H. Dinitz and D.R. Stinson, Spanning sets and scattering sets in Steiner triple systems, J. Combinat. Theory (A) 57 (1991), 46-59.
  • C.J. Colbourn, K.T. Phelps, M.J. de Resmini and A. Rosa, Partitioning Steiner triple systems into complete arcs, Discrete Math. 89 (1991), 149-160.
  • C.J. Colbourn, R.A. Mathon, A. Rosa and N. Shalaby, The fine structure of threefold triple systems: v = 1,3 (mod 6), Discrete Math. 92 (1991), 49-64.

    1990

  • C.J. Colbourn and G.F. Royle, Support sizes of (v,4,2), designs, Le Matematiche 65 (1990), 39-59.
  • Y.M. Chee, C.J. Colbourn, S.C. Furino and D.L. Kreher, Large sets of disjoint t-designs, Austral. J. Combin. 2 (1990), 111-119.
  • Y.M. Chee, C.J. Colbourn and D.L. Kreher, Simple t-designs with v \leq 30, Ars Combinat. 29 (1990), 193-258.
  • D.L. Kreher, Y.M. Chee, D. de Caen, C.J. Colbourn and E.S. Kramer, Some new simple t-designs, J. Combin. Math. Combin. Comput. 7 (1990), 53-90.
  • H.M.F. AboElFotoh and C.J. Colbourn, Efficient algorithms for computing the reliability of permutation and interval graphs, Networks 20 (1990), 883-898.
  • C.J. Colbourn, Concerning 3-factorizations of 3K_n,n, Ars Combinat. 30 (1990), 257-274.
  • L.D. Nel and C.J. Colbourn, Combining Monte Carlo estimates and bounds for network reliability, Networks 20 (1990), 277-298.
  • L.D. Nel and C.J. Colbourn, Locating a broadcast facility in an unreliable network, INFOR 28 (1990), 363-379.
  • C.J. Colbourn and A. Rosa, Repeated edges in 2-factorizations, J. Graph Th. 14 (1990), 5-24.
  • C.J. Colbourn and E.S. Mahmoodian, The spectrum of support sizes for threefold triple systems, Discrete Math. 83 (1990), 9-19.
  • E.S. El Mallah and C.J. Colbourn, On two dual classes of planar graphs, Discrete Math. 80 (1990), 21-40.
  • C.J. Colbourn and L.K. Stewart, Permutation graphs: connected domination and Steiner trees, Discrete Math. 86 (1990), 179-189.
  • J.J. Harms and C.J. Colbourn, Probabilistic single processor scheduling, Discrete Appl. Math. 27 (1990), 101-112.
  • B.N. Clark, C.J. Colbourn and D.S. Johnson, Unit disk graphs, Discrete Math. 86 (1990), 165-177.

    1989

  • H.M.F. Abo El Fotoh and C.J. Colbourn, Series-parallel bounds for the two-terminal reliability problem, ORSA J. Comput. 1 (1989), 201-222.
  • H.M.F. Abo El Fotoh and C.J. Colbourn, Computing the two-terminal reliability for radio broadcast networks, IEEE Trans. Reliab. R-38 (1989), 538-555.
  • C.J. Colbourn and S. Milici, Support sizes of triple systems with small index, J. Combin. Math. Combin. Comput. 6 (1989), 155-161.
  • C.J. Colbourn and P.C. van Oorschot, Applications of combinatorial designs in computer science, ACM Comput. Surv. 21 (1989), 223-250.
  • C.J. Colbourn and V. Rodl, Percentages in pairwise balanced designs, Discrete Math. 77 (1989), 57-63.
  • T.B. Brecht and C.J. Colbourn, Multiplicative improvements in network reliability bounds, Networks 19 (1989), 521-530.
  • C.J. Colbourn, R.P.J. Day and L.D. Nel, Unranking and ranking spanning trees of a graph, J. Algorithms 10 (1989), 271-286.
  • C.J. Colbourn, Simple neighbourhoods in triple systems, J. Combinat. Theory (A) 52 (1989), 10-19.
  • C.J. Colbourn, W.R. Pulleyblank and A. Rosa, Hybrid triple systems and cubic feedback sets, Graphs Combinat. 5 (1989), 15-28.
  • C.J. Colbourn and W.R. Pulleyblank, Matroid Steiner Problems, the Tutte Polynomial, and Network Reliability, J. Combinat. Theory (B) 41 (1989), 20-31.

    1988

  • C.J. Colbourn, Repeated edges in 3-factorizations, J. Combin. Math. Combin. Comput. 4 (1988), 133-154.
  • G.L. Chia, C.J. Colbourn and W.J. Myrvold, Graphs determined by their reliability polynomial, Ars Combinat. 26A (1988), 249-251.
  • J.I. Brown and C.J. Colbourn, A set system polynomial with reliability and colouring applications, SIAM J. Discrete Math. 1 (1988), 151-157.
  • C.J. Colbourn and D.R. Stinson, Edge-coloured designs with block size four, Aequat. Math. 36 (1988), 230-245.
  • E.S. El Mallah and C.J. Colbourn, The complexity of some edge-deletion problems, IEEE Trans. Circuits Syst. CAS-35 (1988), 354-362.
  • C.J. Colbourn, Edge-packings of graphs and network reliability, Discrete Math. 72 (1988), 49-61.
  • T.B. Brecht and C.J. Colbourn, Lower bounds for two-terminal network reliability, Discrete Appl. Math. 21 (1988), 185-198.
  • C.J. Colbourn, E. Mendelsohn, and A. Rosa, Extending the concept of decomposability for triple systems, Ann. Discrete Math. 37 (1988), 107-116.
  • C.J. Colbourn and D.D. Harms, Bounding all-terminal reliability in computer networks, Networks 18 (1988), 1-12.
  • C.J. Colbourn, D. Jungnickel, and A. Rosa, The strong chromatic number of partial triple systems, Discrete Appl. Math. 20 (1988), 31-38.

    1987

  • C.J. Colbourn and R.A. Mathon, Leave graphs of small maximal partial triple systems, J. Combin. Math. Combin. Comput. 2 (1987), 13-28.
  • C.J. Colbourn, Leaves, excesses and neighbourhoods, Acta Univ. Carol. (Math. Phys.), 28 (1987), 41-47.
  • C.J. Colbourn and A. Rosa, Quadratic excesses of coverings by triples, Ars Combinat. 24 (1987), 23-30.
  • C.J. Colbourn and J.J. Harms, Partitions into indecomposable triple systems, Ann. Discrete Math. 34 (1987), 107-118.
  • C.J. Colbourn and B.D. McKay, Cubic neighbourhoods in triple systems, Ann. Discrete Math. 34 (1987), 119-136.
  • C.J. Colbourn, D. Curran, and S.A. Vanstone, Recursive constructions for Kirkman squares with block size three, Util. Math. 32 (1987), 169-174.
  • C.J. Colbourn, Network resilience, SIAM J. Alg. Disc. Meth. 8 (1987), 404-409.
  • A. Ramanathan and C.J. Colbourn, Counting almost minimum cutsets with reliability applications, Math. Programming 39 (1987), 253-261.
  • A. Ramanathan and C.J. Colbourn, Bounds for all-terminal reliability by arc-packing, Ars Combinat. 23A (1987), 229-236.
  • C.J. Colbourn, Realizing small leaves of partial triple systems, Ars Combinat. 23A (1987), 91-94.
  • C.J. Colbourn and A. Rosa, Element neighbourhoods in twofold triple systems, J. Geomet. 30 (1987), 36-41.
  • A. Ramesh, M.O. Ball, and C.J. Colbourn, Bounds for all-terminal reliability in planar networks, Ann. Discrete Math. 33 (1987), 261-273.

    1986

  • C.J. Colbourn and A. Rosa, Quadratic leaves of maximal partial triple systems, Graphs Combinat. 2 (1986), 317-337.
  • C.J. Colbourn, Orienting triple systems is NP-complete, Ars Combinat. 22 (1986), 155-163.
  • T.B. Brecht and C.J. Colbourn, Improving reliability bounds in computer networks, Networks 16 (1986), 369-380.
  • B.N. Clark, E.M. Neufeld, and C.J. Colbourn, Maximizing the mean number of communicating vertex pairs in series-parallel networks, IEEE Trans. Reliab. R-35 (1986), 247-251.
  • C.J. Colbourn and R.C. Hamm, Embedding and enclosing partial triple systems with \lambda=3, Ars Combinat. 21 (1986), 111-117.
  • C.J. Colbourn, W.L. Kocay, and D.R. Stinson, Some NP-complete problems for hypergraph degree sequences, Discrete Appl. Math. 14 (1986), 239-254.
  • C.J. Colbourn, The reliability polynomial, Ars Combinat. 21A (1986), 31-58.
  • C.J. Colbourn, R.C. Hamm, C.C. Lindner, and C.A. Rodger, Embedding partial graph designs, block designs, and triple systems with \lambda > 1, Canad. Math. Bull. 29 (1986), 385-391.

    1985

  • C.J. Colbourn and A. Rosa, Maximal partial triple systems of order v \leq 11, Ars Combinat. 20 (1985), 5-28.
  • C.J. Colbourn, J.M. Keil, and L.K. Stewart, Finding minimum dominating cycles in permutation graphs, Oper. Res. Lett. 4 (1985), 13-17.
  • D.D. Harms and C.J. Colbourn, The Leggett bounds for network reliability, IEEE Trans. Circuits Syst. CAS-32 (1985), 609-611.
  • R.D. Cameron, C.J. Colbourn, R.C. Read and N.C. Wormald, Cataloguing the graphs on 10 vertices, J. Graph Th. 9 (1985), 551-562.
  • C.J. Colbourn and W.R. Pulleyblank, Minimizing setups in ordered sets of fixed width, Order 1 (1985), 225-229.
  • C.J. Colbourn and L.K. Stewart, Dominating cycles in series-parallel graphs, Ars Combinat. 19A (1985), 107-112.
  • E.S. El Mallah and C.J. Colbourn, Optimum communication spanning trees in series-parallel graphs, SIAM J. Comput. 14 (1985), 915-925.
  • C.J. Colbourn, M.J. Colbourn, and A. Rosa, Indecomposable 1-factorizations of the complete multigraph, J. Austral. Math. Soc. (A) 39 (1985), 334-343.
  • E.M. Neufeld and C.J. Colbourn, Lucas sequences in subgraph counts of series-parallel and related graphs, Fibonacci Quart. 23 (1985), 330-337.
  • E.M. Neufeld and C.J. Colbourn, The most reliable series-parallel networks, Networks 15 (1985), 27-32.
  • C.J. Colbourn, M.J. Colbourn, and D.R. Stinson, The computational complexity of finding subdesigns in combinatorial designs, Ann. Discrete Math. 26 (1985), 59-66.
  • J.B. Peachey, R.B. Bunt, and C.J. Colbourn, Some empirical observations on program behaviour with applications to program restructuring, IEEE Trans. Software Eng. SE-11 (1985), 188-193.
  • C.J. Colbourn and A. Rosa, Indecomposable triple systems with \lambda=4, Studia Sci. Math. Hung. 20 (1985), 139-144.
  • J.J. Harms and C.J. Colbourn, An optimal algorithm for directing triple systems using Eulerian circuits, Ann. Discrete Math. 27 (1985), 433-438.
  • C.J. Colbourn and M.J. Colbourn, The computational complexity of decomposing block designs, Ann. Discrete Math. 27 (1985), 345-350.

    1984

  • C.J. Colbourn, K.E. Manson, and W.D. Wallis, Frames for twofold triple systems, Ars Combinat. 17 (1984), 69-78.
  • M.J. Colbourn and C.J. Colbourn, Recursive constructions for cyclic block designs, J. Stat. Plann. Infer. 10 (1984), 97-103.
  • C.J. Colbourn, K.T. Phelps, and V. Rodl, Block sizes in pairwise balanced designs, Canad. Math. Bull. 27 (1984), 375-380.
  • C.J. Colbourn, R.C. Hamm, and C.A. Rodger, Small embeddings of partial directed triple systems and of triple systems with even \lambda, J. Combinat. Theory (A) 37 (1984), 363-369.
  • C.J. Colbourn and A.I. Weiss, A census of regular 3-polystroma arising from honeycombs, Discrete Math. 50 (1984), 29-36.
  • C.J. Colbourn, The complexity of completing partial Latin squares, Discrete Appl. Math. 8 (1984), 25-30.

    1983

  • C.J. Colbourn and M.J. Colbourn, Nested triple systems, Ars Combinat. 16 (1983), 27-34.
  • J.J. Harms and C.J. Colbourn, Partitions into directed triple systems, Ars Combinat. 16 (1983), 21-25.
  • J.A. Wald and C.J. Colbourn, Steiner trees in probabilistic networks, Microelect. Reliab. 23 (1983), 837-840.
  • C.J. Colbourn and J.J. Harms, Directing triple systems, Ars Combinat. 15 (1983), 261-266.
  • J.A. Wald and C.J. Colbourn, Steiner trees, partial 2-trees, and minimum IFI networks, Networks 13 (1983), 159-167.
  • C.J. Colbourn, M.J. Colbourn, and A. Rosa, Completing small partial triple systems, Discrete Math. 45 (1983), 165-179.
  • C.J. Colbourn and M.J. Colbourn, Every twofold triple system can be directed, J. Combinat. Theory (A) 34 (1983), 375-378.
  • C.J. Colbourn, Embedding partial Steiner triple systems is NP-complete, J. Combinat. Theory (A) 35 (1983), 100-105.
  • C.J. Colbourn and M.J. Colbourn, Greedy colourings of Steiner triple systems, Ann. Discrete Math. 18 (1983), 201-208.

    1982

  • C.J. Colbourn, Distinct cyclic Steiner triple systems, Util. Math. 22 (1982), 103-126.
  • C.J. Colbourn, Hamiltonian decompositions of complete graphs, Ars Combinat. 14 (1982), 261-269.
  • M.J. Colbourn, C.J. Colbourn, and W.L. Rosenbaum, Trains: an invariant for Steiner triple systems, Ars Combinat. 13 (1982), 149-165.
  • C.J. Colbourn, Computing the chromatic index of Steiner triple systems, Computer J. 25 (1982), 338-339.
  • C.J. Colbourn and M.J. Colbourn, The chromatic index of cyclic Steiner 2-designs, Int. J. Math. Math. Sci. 5 (1982), 823-825.
  • C.J. Colbourn, M.J. Colbourn, K.T. Phelps, and V. Rodl, Coloring block designs is NP-complete, SIAM J. Alg. Disc. Meth. 3 (1982), 305-307.
  • C.J. Colbourn, M.J. Colbourn, K.T. Phelps, and V. Rodl, Colouring Steiner quadruple systems, Discrete Appl. Math. 4 (1982), 103-111.
  • C.J. Colbourn, Farey series and maximal outerplanar graphs, SIAM J. Alg. Disc. Meth. 3 (1982), 187-189.
  • M.J. Colbourn and C.J. Colbourn, The analysis of directed triple systems by refinement, Ann. Discrete Math. 15 (1982), 99-105.
  • C.J. Colbourn and E. Mendelsohn, Kotzig factorizations: existence and computational results, Ann. Discrete Math. 12 (1982), 65-78.

    1981

  • C.J. Colbourn and M.J. Colbourn, Deciding Hadamard equivalence of Hadamard matrices, BIT 21 (1981), 374-376.
  • C.J. Colbourn, On drawings of complete graphs, J. Combin. Inf. Syst. Sci. 6 (1981), 169-172.
  • C.J. Colbourn and M.J. Colbourn, Disjoint cyclic Mendelsohn triple systems, Ars Combinat. 11 (1981), 3-8.
  • M.J. Colbourn and C.J. Colbourn, Concerning the complexity of deciding isomorphism of block designs, Discrete Appl. Math. 3 (1981), 155-162.
  • M.J. Colbourn and C.J. Colbourn, Cyclic block designs with block size 3, Europ. J. Combinat. 2 (1981), 21-26.
  • C.J. Colbourn and K.S. Booth, Linear time automorphism algorithms for trees, interval graphs, and planar graphs, SIAM J. Comput. 10 (1981), 203-225.
  • C.J. Colbourn, On testing isomorphism of permutation graphs, Networks 11 (1981), 13-21.

    1980

  • M.J. Colbourn and C.J. Colbourn, The complexity of combinatorial isomorphism problems, Ann. Discrete Math. 8 (1980), 113-116.
  • C.J. Colbourn and D.G. Corneil, On deciding switching equivalence of graphs, Discrete Appl. Math. 2 (1980), 181-184.
  • C.J. Colbourn and M.J. Colbourn, A recursive construction for infinite families of cyclic SQS, Ars Combinat. 10 (1980), 95-102.
  • C.J. Colbourn and K.T. Phelps, Three new Steiner quadruple systems, Util. Math. 18 (1980), 35-40.
  • C.J. Colbourn and B.D. McKay, A correction to Colbourn's paper on the complexity of matrix symmetrizability, Infor. Proc. Lett. 11,2 (1980), 96-97.
  • C.J. Colbourn and M.J. Colbourn, Combinatorial isomorphism problems involving 1-factorizations, Ars Combinat. 9 (1980), 191-200.
  • M.J. Colbourn and C.J. Colbourn, Cyclic Steiner systems having multiplier automorphisms, Util. Math. 17 (1980), 127-149.
  • M.J. Colbourn and C.J. Colbourn, On cyclic block designs, Math. Reports Acad. Sci. (Canada) 2 (1980), 95-98.

    1979

  • C.J. Colbourn, The complexity of symmetrizing matrices, Infor. Proc. Lett. 9 (1979), 108-109.
  • C.J. Colbourn and R.C. Read, Orderly algorithms for generating restricted classes of graphs, Inter. J. Comput. Math. (A) 7 (1979), 167-172.
  • C.J. Colbourn and R.C. Read, Orderly algorithms for graph generation, J. Graph Th. 3 (1979), 187-195.
  •  
Research Activity: 
Summer 2022
Course NumberCourse Title
CSE 584Internship
APM 792Research
CSE 795Continuing Registration
Spring 2022
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 492Honors Directed Study
CSE 493Honors Thesis
CSE 555Theory of Computation
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Fall 2021
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 492Honors Directed Study
CSE 493Honors Thesis
CSE 499Individualized Instruction
CSE 551Foundations of Algorithms
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Summer 2021
Course NumberCourse Title
CSE 584Internship
APM 792Research
CSE 795Continuing Registration
Spring 2021
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 493Honors Thesis
CSE 551Foundations of Algorithms
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Fall 2020
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 420Computer Architecture I
CSE 492Honors Directed Study
CSE 493Honors Thesis
CSE 499Individualized Instruction
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Summer 2020
Course NumberCourse Title
CSE 584Internship
APM 792Research
CSE 795Continuing Registration
Spring 2020
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 493Honors Thesis
CSE 555Theory of Computation
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Fall 2019
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 492Honors Directed Study
CSE 493Honors Thesis
CSE 499Individualized Instruction
CSE 551Foundations of Algorithms
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Summer 2019
Course NumberCourse Title
APM 792Research
CSE 795Continuing Registration
Spring 2019
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 494Special Topics
CSE 555Theory of Computation
CSE 580Practicum
CSE 590Reading and Conference
CSE 591Seminar
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Fall 2018
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 492Honors Directed Study
CSE 493Honors Thesis
CSE 499Individualized Instruction
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Summer 2018
Course NumberCourse Title
CSE 580Practicum
CSE 584Internship
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
Spring 2018
Course NumberCourse Title
CSE 355Intro Theoretical Computer Sci
CSE 492Honors Directed Study
CSE 551Foundations of Algorithms
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Fall 2017
Course NumberCourse Title
CSE 493Honors Thesis
CSE 499Individualized Instruction
CSE 580Practicum
CSE 590Reading and Conference
CSE 595Continuing Registration
CSE 599Thesis
CSE 790Reading and Conference
APM 792Research
CSE 792Research
CSE 795Continuing Registration
CSE 799Dissertation
Presentations: 
  • Charles J. Colbourn. Distributing hash families and covering arrays. Combinatorics, Canadian Mathematical Society Winter Meeting (Dec 2008).
  • Charles J. Colbourn. Covering arrays and perfect hash families. McMaster University Mathematics and Statistics Colloquium (Nov 2008).
  • Charles J. Colbourn. Linear hash families. Combinatorial Design Theory Workshop, BIRS (Nov 2008).
  • Charles J. Colbourn. Locating Arrays. Suzhou University (China) Mathematics Colloquium (Jun 2008).
  • Charles J. Colbourn. Graph decompositions. Guangxi Normal University (China) Mathematics Colloquium (Jun 2008).
  • Charles J. Colbourn. Covering Arrays. Workshop on Combinatorial Designs, NTU, Singapore (Jun 2008).
  • Charles J. Colbourn. Graph Decompositions and Optical Grooming. Sixth Shanghai Conference on Combinatorics and Coding (May 2008).
  • Charles J. Colbourn. Graph decompositions and optimal grooming. Ottawa-Carleton Graph Theory Workshop, Fields Institute (May 2008).
  • Colbourn, Charles. Locating and Covering Arrays. Applications of Discrete Mathematics (Dec 2007).
  • Colbourn, Charles. Locating Interaction Faults. Miniconference on Discrete Mathematics With An Emphasis on Search Theory (Oct 2007).
  • Colbourn, Charles. Combinatorial Aspects of Network Reliability. DRCN2007, the 6th International Workshop on Design and Reliable Communication Networks (Oct 2007).
  • Colbourn, Charles. Configurations in Steiner triple systems. Design Theory of Alex Rosa (Jul 2007).
  • Colbourn, Charles. Covering Arrays for Interaction Testing. Workshop on Combinatorics (Jun 2007).
  • Colbourn, Charles. Grooming in Optical Networks. Workshop on Combinatorial Designs (Jun 2007).
  • Colbourn, Charles. A Density Algorithm for Perfect Hash Families. International Workshop on Coding and Cyrptography (Jun 2007).
Honors / Awards: 
  • Euler Medal for Lifetime Research Achievement, Institute for Combinatorics and Its Applications, 2003.
  • A.J. Buckingham Scholar, Mathematics and Statistics, Miami University, Oxford OH, 2003.
  • University Scholar in Basic and Applied Sciences, University of Vermont, 1997-98.
  • Instructor of the Year, 1995--96, Faculty of Mathematics, University of Waterloo, awarded by MathSoc, the students' society.

 

Editorships: 
  • Discrete Mathematics, Algorithms, and Applications, Associate Editor (2008 - Present)
  • Journal of Statistical Planning and Inference, Coordinating Editor (2006 - 2015)
  • Journal of Statistical Theory and Practice, Associate Editor (2005 - Present)
  • Journal of Combinatorial Theory (A), Advisory Editor (2004 - 2016)
  • Discrete Mathematics, Associate Editor (2002 - Present)
  • Journal of Combinatorics, Information and System Sciences, Associate Editor (1995 - Present)
  • Designs Codes and Cryptography, Associate Editor (1993 - Present)
  • Journal of Combinatorial Designs, Editor-in-Chief (1991 - Present)
  • Networks, Associate Editor (1986 - Present)
  • International Workshop on Combinatorial Algorithms (IWOCA), Program Committee Member (2007 - Present)
  • International Workshop on Combinatorial Algorithms (IWOCA), Steering Committee Member (2016 - Present)
Professional Associations: 

Institute for Combinatorics and its Applications, Foundation Fellow and Lifetime Member (1991 - Present)

Combinatorial Mathematics Society of Australasia, Lifetime memver (1988 - Present)

 

Graduate Faculties / Mentoring History: 

See c.v.

Work History: 

See c.v,

Service: 

External (for a more complete list, see c.v.)

  • Chair of the Medals Committee, Institute for Combinatorics and its Applications (2016 - Present)
  • Referee/reviewer for approximately 40 journals every year.
  • Book proposal reviewer for 12 publishers
  • Grant reviewer for approximately 5 funding agencies every year

Internal:  see c.v.

Expertise Areas: 
Algorithm Development
Computer Network Optimization
Discrete Mathematics