Charles J. Colbourn

Peyman Nayeri, Charles J. Colbourn, Goran Konjevod: Randomized post-optimization of covering arrays. Eur. J. Comb. 34(1): 91-103 (2013)

Toni R. Farley, Jeff Kiefer, Preston Lee, Daniel Von Hoff, Jeffrey M. Trent, Charles J. Colbourn, Spyro Mousses: The BioIntelligence Framework: a new computational platform for biomedical knowledge computing. JAMIA 20(1): 128-133 (2013)

Charles J. Colbourn, Daniel Horsley, Chengmin Wang: Trails of triples in partial triple systems. Des. Codes Cryptography 65(3): 199-212 (2012)

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk: Grooming traffic to minimize load. Discrete Mathematics 312(3): 536-544 (2012)

Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez: Cover starters for covering arrays of strength two. Discrete Mathematics 312(5): 943-956 (2012)

Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk: Strengthening hash families and compressive sensing. J. Discrete Algorithms 16: 170-186 (2012)

Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk: Variable Weight Sequences for Adaptive Scheduled Access in MANETs. SETA 2012: 53-64

Charles J. Colbourn, Gennian Ge, Alan C. H. Ling: Optical grooming with grooming ratio nine. Discrete Mathematics 311(1): 8-15 (2011)

Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen: Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discrete Mathematics 311(10-11): 827-834 (2011)

Charles J. Colbourn, Daniel Horsley, Christopher McLean: Compressive Sensing Matrices and Hash Families. IEEE Transactions on Communications 59(7): 1840-1845 (2011)

Renée C. Bryce, Charles J. Colbourn, D. Richard Kuhn: Finding Interaction Faults Adaptively Using Distance-Based Strategies. ECBS 2011: 4-13

Charles J. Colbourn: Efficient Conditional Expectation Algorithms for Constructing Hash Families. IWOCA 2011: 144-155

Charles J. Colbourn: Covering arrays and hash families. Information Security, Coding Theory and Related Combinatorics 2011: 99-135

Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen: Properties of the Steiner Triple Systems of Order 19. Electr. J. Comb. 17(1) (2010)

Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta: Covering and radius-covering arrays: Constructions and classification. Discrete Applied Mathematics 158(11): 1158-1180 (2010)

Charles J. Colbourn: Covering arrays from cyclotomy. Des. Codes Cryptography 55(2-3): 201-219 (2010)

Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau: Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discrete Math. 24(2): 400-419 (2010)

Yuichiro Fujiwara, Charles J. Colbourn: A combinatorial approach to X-tolerant compaction circuits. IEEE Transactions on Information Theory 56(7): 3196-3206 (2010)

Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk: Apples and oranges: comparing schedule- and contention-based medium access control. MSWiM 2010: 319-326

Charles J. Colbourn, Yuichiro Fujiwara: Small stopping sets in Steiner triple systems. Cryptography and Communications 1(1): 31-46 (2009)

Andreas H. Ronneseth, Charles J. Colbourn: Merging covering arrays and compressing multiple sequence alignments. Discrete Applied Mathematics 157(9): 2177-2190 (2009)

Charles J. Colbourn, Gennian Ge, Alan C. H. Ling: Optical grooming with grooming ratio eight. Discrete Applied Mathematics 157(13): 2763-2772 (2009)

Charles J. Colbourn, Alan C. H. Ling: Linear hash families and forbidden configurations. Des. Codes Cryptography 52(1): 25-55 (2009)

Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski: Chip firing and all-terminal network reliability bounds. Discrete Optimization 6(4): 436-445 (2009)

Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi: Minimum embedding of Steiner triple systems into (K₄-e)-designs II. Discrete Mathematics 309(2): 400-411 (2009)

Charles J. Colbourn, Gennian Ge, Alan C. H. Ling: Graph designs for the eight-edge five-vertex graphs. Discrete Mathematics 309(22): 6440-6445 (2009)

