Search the dblp DataBase
Charles J. Colbourn :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Charles J. Colbourn , Paul C. van Oorschot Applications of Combinatorial Designs in Computer Science. [Citation Graph (1, 0)][DBLP ] ACM Comput. Surv., 1989, v:21, n:2, pp:223-250 [Journal ] Charles J. Colbourn Multiple Access Communications Using Combinatorial Designs. [Citation Graph (0, 0)][DBLP ] Theoretical Aspects of Computer Science, 2000, pp:1-29 [Conf ] Charles J. Colbourn , Violet R. Syrotiuk , Alan C. H. Ling Steiner Systems for Topology-Transparent Access Control in MANETs. [Citation Graph (0, 0)][DBLP ] ADHOC-NOW, 2003, pp:247-258 [Conf ] Myra B. Cohen , Charles J. Colbourn , Dalibor Froncek Cluttered Orderings for the Complete Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:420-431 [Conf ] Myra B. Cohen , Peter B. Gibbons , Warwick B. Mugridge , Charles J. Colbourn , James S. Collofello Variable Strength Interaction Testing of Components. [Citation Graph (0, 0)][DBLP ] COMPSAC, 2003, pp:413-0 [Conf ] Violet R. Syrotiuk , Charles J. Colbourn , Alan C. H. Ling Topology-transparent scheduling for MANETs using orthogonal arrays. [Citation Graph (0, 0)][DBLP ] DIALM-POMC, 2003, pp:43-49 [Conf ] Charles J. Colbourn , Myra B. Cohen , Renée Turban A deterministic density algorithm for pairwise interaction coverage. [Citation Graph (0, 0)][DBLP ] IASTED Conf. on Software Engineering, 2004, pp:345-352 [Conf ] Charles J. Colbourn , Andrzej Proskurowski Concurrent Transmissions in Broadcast Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 1984, pp:128-136 [Conf ] Yeow Meng Chee , Charles J. Colbourn , Alan C. H. Ling Optimal memoryless encoding for low power off-chip data buses. [Citation Graph (0, 0)][DBLP ] ICCAD, 2006, pp:369-374 [Conf ] Renée C. Bryce , Charles J. Colbourn , Myra B. Cohen A framework of greedy methods for constructing interaction test suites. [Citation Graph (0, 0)][DBLP ] ICSE, 2005, pp:146-155 [Conf ] Myra B. Cohen , Peter B. Gibbons , Warwick B. Mugridge , Charles J. Colbourn Constructing Test Suites for Interaction Testing. [Citation Graph (0, 0)][DBLP ] ICSE, 2003, pp:38-48 [Conf ] Wensong Chu , Charles J. Colbourn , Violet R. Syrotiuk Topology Transparent Scheduling, Synchronization, and Maximum Delay. [Citation Graph (0, 0)][DBLP ] IPDPS, 2004, pp:- [Conf ] Myra B. Cohen , Charles J. Colbourn , Alan C. H. Ling Augmenting Simulated Annealing to Build Interaction Test Suites. [Citation Graph (0, 0)][DBLP ] ISSRE, 2003, pp:394-405 [Conf ] Charles J. Colbourn , Manish K. Gupta On Quaternary MacDonald Codes. [Citation Graph (0, 0)][DBLP ] ITCC, 2003, pp:212-215 [Conf ] Renée C. Bryce , Charles J. Colbourn Constructing interaction test suites with greedy algorithms. [Citation Graph (0, 0)][DBLP ] ASE, 2005, pp:440-443 [Conf ] Myra B. Cohen , Charles J. Colbourn Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. [Citation Graph (0, 0)][DBLP ] LATIN, 2000, pp:95-104 [Conf ] Peter Dukes , Charles J. Colbourn , Violet R. Syrotiuk Topology-Transparent Schedules for Energy Limited Ad hoc Networks. [Citation Graph (0, 0)][DBLP ] PerCom Workshops, 2006, pp:85-90 [Conf ] Doreen L. Erickson , Charles J. Colbourn Conflict-Free Access for the Collections of Templates. [Citation Graph (0, 0)][DBLP ] PPSC, 1993, pp:949-952 [Conf ] Myra B. Cohen , Charles J. Colbourn Ordering disks for double erasure codes. [Citation Graph (0, 0)][DBLP ] SPAA, 2001, pp:229-236 [Conf ] Violet R. Syrotiuk , Charles J. Colbourn , Jan K. Pachl Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WDAG, 1993, pp:264-278 [Conf ] Dean S. Hoskins , Renée Turban , Charles J. Colbourn Experimental designs in software engineering: d-optimal designs and covering arrays. [Citation Graph (0, 0)][DBLP ] WISER, 2004, pp:55-66 [Conf ] Charles J. Colbourn , Yinong Chen , Wei-Tek Tsai Progressive Ranking and Composition of Web Services Using Covering Arrays. [Citation Graph (0, 0)][DBLP ] WORDS, 2005, pp:179-185 [Conf ] Dean S. Hoskins , Charles J. Colbourn , Douglas C. Montgomery Software performance testing using covering arrays: efficient screening designs with categorical factors. [Citation Graph (0, 0)][DBLP ] WOSP, 2005, pp:131-136 [Conf ] Minghao Cui , Violet R. Syrotiuk , Charles J. Colbourn Securing dynamic spectrum use. [Citation Graph (0, 0)][DBLP ] VTC Fall (2), 2004, pp:1153-1157 [Conf ] Charles J. Colbourn A Note on Bounding k-Terminal Reliability. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:7, n:2&3, pp:303-307 [Journal ] Charles J. Colbourn , Jianxing Yin On Directed Incomplete Transversal Designs with Block Size Five. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:50, n:, pp:- [Journal ] Alan C. H. Ling , Charles J. Colbourn Deleting Lines in Projective Planes. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:50, n:, pp:- [Journal ] Feliu Sagols , Charles J. Colbourn NS1D0 Sequences and Anti-Pasch Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2002, v:62, n:, pp:- [Journal ] Charles J. Colbourn , Alan C. H. Ling , Martin Tompa Construction of optimal quality control for oligo arrays. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2002, v:18, n:4, pp:529-535 [Journal ] Charles J. Colbourn Computing the Chromatic Index of Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] Comput. J., 1982, v:25, n:3, pp:338-339 [Journal ] Violet R. Syrotiuk , Minghao Cui , S. Ramkumar , Charles J. Colbourn Dynamic spectrum utilization in ad hoc networks. [Citation Graph (0, 0)][DBLP ] Computer Networks, 2004, v:46, n:5, pp:665-678 [Journal ] Charles J. Colbourn , Dean G. Hoffman , Kevin T. Phelps , Vojtech Rödl , Peter Winkler The number of t-wise balance designs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:3, pp:207-218 [Journal ] Charles J. Colbourn , J. Scott Provan , Dirk Vertigan The Complexity of Computing the Tutte Polynomial on Transversal Matroids. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1995, v:15, n:1, pp:1-10 [Journal ] Charles J. Colbourn , Jeffrey H. Dinitz , Alexander Rosa Bicoloring Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 1999, v:6, n:, pp:- [Journal ] Wensong Chu , Charles J. Colbourn , Violet R. Syrotiuk Slot synchronized topology-transparent scheduling for sensor networks. [Citation Graph (0, 0)][DBLP ] Computer Communications, 2006, v:29, n:4, pp:421-428 [Journal ] Miro Kraetzl , Charles J. Colbourn Threshold Channel Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:337-349 [Journal ] Yeow Meng Chee , Charles J. Colbourn , Alan C. H. Ling Asymptotically optimal erasure-resilient codes for large disk arrays. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:102, n:1-2, pp:3-36 [Journal ] Wensong Chu , Charles J. Colbourn , Peter Dukes On constant composition codes. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:6, pp:912-929 [Journal ] Myra B. Cohen , Charles J. Colbourn Ladder orderings of pairs and RAID performance. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:35-46 [Journal ] Charles J. Colbourn Projective planes and congestion-free networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:117-126 [Journal ] Charles J. Colbourn , Hadi Kharaghani Coding, Cryptography, and Computer Security - Preface. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:102, n:1-2, pp:1- [Journal ] Charles J. Colbourn , J. Scott Provan , Dirk Vertigan A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:119-129 [Journal ] Charles J. Colbourn , Appajosyula Satyanarayana , Charles L. Suffel , Klaus Sutner Computing Residual Connectedness Reliability for Restricted Networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:221-232 [Journal ] R. Julian R. Abel , Charles J. Colbourn , Jianxing Yin , Hantao Zhang Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1997, v:10, n:3, pp:275-307 [Journal ] M. A. Chateauneuf , Charles J. Colbourn , Donald L. Kreher Covering Arrays of Strength Three. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1999, v:16, n:3, pp:235-242 [Journal ] Wensong Chu , Charles J. Colbourn , Peter Dukes Constructions for Permutation Codes in Powerline Communications. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2004, v:32, n:1-3, pp:51-64 [Journal ] Charles J. Colbourn , Jeffrey H. Dinitz , Mieczyslaw Wojtas Thwarts in Transversal Designs. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1995, v:5, n:3, pp:189-197 [Journal ] Charles J. Colbourn , Donald L. Kreher Concerning Difference Matrices. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1996, v:9, n:1, pp:61-70 [Journal ] Charles J. Colbourn , Alan C. H. Ling Point Code Minimum Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1998, v:14, n:2, pp:141-146 [Journal ] Charles J. Colbourn , Esther R. Lamken , Alan C. H. Ling , W. H. Mills The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2002, v:26, n:1-3, pp:169-196 [Journal ] Charles J. Colbourn , Alan C. H. Ling , Violet R. Syrotiuk Cover-Free Families and Topology-Transparent Scheduling for MANETs. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2004, v:32, n:1-3, pp:65-95 [Journal ] Charles J. Colbourn , Eric Mendelsohn , Cheryl E. Praeger , Vladimir D. Tonchev Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1992, v:2, n:3, pp:237-251 [Journal ] Charles J. Colbourn , Alexander Rosa , Stefan Znám The Spectrum of Maximal Partial Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1993, v:3, n:3, pp:209-219 [Journal ] Charles J. Colbourn , Douglas R. Stinson , G. H. John van Rees Preface: In Honour of Ronald C. Mullin. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2002, v:26, n:1-3, pp:5-6 [Journal ] Charles J. Colbourn , Sufang Zhao Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2000, v:20, n:3, pp:219-227 [Journal ] Alan C. H. Ling , Xiaojun Zhu , Charles J. Colbourn , Ronald C. Mullin Pairwise Balanced Designs with Consecutive Block Sizes. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1997, v:10, n:2, pp:203-222 [Journal ] Charles J. Colbourn , Sosina Martirosyan , Tran van Trung , Robert A. Walker Roux-type constructions for covering arrays of strengths three and four. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2006, v:41, n:1, pp:33-57 [Journal ] Frank E. Bennett , Charles J. Colbourn , Ruizhong Wei , Jianxing Yin Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:279, n:1-3, pp:1-2 [Journal ] Jean-Claude Bermond , Charles J. Colbourn , Alan C. H. Ling , Min-Li Yu Grooming in unidirectional rings: K 4 -e designs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:284, n:1-3, pp:57-62 [Journal ] Wensong Chu , Charles J. Colbourn Optimal (n , 4, 2)-OOC of small orders. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:279, n:1-3, pp:163-172 [Journal ] Charles J. Colbourn , Jeffrey H. Dinitz , Dalibor Froncek Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:261, n:1-3, pp:1-2 [Journal ] Charles J. Colbourn , David A. Drake , Wendy J. Myrvold Ovals and hyperovals in nets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:294, n:1-2, pp:53-74 [Journal ] Charles J. Colbourn , Alan C. H. Ling Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:261, n:1-3, pp:141-156 [Journal ] Charles J. Colbourn , Alan C. H. Ling , Gaetano Quattrocchi Embedding path designs into kite systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:297, n:1-3, pp:38-48 [Journal ] Charles J. Colbourn , Hao Shen Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:238, n:1-3, pp:1-0 [Journal ] Charles J. Colbourn , Feliu Sagols Triangulations and a generalization of Bose's method. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:237, n:1-3, pp:97-107 [Journal ] Alan C. H. Ling , Charles J. Colbourn Modified group divisible designs with block size four. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:219, n:1-3, pp:207-221 [Journal ] Charles J. Colbourn Transversal Designs of Block Size Eight and Nine. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1996, v:17, n:1, pp:1-14 [Journal ] Charles J. Colbourn , Alexander Rosa Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2003, v:19, n:3, pp:335-345 [Journal ] Charles J. Colbourn , Jeffrey H. Dinitz , Douglas R. Stinson Quorum Systems Constructed from Combinatorial Designs. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:169, n:2, pp:160-173 [Journal ] Renée C. Bryce , Charles J. Colbourn Prioritized interaction testing for pair-wise coverage with seeding and constraints. [Citation Graph (0, 0)][DBLP ] Information & Software Technology, 2006, v:48, n:10, pp:960-970 [Journal ] Charles J. Colbourn The Complexity of Symmetrizing Matrices. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1979, v:9, n:3, pp:108-109 [Journal ] Charles J. Colbourn , Alan C. H. Ling Quorums from difference covers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:1-2, pp:9-12 [Journal ] Charles J. Colbourn , Brendan D. McKay A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1980, v:11, n:2, pp:96-97 [Journal ] Charles J. Colbourn , Douglas R. Stinson , Luc Teirlinck A Parallelization of Miller's n^log n Isomorphism Technique. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:4, pp:223-228 [Journal ] Charles J. Colbourn , Robert P. J. Day , Louis D. Nel Unranking and Ranking Spanning Trees of a Graph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1989, v:10, n:2, pp:271-286 [Journal ] Charles J. Colbourn , Wendy J. Myrvold , Eugene Neufeld Two Algorithms for Unranking Arborescences. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:2, pp:268-281 [Journal ] Aiden A. Bruen , Charles J. Colbourn Transversal Designs in Classical Planes and Spaces. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2000, v:92, n:1, pp:88-94 [Journal ] Charles J. Colbourn Embedding Partial Steiner Triple Systems Is NP-Complete. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1983, v:35, n:1, pp:100-105 [Journal ] Charles J. Colbourn Simple neighbourhoods in triple systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:10-19 [Journal ] Charles J. Colbourn , Marlene J. Colbourn Every Twofold Triple System Can Be Directed. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1983, v:34, n:3, pp:375-378 [Journal ] Charles J. Colbourn , Charles A. Cusack , Donald L. Kreher Partial Steiner Triple Systems with Equal-Sized Holes. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1995, v:70, n:1, pp:56-65 [Journal ] Charles J. Colbourn , Jeffrey H. Dinitz Complete Arcs in Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:320-333 [Journal ] Charles J. Colbourn , Jeffrey H. Dinitz , Douglas R. Stinson Spanning sets and scattering sets in Steiner triple systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1991, v:57, n:1, pp:46-59 [Journal ] Charles J. Colbourn , Lucien Haddad , Václav Linek Equitable Embeddings of Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:229-247 [Journal ] Charles J. Colbourn , Lucien Haddad , Václav Linek Balanced Steiner Triple Systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:78, n:2, pp:292-302 [Journal ] Charles J. Colbourn , Rose C. Hamm , C. A. Rodger Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:363-369 [Journal ] Charles J. Colbourn , Dean G. Hoffman , Rolf S. Rees A New Class of Group Divisible Designs with Block Size Three. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:73-89 [Journal ] Charles J. Colbourn , Charles C. Lindner Support Sizes of Triple Systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:193-210 [Journal ] Charles J. Colbourn , Alan C. H. Ling Pairwise Balanced Designs with Block Sizes 8, 9, and 10. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:77, n:2, pp:228-245 [Journal ] Charles J. Colbourn , William R. Pulleyblank Matroid Steiner problems, the Tutte polynomial and network reliability. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:20-31 [Journal ] Kaushik Srinivasan , Charles J. Colbourn Failed disk recovery in double erasure RAID arrays. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2007, v:5, n:1, pp:115-128 [Journal ] Charles J. Colbourn , Katherine Heinrich Conflict-Free Access to Parallel Memories. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1992, v:14, n:2, pp:193-200 [Journal ] Myra B. Cohen , Charles J. Colbourn , Lee A. Ives , Alan C. H. Ling Kirkman triple systems of order 21 with nontrivial automorphism group. [Citation Graph (0, 0)][DBLP ] Math. Comput., 2002, v:71, n:238, pp:873-881 [Journal ] Violet R. Syrotiuk , Charles J. Colbourn , Jan K. Pachl Wang Tilings and Distributed Verification on Anonymous Torus Networks. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1997, v:30, n:2, pp:145-163 [Journal ] Charles J. Colbourn , Peng-Jun Wan Minimizing drop cost for SONET/WDM networks with wavelength requirements. [Citation Graph (0, 0)][DBLP ] Networks, 2001, v:37, n:2, pp:107-116 [Journal ] Charles J. Colbourn , Kellogg S. Booth Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:1, pp:203-225 [Journal ] Ehab S. El-Mallah , Charles J. Colbourn Optimum Communication Spanning Trees in Series-Parallel Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:4, pp:915-925 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2005, v:19, n:2, pp:523-542 [Journal ] Noga Alon , Charles J. Colbourn , Alan C. H. Ling , Martin Tompa Equireplicate Balanced Binary Codes for Oligo Arrays. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2001, v:14, n:4, pp:481-497 [Journal ] Jason I. Brown , Charles J. Colbourn A Set System Polynomial with Colouring and Reliability Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:2, pp:151-157 [Journal ] Jason I. Brown , Charles J. Colbourn Roots of the Reliability Polynomial. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1992, v:5, n:4, pp:571-585 [Journal ] Jason I. Brown , Charles J. Colbourn , David G. Wagner Cohen-Macaulay Rings in Network Reliability. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1996, v:9, n:3, pp:377-392 [Journal ] Wensong Chu , Charles J. Colbourn , Solomon W. Golomb A Recursive Construction For Regular Difference Triangle Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2005, v:18, n:4, pp:741-748 [Journal ] Charles J. Colbourn , John S. Devitt , Daryl D. Harms , Miro Kraetzl Assessing Reliability of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1993, v:42, n:10, pp:1207-1221 [Journal ] Charles J. Colbourn , Guoliang Xue A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:209, n:1-2, pp:331-345 [Journal ] Myra B. Cohen , Charles J. Colbourn Optimal and pessimal orderings of Steiner triple systems in disk arrays. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:297, pp:103-117 [Journal ] Yeow Meng Chee , Charles J. Colbourn Constructions for difference triangle sets. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1346-1349 [Journal ] Wensong Chu , Charles J. Colbourn Sequence designs for ultra-wideband impulse radio with optimal correlation properties. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2402-2407 [Journal ] Wensong Chu , Charles J. Colbourn Optimal frequency-hopping sequences via cyclotomy. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1139-1141 [Journal ] Charles J. Colbourn , Torleiv Kløve , Alan C. H. Ling Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1289-1291 [Journal ] Judith B. Peachey , Richard B. Bunt , Charles J. Colbourn Some Empirical Observations on Program Behavior with Applications to Program Restructuring. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Software Eng., 1985, v:11, n:2, pp:188-193 [Journal ] Renée C. Bryce , Charles J. Colbourn One-test-at-a-time heuristic search for interaction test suites. [Citation Graph (0, 0)][DBLP ] GECCO, 2007, pp:1082-1089 [Conf ] Charles J. Colbourn , Minghao Cui , Errol L. Lloyd , Violet R. Syrotiuk A carrier sense multiple access protocol with power backoff (CSMA/PB). [Citation Graph (0, 0)][DBLP ] Ad Hoc Networks, 2007, v:5, n:8, pp:1233-1250 [Journal ] Charles J. Colbourn , Asia Ivic Weiss A census of regular 3-polystroma arising from honeycombs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:50, n:, pp:29-36 [Journal ] Charles J. Colbourn , Marlene J. Colbourn , Alexander Rosa Completing small partial triple systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:45, n:2-3, pp:165-179 [Journal ] Charles J. Colbourn Problem 94. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1988, v:71, n:1, pp:93- [Journal ] Charles J. Colbourn Edge-packing of graphs and network reliability. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1988, v:72, n:1-3, pp:49-61 [Journal ] Charles J. Colbourn , Vojtech Rödl Percentages in pairwise balanced designs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:77, n:1-3, pp:57-63 [Journal ] Ehab S. El-Mallah , Charles J. Colbourn On two dual classes of planar graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:80, n:1, pp:21-40 [Journal ] Charles J. Colbourn , Alan C. H. Ling Kirkman school project designs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:203, n:1-3, pp:49-60 [Journal ] Zhike Jiang , Charles J. Colbourn Completing the spectrum of rotational Mendelsohn triple systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:183, n:1-3, pp:153-160 [Journal ] Robert P. Gallant , Charles J. Colbourn Tight 4-factor orthogonal main effect plans. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:184, n:1-3, pp:101-110 [Journal ] Charles J. Colbourn , Ebadollah S. Mahmoodian The spectrum of support sizes for threefold triple systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:83, n:1, pp:9-19 [Journal ] Brent N. Clark , Charles J. Colbourn , David S. Johnson Unit disk graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:86, n:1-3, pp:165-177 [Journal ] Charles J. Colbourn , Lorna K. Stewart Permutation graphs: Connected domination and Steiner trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:86, n:1-3, pp:179-189 [Journal ] Charles J. Colbourn , Kevin T. Phelps , Marialuisa J. de Resmini , Alexander Rosa Partitioning Steiner triple systems into complete arcs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:89, n:2, pp:149-160 [Journal ] Charles J. Colbourn , Rudolf Mathon , Alexander Rosa , Nabil Shalaby The fine structure of threefold triple systems: u = 1 or 3 (mod 6). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:92, n:1-3, pp:49-64 [Journal ] Charles J. Colbourn , Dean G. Hoffman , C. A. Rodger Directed star decompositions of directed multigraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:97, n:1-3, pp:139-148 [Journal ] Charles J. Colbourn , Alan Hartman Intersections and supports of quadruple systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:97, n:1-3, pp:119-137 [Journal ] Charles J. Colbourn , Dieter Jungnickel , Alexander Rosa Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:97, n:1-3, pp:1- [Journal ] Charles J. Colbourn , Ehab S. Elmallah Reliable assignments of processors to tasks and factoring on matroids. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:114, n:1-3, pp:115-129 [Journal ] Charles J. Colbourn , Ebadollah S. Mahmoodian Support sizes of sixfold triple systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:115, n:1-3, pp:103-131 [Journal ] Frank E. Bennett , Charles J. Colbourn , Lie Zhu Existence of three HMOLS of types hn and 2n 31 . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:160, n:1-3, pp:49-65 [Journal ] Paul L. Check , Charles J. Colbourn Concerning difference families with block size four. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:133, n:1-3, pp:285-289 [Journal ] Violet R. Syrotiuk , Zhiqiang Zhang , Charles J. Colbourn Transport schemes for topology-transparent scheduling. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2007, v:14, n:2-3, pp:229-248 [Journal ] Wensong Chu , Charles J. Colbourn , Violet R. Syrotiuk The effects of synchronization on topology-transparent scheduling. [Citation Graph (0, 0)][DBLP ] Wireless Networks, 2006, v:12, n:6, pp:681-690 [Journal ] Just-in-Time Online Scheduling for WDM EPONs. [Citation Graph (, )][DBLP ] Test prioritization for pairwise interaction coverage. [Citation Graph (, )][DBLP ] Binary Covering Arrays and Existentially Closed Graphs. [Citation Graph (, )][DBLP ] Randomized Postoptimization of Covering Arrays. [Citation Graph (, )][DBLP ] Lower bounds on multiple sequence alignment using exact 3-way alignment. [Citation Graph (, )][DBLP ] Constructions for Difference Triangle Sets [Citation Graph (, )][DBLP ] Optimal Memoryless Encoding for Low Power Off-Chip Data Buses [Citation Graph (, )][DBLP ] The strong chromatic number of partial triple systems. [Citation Graph (, )][DBLP ] Lower bounds on two-terminal network reliability. [Citation Graph (, )][DBLP ] Probabilistic single processor scheduling. [Citation Graph (, )][DBLP ] Optical grooming with grooming ratio eight. [Citation Graph (, )][DBLP ] Merging covering arrays and compressing multiple sequence alignments. [Citation Graph (, )][DBLP ] Covering and radius-covering arrays: Constructions and classification. [Citation Graph (, )][DBLP ] Linear hash families and forbidden configurations. [Citation Graph (, )][DBLP ] Directed complete bipartite graph decompositions: Indirect constructions. [Citation Graph (, )][DBLP ] Strength two covering arrays: Existence tables and projection. [Citation Graph (, )][DBLP ] Constructing strength three covering arrays with augmented annealing. [Citation Graph (, )][DBLP ] Fully gated graphs: Recognition and convex operations. [Citation Graph (, )][DBLP ] Minimum embedding of Steiner triple systems into (K4 -e)-designs I. [Citation Graph (, )][DBLP ] Minimum embedding of Steiner triple systems into (K4 -e)-designs II. [Citation Graph (, )][DBLP ] Graph designs for the eight-edge five-vertex graphs. [Citation Graph (, )][DBLP ] Search in 0.102secs, Finished in 0.108secs