Toni R. Farley, Charles J. Colbourn: Multi-Terminal Network Connectedness on Series-Parallel Networks. Discrete Math., Alg. and Appl. 1(2): 253-266 (2009)

Charles J. Colbourn, Alan C. H. Ling: A recursive construction for perfect hash families. J. Mathematical Cryptology 3(4): 291-306 (2009)

Renée C. Bryce, Charles J. Colbourn: A density-based greedy algorithm for higher strength covering arrays. Softw. Test., Verif. Reliab. 19(1): 37-53 (2009)

Charles J. Colbourn, Gerzson Kéri: Binary Covering Arrays and Existentially Closed Graphs. IWCC 2009: 22-33

Peyman Nayeri, Charles J. Colbourn, Goran Konjevod: Randomized Postoptimization of Covering Arrays. IWOCA 2009: 408-419

Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk: Directed complete bipartite graph decompositions: Indirect constructions. Discrete Mathematics 308(2-3): 367-374 (2008)

Charles J. Colbourn: Strength two covering arrays: Existence tables and projection. Discrete Mathematics 308(5-6): 772-786 (2008)

Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling: Constructing strength three covering arrays with augmented annealing. Discrete Mathematics 308(13): 2709-2722 (2008)

Charles J. Colbourn, Cécile Huybrechts: Fully gated graphs: Recognition and convex operations. Discrete Mathematics 308(22): 5184-5195 (2008)

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi: Minimum embedding of Steiner triple systems into (K₄-e)-designs I. Discrete Mathematics 308(22): 5308-5311 (2008)

Charles J. Colbourn, Daniel W. McClary: Locating and detecting arrays for interaction faults. J. Comb. Optim. 15(1): 17-48 (2008)

Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk: Lower bounds for two-period grooming via linear programming duality. Networks 52(4): 299-306 (2008)

Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk: Grooming for two-period optical networks. Networks 52(4): 307-324 (2008)

Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu: Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. SIAM J. Discrete Math. 23(1): 109-122 (2008)

Violet R. Syrotiuk, Charles J. Colbourn, Sruthi Yellamraju: Rateless forward error correction for topology-transparent scheduling. IEEE/ACM Trans. Netw. 16(2): 464-472 (2008)

Charles J. Colbourn, Minghao Cui, Errol L. Lloyd, Violet R. Syrotiuk: A carrier sense multiple access protocol with power backoff (CSMA/PB). Ad Hoc Networks 5(8): 1233-1250 (2007)

Charles J. Colbourn, Sudhir Kumar: Lower bounds on multiple sequence alignment using exact 3-way alignment. BMC Bioinformatics 8 (2007)

Violet R. Syrotiuk, Zhiqiang Zhang, Charles J. Colbourn: Transport schemes for topology-transparent scheduling. J. Comb. Optim. 14(2-3): 229-248 (2007)

Kaushik Srinivasan, Charles J. Colbourn: Failed disk recovery in double erasure RAID arrays. J. Discrete Algorithms 5(1): 115-128 (2007)

Robert A. Walker, Charles J. Colbourn: Perfect Hash Families: Constructions and Existence. J. Mathematical Cryptology 1(2): 125-150 (2007)

Toni R. Farley, Charles J. Colbourn: Multiterminal resilience for series-parallel networks. Networks 50(2): 164-172 (2007)

Renée C. Bryce, Charles J. Colbourn: The density algorithm for pairwise interaction testing. Softw. Test., Verif. Reliab. 17(3): 159-182 (2007)

Peter Dukes, Violet R. Syrotiuk, Charles J. Colbourn: Ternary Schedules for Energy-Limited Sensor Networks. IEEE Transactions on Information Theory 53(8): 2791-2798 (2007)

Renée C. Bryce, Charles J. Colbourn: One-test-at-a-time heuristic search for interaction test suites. GECCO 2007: 1082-1089

Michael P. McGarry, Martin Reisslein, Charles J. Colbourn, Martin Maier: Just-in-Time Online Scheduling for WDM EPONs. ICC 2007: 2174-2179

Yeow Meng Chee, Charles J. Colbourn: Constructions for Difference Triangle Sets. CoRR abs/0712.2553 (2007)

Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling: Optimal Memoryless Encoding for Low Power Off-Chip Data Buses. CoRR abs/0712.2640 (2007)

Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk: Slot synchronized topology-transparent scheduling for sensor networks. Computer Communications 29(4): 421-428 (2006)

Wensong Chu, Charles J. Colbourn, Peter Dukes: On constant composition codes. Discrete Applied Mathematics 154(6): 912-929 (2006)

Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker: Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptography 41(1): 33-57 (2006)

Charles J. Colbourn, Daniel W. McClary: Detecting and Locating Interaction Faults. Electronic Notes in Discrete Mathematics 27: 17-18 (2006)

Renée C. Bryce, Charles J. Colbourn: Prioritized interaction testing for pair-wise coverage with seeding and constraints. Information & Software Technology 48(10): 960-970 (2006)

Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk: The effects of synchronization on topology-transparent scheduling. Wireless Networks 12(6): 681-690 (2006)

Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling: Optimal memoryless encoding for low power off-chip data buses. ICCAD 2006: 369-374

Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk: Topology-Transparent Schedules for Energy Limited Ad hoc Networks. PerCom Workshops 2006: 85-90

Charles J. Colbourn, David A. Drake, Wendy J. Myrvold: Ovals and hyperovals in nets. Discrete Mathematics 294(1-2): 53-74 (2005)

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi: Embedding path designs into kite systems. Discrete Mathematics 297(1-3): 38-48 (2005)

Wensong Chu, Charles J. Colbourn, Solomon W. Golomb: A Recursive Construction For Regular Difference Triangle Sets. SIAM J. Discrete Math. 18(4): 741-748 (2005)

Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz: Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. SIAM J. Discrete Math. 19(2): 523-542 (2005)

Renée C. Bryce, Charles J. Colbourn: Test prioritization for pairwise interaction coverage. ACM SIGSOFT Software Engineering Notes 30(4): 1-7 (2005)

Wensong Chu, Charles J. Colbourn: Optimal frequency-hopping sequences via cyclotomy. IEEE Transactions on Information Theory 51(3): 1139-1141 (2005)

Renée C. Bryce, Charles J. Colbourn: Test prioritization for pairwise interaction coverage. A-MOST 2005

Renée C. Bryce, Charles J. Colbourn, Myra B. Cohen: A framework of greedy methods for constructing interaction test suites. ICSE 2005: 146-155

Renée C. Bryce, Charles J. Colbourn: Constructing interaction test suites with greedy algorithms. ASE 2005: 440-443

Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai: Progressive Ranking and Composition of Web Services Using Covering Arrays. WORDS 2005: 179-185

Dean S. Hoskins, Charles J. Colbourn, Douglas C. Montgomery: Software performance testing using covering arrays: efficient screening designs with categorical factors. WOSP 2005: 131-136

Violet R. Syrotiuk, Minghao Cui, S. Ramkumar, Charles J. Colbourn: Dynamic spectrum utilization in ad hoc networks. Computer Networks 46(5): 665-678 (2004)

Myra B. Cohen, Charles J. Colbourn: Ladder orderings of pairs and RAID performance. Discrete Applied Mathematics 138(1-2): 35-46 (2004)

Wensong Chu, Charles J. Colbourn, Peter Dukes: Constructions for Permutation Codes in Powerline Communications. Des. Codes Cryptography 32(1-3): 51-64 (2004)

Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk: Cover-Free Families and Topology-Transparent Scheduling for MANETs. Des. Codes Cryptography 32(1-3): 65-95 (2004)

Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin: Preface. Discrete Mathematics 279(1-3): 1-2 (2004)

Wensong Chu, Charles J. Colbourn: Optimal (n, 4, 2)-OOC of small orders. Discrete Mathematics 279(1-3): 163-172 (2004)

Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu: Grooming in unidirectional rings: K₄-e designs. Discrete Mathematics 284(1-3): 57-62 (2004)

Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling: Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. IEEE Transactions on Information Theory 50(6): 1289-1291 (2004)

Wensong Chu, Charles J. Colbourn: Sequence designs for ultra-wideband impulse radio with optimal correlation properties. IEEE Transactions on Information Theory 50(10): 2402-2407 (2004)

Charles J. Colbourn, Myra B. Cohen, Renée Turban: A deterministic density algorithm for pairwise interaction coverage. IASTED Conf. on Software Engineering 2004: 345-352

Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk: Topology Transparent Scheduling, Synchronization, and Maximum Delay. IPDPS 2004

Minghao Cui, Violet R. Syrotiuk, Charles J. Colbourn: Securing dynamic spectrum use. VTC Fall (2) 2004: 1153-1157

Dean S. Hoskins, Renée Turban, Charles J. Colbourn: Experimental designs in software engineering: d-optimal designs and covering arrays. WISER 2004: 55-66

Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek: Preface. Discrete Mathematics 261(1-3): 1-2 (2003)

Charles J. Colbourn, Alan C. H. Ling: Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. Discrete Mathematics 261(1-3): 141-156 (2003)

Charles J. Colbourn, Alexander Rosa: Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs and Combinatorics 19(3): 335-345 (2003)

Myra B. Cohen, Charles J. Colbourn: Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theor. Comput. Sci. 297(1-3): 103-117 (2003)

Charles J. Colbourn, Violet R. Syrotiuk, Alan C. H. Ling: Steiner Systems for Topology-Transparent Access Control in MANETs. ADHOC-NOW 2003: 247-258

Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn, James S. Collofello: Variable Strength Interaction Testing of Components. COMPSAC 2003: 413-

Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling: Topology-transparent scheduling for MANETs using orthogonal arrays. DIALM-POMC 2003: 43-49

Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn: Constructing Test Suites for Interaction Testing. ICSE 2003: 38-48

Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling: Augmenting Simulated Annealing to Build Interaction Test Suites. ISSRE 2003: 394-405

Charles J. Colbourn, Manish K. Gupta: On Quaternary MacDonald Codes. ITCC 2003: 212-215

Feliu Sagols, Charles J. Colbourn: NS1D0 Sequences and Anti-Pasch Steiner Triple Systems. Ars Comb. 62 (2002)

Charles J. Colbourn, Alan C. H. Ling, Martin Tompa: Construction of optimal quality control for oligo arrays. Bioinformatics 18(4): 529-535 (2002)

Charles J. Colbourn: Projective planes and congestion-free networks. Discrete Applied Mathematics 122(1-3): 117-126 (2002)

Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees: Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptography 26(1-3): 5-6 (2002)

Charles J. Colbourn, Esther R. Lamken, Alan C. H. Ling, W. H. Mills: The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. Des. Codes Cryptography 26(1-3): 169-196 (2002)

Myra B. Cohen, Charles J. Colbourn, Lee A. Ives, Alan C. H. Ling: Kirkman triple systems of order 21 with nontrivial automorphism group. Math. Comput. 71(238): 873-881 (2002)

Charles J. Colbourn, Feliu Sagols: Triangulations and a generalization of Bose's method. Discrete Mathematics 237(1-3): 97-107 (2001)

Charles J. Colbourn, Hao Shen: Preface. Discrete Mathematics 238(1-3): 1- (2001)

Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson: Quorum Systems Constructed from Combinatorial Designs. Inf. Comput. 169(2): 160-173 (2001)

Charles J. Colbourn, Peng-Jun Wan: Minimizing drop cost for SONET/WDM networks with wavelength requirements. Networks 37(2): 107-116 (2001)

Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa: Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discrete Math. 14(4): 481-497 (2001)

Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek: Cluttered Orderings for the Complete Graph. COCOON 2001: 420-431

Myra B. Cohen, Charles J. Colbourn: Ordering disks for double erasure codes. SPAA 2001: 229-236

Charles J. Colbourn, Hadi Kharaghani: Coding, Cryptography, and Computer Security - Preface. Discrete Applied Mathematics 102(1-2): 1 (2000)

Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling: Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Applied Mathematics 102(1-2): 3-36 (2000)

Charles J. Colbourn, Sufang Zhao: Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems. Des. Codes Cryptography 20(3): 219-227 (2000)

Alan C. H. Ling, Charles J. Colbourn: Modified group divisible designs with block size four. Discrete Mathematics 219(1-3): 207-221 (2000)

Charles J. Colbourn, Alan C. H. Ling: Quorums from difference covers. Inf. Process. Lett. 75(1-2): 9-12 (2000)

Aiden A. Bruen, Charles J. Colbourn: Transversal Designs in Classical Planes and Spaces. J. Comb. Theory, Ser. A 92(1): 88-94 (2000)

Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan: Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. Journal of Graph Theory 33(2): 83-93 (2000)

Charles J. Colbourn: Multiple Access Communications Using Combinatorial Designs. Theoretical Aspects of Computer Science 2000: 1-29

Myra B. Cohen, Charles J. Colbourn: Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. LATIN 2000: 95-104

Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa: Bicoloring Steiner Triple Systems. Electr. J. Comb. 6 (1999)

M. A. Chateauneuf, Charles J. Colbourn, Donald L. Kreher: Covering Arrays of Strength Three. Des. Codes Cryptography 16(3): 235-242 (1999)

Charles J. Colbourn, Alan C. H. Ling: Kirkman school project designs. Discrete Mathematics 203(1-3): 49-60 (1999)

Charles J. Colbourn, Jianxing Yin: On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. 50 (1998)

Alan C. H. Ling, Charles J. Colbourn: Deleting Lines in Projective Planes. Ars Comb. 50 (1998)

Charles J. Colbourn, Alan C. H. Ling: Point Code Minimum Steiner Triple Systems. Des. Codes Cryptography 14(2): 141-146 (1998)

Zhike Jiang, Charles J. Colbourn: Completing the spectrum of rotational Mendelsohn triple systems. Discrete Mathematics 183(1-3): 153-160 (1998)

Robert P. Gallant, Charles J. Colbourn: Tight 4-factor orthogonal main effect plans. Discrete Mathematics 184(1-3): 101-110 (1998)

Charles J. Colbourn, Guoliang Xue: A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. Theor. Comput. Sci. 209(1-2): 331-345 (1998)

Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin: Pairwise Balanced Designs with Consecutive Block Sizes. Des. Codes Cryptography 10(2): 203-222 (1997)

R. Julian R. Abel, Charles J. Colbourn, Jianxing Yin, Hantao Zhang: Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. Des. Codes Cryptography 10(3): 275-307 (1997)

Charles J. Colbourn, Alan C. H. Ling: Pairwise Balanced Designs with Block Sizes 8, 9, and 10. J. Comb. Theory, Ser. A 77(2): 228-245 (1997)

Charles J. Colbourn, Lucien Haddad, Václav Linek: Balanced Steiner Triple Systems. J. Comb. Theory, Ser. A 78(2): 292-302 (1997)

Charles J. Colbourn, Jeffrey H. Dinitz: Complete Arcs in Steiner Triple Systems. J. Comb. Theory, Ser. A 80(2): 320-333 (1997)

Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl: Wang Tilings and Distributed Verification on Anonymous Torus Networks. Theory Comput. Syst. 30(2): 145-163 (1997)

Yeow Meng Chee, Charles J. Colbourn: Constructions for difference triangle sets. IEEE Transactions on Information Theory 43(4): 1346-1349 (1997)

Charles J. Colbourn, Donald L. Kreher: Concerning Difference Matrices. Des. Codes Cryptography 9(1): 61-70 (1996)

Frank E. Bennett, Charles J. Colbourn, Lie Zhu: Existence of three HMOLS of types hⁿ and 2ⁿ3¹. Discrete Mathematics 160(1-3): 49-65 (1996)

Charles J. Colbourn: Transversal Designs of Block Size Eight and Nine. Eur. J. Comb. 17(1): 1-14 (1996)

Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld: Two Algorithms for Unranking Arborescences. J. Algorithms 20(2): 268-281 (1996)

Charles J. Colbourn, Lucien Haddad, Václav Linek: Equitable Embeddings of Steiner Triple Systems. J. Comb. Theory, Ser. A 73(2): 229-247 (1996)

Jason I. Brown, Charles J. Colbourn, David G. Wagner: Cohen-Macaulay Rings in Network Reliability. SIAM J. Discrete Math. 9(3): 377-392 (1996)

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan: The Complexity of Computing the Tutte Polynomial on Transversal Matroids. Combinatorica 15(1): 1-10 (1995)

Charles J. Colbourn, J. Scott Provan, Dirk Vertigan: A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. Discrete Applied Mathematics 60(1-3): 119-129 (1995)

Charles J. Colbourn, Jeffrey H. Dinitz, Mieczyslaw Wojtas: Thwarts in Transversal Designs. Des. Codes Cryptography 5(3): 189-197 (1995)

Charles J. Colbourn, Charles A. Cusack, Donald L. Kreher: Partial Steiner Triple Systems with Equal-Sized Holes. J. Comb. Theory, Ser. A 70(1): 56-65 (1995)

Charles J. Colbourn, Klaus Sutner: Preface. Networks 25(3): 99 (1995)

Heidi J. Strayer, Charles J. Colbourn: Consecutive cuts and paths, and bounds on k-terminal reliability. Networks 25(3): 165-175 (1995)

Paul L. Check, Charles J. Colbourn: Concerning difference families with block size four. Discrete Mathematics 133(1-3): 285-289 (1994)

Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán: Anti-mitre steiner triple systems. Graphs and Combinatorics 10(2-4): 215-224 (1994)

Miro Kraetzl, Charles J. Colbourn: Threshold Channel Graphs. Combinatorics, Probability & Computing 2: 337-349 (1993)

Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner: Computing Residual Connectedness Reliability for Restricted Networks. Discrete Applied Mathematics 44(1-3): 221-232 (1993)

Charles J. Colbourn, Alexander Rosa, Stefan Znám: The Spectrum of Maximal Partial Steiner Triple Systems. Des. Codes Cryptography 3(3): 209-219 (1993)

Charles J. Colbourn, Ehab S. Elmallah: Reliable assignments of processors to tasks and factoring on matroids. Discrete Mathematics 114(1-3): 115-129 (1993)

Charles J. Colbourn, Ebadollah S. Mahmoodian: Support sizes of sixfold triple systems. Discrete Mathematics 115(1-3): 103-131 (1993)

Jason I. Brown, Charles J. Colbourn, John S. Devitt: Network transformations and bounding network reliability. Networks 23(1): 1-17 (1993)

Daryl D. Harms, Charles J. Colbourn: Renormalization of two - terminal reliability. Networks 23(4): 289-297 (1993)

Charles J. Colbourn, John S. Devitt, Daryl D. Harms, Miro Kraetzl: Assessing Reliability of Multistage Interconnection Networks. IEEE Trans. Computers 42(10): 1207-1221 (1993)

Miro Kraetzl, Charles J. Colbourn: Transformations on channel graphs. IEEE Transactions on Communications 41(5): 664-666 (1993)

Charles J. Colbourn, Daryl D. Harms: Evaluating performability: Most probable states and bounds. Telecommunication Systems 2(1): 275-300 (1993)

Doreen L. Erickson, Charles J. Colbourn: Conflict-Free Access for the Collections of Templates. PPSC 1993: 949-952

Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl: Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract). WDAG 1993: 264-278

Charles J. Colbourn: A Note on Bounding k-Terminal Reliability. Algorithmica 7(2&3): 303-307 (1992)

Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev: Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. Des. Codes Cryptography 2(3): 237-251 (1992)

Charles J. Colbourn, Douglas R. Stinson, Luc Teirlinck: A Parallelization of Miller's n^log n Isomorphism Technique. Inf. Process. Lett. 42(4): 223-228 (1992)

Charles J. Colbourn, Dean G. Hoffman, Rolf S. Rees: A New Class of Group Divisible Designs with Block Size Three. J. Comb. Theory, Ser. A 59(1): 73-89 (1992)

Charles J. Colbourn, Charles C. Lindner: Support Sizes of Triple Systems. J. Comb. Theory, Ser. A 61(2): 193-210 (1992)

Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger: Directed star decompositions of the complete directed graph. Journal of Graph Theory 16(5): 517-528 (1992)

Charles J. Colbourn, Katherine Heinrich: Conflict-Free Access to Parallel Memories. J. Parallel Distrib. Comput. 14(2): 193-200 (1992)

Ehab S. Elmallah, Charles J. Colbourn: Series-parallel subgraphs of planar graphs. Networks 22(6): 607-614 (1992)

Jason I. Brown, Charles J. Colbourn: Roots of the Reliability Polynomial. SIAM J. Discrete Math. 5(4): 571-585 (1992)

Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler: The number of t-wise balance designs. Combinatorica 11(3): 207-218 (1991)

Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa: Partitioning Steiner triple systems into complete arcs. Discrete Mathematics 89(2): 149-160 (1991)

Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby: The fine structure of threefold triple systems: u = 1 or 3 (mod 6). Discrete Mathematics 92(1-3): 49-64 (1991)

Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa: Preface. Discrete Mathematics 97(1-3): 1 (1991)

Charles J. Colbourn, Alan Hartman: Intersections and supports of quadruple systems. Discrete Mathematics 97(1-3): 119-137 (1991)

Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger: Directed star decompositions of directed multigraphs. Discrete Mathematics 97(1-3): 139-148 (1991)

Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson: Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory, Ser. A 57(1): 46-59 (1991)

Janelle J. Harms, Charles J. Colbourn: Probabilistic single processor scheduling. Discrete Applied Mathematics 27(1-2): 101-112 (1990)

Ehab S. Elmallah, Charles J. Colbourn: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)

Charles J. Colbourn, Ebadollah S. Mahmoodian: The spectrum of support sizes for threefold triple systems. Discrete Mathematics 83(1): 9-19 (1990)

Brent N. Clark, Charles J. Colbourn, David S. Johnson: Unit disk graphs. Discrete Mathematics 86(1-3): 165-177 (1990)

Charles J. Colbourn, Lorna K. Stewart: Permutation graphs: Connected domination and Steiner trees. Discrete Mathematics 86(1-3): 179-189 (1990)

Charles J. Colbourn, Alexander Rosa: Repeated edges in 2-factorizations. Journal of Graph Theory 14(1): 5-24 (1990)

Louis D. Nel, Charles J. Colbourn: Combining monte carlo estimates and bounds for network reliability. Networks 20(3): 277-298 (1990)

Hosam M. Aboelfotoh, Charles J. Colbourn: Efficient algorithms for computing the reliability of permutation and interval graphs. Networks 20(7): 883-898 (1990)

Charles J. Colbourn, Paul C. van Oorschot: Applications of Combinatorial Designs in Computer Science. ACM Comput. Surv. 21(2): 223-250 (1989)

Charles J. Colbourn, Vojtech Rödl: Percentages in pairwise balanced designs. Discrete Mathematics 77(1-3): 57-63 (1989)

Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa: Hybrid triple systems and cubic feedback sets. Graphs and Combinatorics 5(1): 15-28 (1989)

Hosam M. Aboelfotoh, Charles J. Colbourn: Series-Parallel Bounds for the Two-Terminal Reliability Problem. INFORMS Journal on Computing 1(4): 209-222 (1989)

Charles J. Colbourn, Robert P. J. Day, Louis D. Nel: Unranking and Ranking Spanning Trees of a Graph. J. Algorithms 10(2): 271-286 (1989)

Charles J. Colbourn, William R. Pulleyblank: Matroid Steiner problems, the Tutte polynomial and network reliability. J. Comb. Theory, Ser. B 47(1): 20-31 (1989)

Charles J. Colbourn: Simple neighbourhoods in triple systems. J. Comb. Theory, Ser. A 52(1): 10-19 (1989)

Timothy B. Brecht, Charles J. Colbourn: Multiplicative improvements in network reliability bounds. Networks 19(5): 521-529 (1989)

Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa: The strong chromatic number of partial triple systems. Discrete Applied Mathematics 20(1): 31-38 (1988)

Timothy B. Brecht, Charles J. Colbourn: Lower bounds on two-terminal network reliability. Discrete Applied Mathematics 21(3): 185-198 (1988)

Charles J. Colbourn: Problem 94. Discrete Mathematics 71(1): 93 (1988)

Charles J. Colbourn: Edge-packing of graphs and network reliability. Discrete Mathematics 72(1-3): 49-61 (1988)

Charles J. Colbourn, Daryl D. Harms: Bounding all-terminal reliability in computer networks. Networks 18(1): 1-12 (1988)

Jason I. Brown, Charles J. Colbourn: A Set System Polynomial with Colouring and Reliability Applications. SIAM J. Discrete Math. 1(2): 151-157 (1988)

Charles J. Colbourn, Alexander Rosa: Quadratic leaves of maximal partial triple systems. Graphs and Combinatorics 2(1): 317-337 (1986)

Timothy B. Brecht, Charles J. Colbourn: Improving reliability bounds in computer networks. Networks 16(4): 369-380 (1986)

Eric Neufeld, Charles J. Colbourn: The most reliable series-parallel networks. Networks 15(1): 27-32 (1985)

Ehab S. Elmallah, Charles J. Colbourn: Optimum Communication Spanning Trees in Series-Parallel Networks. SIAM J. Comput. 14(4): 915-925 (1985)

Judith B. Peachey, Richard B. Bunt, Charles J. Colbourn: Some Empirical Observations on Program Behavior with Applications to Program Restructuring. IEEE Trans. Software Eng. 11(2): 188-193 (1985)

Charles J. Colbourn, Asia Ivic Weiss: A census of regular 3-polystroma arising from honeycombs. Discrete Mathematics 50: 29-36 (1984)

Charles J. Colbourn, Rose C. Hamm, C. A. Rodger: Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda. J. Comb. Theory, Ser. A 37(3): 363-369 (1984)

Charles J. Colbourn, Andrzej Proskurowski: Concurrent Transmissions in Broadcast Networks. ICALP 1984: 128-136

Charles J. Colbourn, Marlene J. Colbourn, Alexander Rosa: Completing small partial triple systems. Discrete Mathematics 45(2-3): 165-179 (1983)

Charles J. Colbourn, Marlene J. Colbourn: Every Twofold Triple System Can Be Directed. J. Comb. Theory, Ser. A 34(3): 375-378 (1983)

Charles J. Colbourn: Embedding Partial Steiner Triple Systems Is NP-Complete. J. Comb. Theory, Ser. A 35(1): 100-105 (1983)

Joseph A. Wald, Charles J. Colbourn: Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13(2): 159-167 (1983)

Charles J. Colbourn: Computing the Chromatic Index of Steiner Triple Systems. Comput. J. 25(3): 338-339 (1982)

Charles J. Colbourn: On testing isomorphism of permutation graphs. Networks 11(1): 13-21 (1981)

Charles J. Colbourn, Kellogg S. Booth: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs. SIAM J. Comput. 10(1): 203-225 (1981)

Charles J. Colbourn, Brendan D. McKay: A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. Inf. Process. Lett. 11(2): 96-97 (1980)

Charles J. Colbourn: The Complexity of Symmetrizing Matrices. Inf. Process. Lett. 9(3): 108-109 (1979)