 | 2009 |
|---|
| 167 |       | Charles J. Colbourn,
Gerzson Kéri:
Binary Covering Arrays and Existentially Closed Graphs.
IWCC 2009: 22-33 |
| 166 | | Peyman Nayeri,
Charles J. Colbourn,
Goran Konjevod:
Randomized Postoptimization of Covering Arrays.
IWOCA 2009: 408-419 |
| 165 | | Charles J. Colbourn,
Alan C. H. Ling:
Linear hash families and forbidden configurations.
Des. Codes Cryptography 52(1): 25-55 (2009) |
| 164 | | Charles J. Colbourn,
Gennian Ge,
Alan C. H. Ling:
Optical grooming with grooming ratio eight.
Discrete Applied Mathematics 157(13): 2763-2772 (2009) |
| 163 | | Andreas H. Ronneseth,
Charles J. Colbourn:
Merging covering arrays and compressing multiple sequence alignments.
Discrete Applied Mathematics 157(9): 2177-2190 (2009) |
| 162 | | Alan C. H. Ling,
Charles J. Colbourn,
Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs II.
Discrete Mathematics 309(2): 400-411 (2009) |
| 161 | | 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) |
| 2008 |
|---|
| 160 | | 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) |
| 159 | | Peter Dukes,
Charles J. Colbourn,
Violet R. Syrotiuk:
Directed complete bipartite graph decompositions: Indirect constructions.
Discrete Mathematics 308(2-3): 367-374 (2008) |
| 158 | | Charles J. Colbourn,
Cécile Huybrechts:
Fully gated graphs: Recognition and convex operations.
Discrete Mathematics 308(22): 5184-5195 (2008) |
| 157 | | Charles J. Colbourn,
Alan C. H. Ling,
Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs I.
Discrete Mathematics 308(22): 5308-5311 (2008) |
| 156 | | Charles J. Colbourn:
Strength two covering arrays: Existence tables and projection.
Discrete Mathematics 308(5-6): 772-786 (2008) |
| 155 | | 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) |
| 154 | | Charles J. Colbourn,
Daniel W. McClary:
Locating and detecting arrays for interaction faults.
J. Comb. Optim. 15(1): 17-48 (2008) |
| 153 | | Charles J. Colbourn,
Gaetano Quattrocchi,
Violet R. Syrotiuk:
Lower bounds for two-period grooming via linear programming duality.
Networks 52(4): 299-306 (2008) |
| 152 | | Charles J. Colbourn,
Gaetano Quattrocchi,
Violet R. Syrotiuk:
Grooming for two-period optical networks.
Networks 52(4): 307-324 (2008) |
| 2007 |
|---|
| 151 | | Renée C. Bryce,
Charles J. Colbourn:
One-test-at-a-time heuristic search for interaction test suites.
GECCO 2007: 1082-1089 |
| 150 | | Michael P. McGarry,
Martin Reisslein,
Charles J. Colbourn,
Martin Maier:
Just-in-Time Online Scheduling for WDM EPONs.
ICC 2007: 2174-2179 |
| 149 | | 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) |
| 148 | | Charles J. Colbourn,
Sudhir Kumar:
Lower bounds on multiple sequence alignment using exact 3-way alignment.
BMC Bioinformatics 8: (2007) |
| 147 | | Yeow Meng Chee,
Charles J. Colbourn:
Constructions for Difference Triangle Sets
CoRR abs/0712.2553: (2007) |
| 146 | | 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) |
| 145 | | 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) |
| 144 | | Violet R. Syrotiuk,
Zhiqiang Zhang,
Charles J. Colbourn:
Transport schemes for topology-transparent scheduling.
J. Comb. Optim. 14(2-3): 229-248 (2007) |
| 143 | | Kaushik Srinivasan,
Charles J. Colbourn:
Failed disk recovery in double erasure RAID arrays.
J. Discrete Algorithms 5(1): 115-128 (2007) |
| 142 | | Toni R. Farley,
Charles J. Colbourn:
Multiterminal resilience for series-parallel networks.
Networks 50(2): 164-172 (2007) |
| 141 | | Renée C. Bryce,
Charles J. Colbourn:
The density algorithm for pairwise interaction testing.
Softw. Test., Verif. Reliab. 17(3): 159-182 (2007) |
| 2006 |
|---|
| 140 | | Yeow Meng Chee,
Charles J. Colbourn,
Alan C. H. Ling:
Optimal memoryless encoding for low power off-chip data buses.
ICCAD 2006: 369-374 |
| 139 | | Peter Dukes,
Charles J. Colbourn,
Violet R. Syrotiuk:
Topology-Transparent Schedules for Energy Limited Ad hoc Networks.
PerCom Workshops 2006: 85-90 |
| 138 | | Wensong Chu,
Charles J. Colbourn,
Violet R. Syrotiuk:
Slot synchronized topology-transparent scheduling for sensor networks.
Computer Communications 29(4): 421-428 (2006) |
| 137 | | 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) |
| 136 | | Wensong Chu,
Charles J. Colbourn,
Peter Dukes:
On constant composition codes.
Discrete Applied Mathematics 154(6): 912-929 (2006) |
| 135 | | Charles J. Colbourn,
Daniel W. McClary:
Detecting and Locating Interaction Faults.
Electronic Notes in Discrete Mathematics 27: 17-18 (2006) |
| 134 | | 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) |
| 133 | | Wensong Chu,
Charles J. Colbourn,
Violet R. Syrotiuk:
The effects of synchronization on topology-transparent scheduling.
Wireless Networks 12(6): 681-690 (2006) |
| 2005 |
|---|
| 132 | | Renée C. Bryce,
Charles J. Colbourn:
Test prioritization for pairwise interaction coverage.
A-MOST 2005 |
| 131 | | Renée C. Bryce,
Charles J. Colbourn:
Constructing interaction test suites with greedy algorithms.
ASE 2005: 440-443 |
| 130 | | Renée C. Bryce,
Charles J. Colbourn,
Myra B. Cohen:
A framework of greedy methods for constructing interaction test suites.
ICSE 2005: 146-155 |
| 129 | | Charles J. Colbourn,
Yinong Chen,
Wei-Tek Tsai:
Progressive Ranking and Composition of Web Services Using Covering Arrays.
WORDS 2005: 179-185 |
| 128 | | 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 |
| 127 | | Renée C. Bryce,
Charles J. Colbourn:
Test prioritization for pairwise interaction coverage.
ACM SIGSOFT Software Engineering Notes 30(4): 1-7 (2005) |
| 126 | | Charles J. Colbourn,
David A. Drake,
Wendy J. Myrvold:
Ovals and hyperovals in nets.
Discrete Mathematics 294(1-2): 53-74 (2005) |
| 125 | | Charles J. Colbourn,
Alan C. H. Ling,
Gaetano Quattrocchi:
Embedding path designs into kite systems.
Discrete Mathematics 297(1-3): 38-48 (2005) |
| 124 | | Wensong Chu,
Charles J. Colbourn:
Optimal frequency-hopping sequences via cyclotomy.
IEEE Transactions on Information Theory 51(3): 1139-1141 (2005) |
| 123 | | 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) |
| 122 | | 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) |
| 2004 |
|---|
| 121 |  | 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 |
| 120 | | Wensong Chu,
Charles J. Colbourn,
Violet R. Syrotiuk:
Topology Transparent Scheduling, Synchronization, and Maximum Delay.
IPDPS 2004 |
| 119 | | Minghao Cui,
Violet R. Syrotiuk,
Charles J. Colbourn:
Securing dynamic spectrum use.
VTC Fall (2) 2004: 1153-1157 |
| 118 | | Dean S. Hoskins,
Renée Turban,
Charles J. Colbourn:
Experimental designs in software engineering: d-optimal designs and covering arrays.
WISER 2004: 55-66 |
| 117 | | Violet R. Syrotiuk,
Minghao Cui,
S. Ramkumar,
Charles J. Colbourn:
Dynamic spectrum utilization in ad hoc networks.
Computer Networks 46(5): 665-678 (2004) |
| 116 | | Wensong Chu,
Charles J. Colbourn,
Peter Dukes:
Constructions for Permutation Codes in Powerline Communications.
Des. Codes Cryptography 32(1-3): 51-64 (2004) |
| 115 | | 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) |
| 114 | | Myra B. Cohen,
Charles J. Colbourn:
Ladder orderings of pairs and RAID performance.
Discrete Applied Mathematics 138(1-2): 35-46 (2004) |
| 113 | | Frank E. Bennett,
Charles J. Colbourn,
Ruizhong Wei,
Jianxing Yin:
Preface.
Discrete Mathematics 279(1-3): 1-2 (2004) |
| 112 | | Wensong Chu,
Charles J. Colbourn:
Optimal (n, 4, 2)-OOC of small orders.
Discrete Mathematics 279(1-3): 163-172 (2004) |
| 111 | | Jean-Claude Bermond,
Charles J. Colbourn,
Alan C. H. Ling,
Min-Li Yu:
Grooming in unidirectional rings: K4-e designs.
Discrete Mathematics 284(1-3): 57-62 (2004) |
| 110 | | 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) |
| 109 | | 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) |
| 2003 |
|---|
| 108 | | Charles J. Colbourn,
Violet R. Syrotiuk,
Alan C. H. Ling:
Steiner Systems for Topology-Transparent Access Control in MANETs.
ADHOC-NOW 2003: 247-258 |
| 107 | | Myra B. Cohen,
Peter B. Gibbons,
Warwick B. Mugridge,
Charles J. Colbourn,
James S. Collofello:
Variable Strength Interaction Testing of Components.
COMPSAC 2003: 413- |
| 106 | | Violet R. Syrotiuk,
Charles J. Colbourn,
Alan C. H. Ling:
Topology-transparent scheduling for MANETs using orthogonal arrays.
DIALM-POMC 2003: 43-49 |
| 105 | | Myra B. Cohen,
Peter B. Gibbons,
Warwick B. Mugridge,
Charles J. Colbourn:
Constructing Test Suites for Interaction Testing.
ICSE 2003: 38-48 |
| 104 | | Myra B. Cohen,
Charles J. Colbourn,
Alan C. H. Ling:
Augmenting Simulated Annealing to Build Interaction Test Suites.
ISSRE 2003: 394-405 |
| 103 | | Charles J. Colbourn,
Manish K. Gupta:
On Quaternary MacDonald Codes.
ITCC 2003: 212-215 |
| 102 | | Charles J. Colbourn,
Jeffrey H. Dinitz,
Dalibor Froncek:
Preface.
Discrete Mathematics 261(1-3): 1-2 (2003) |
| 101 | | 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) |
| 100 | | 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) |
| 99 | | 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) |
| 2002 |
|---|
| 98 | | Feliu Sagols,
Charles J. Colbourn:
NS1D0 Sequences and Anti-Pasch Steiner Triple Systems.
Ars Comb. 62: (2002) |
| 97 | | Charles J. Colbourn,
Alan C. H. Ling,
Martin Tompa:
Construction of optimal quality control for oligo arrays.
Bioinformatics 18(4): 529-535 (2002) |
| 96 | | 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) |
| 95 | | 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) |
| 94 | | Charles J. Colbourn:
Projective planes and congestion-free networks.
Discrete Applied Mathematics 122(1-3): 117-126 (2002) |
| 93 | | 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) |
| 2001 |
|---|
| 92 | | Myra B. Cohen,
Charles J. Colbourn,
Dalibor Froncek:
Cluttered Orderings for the Complete Graph.
COCOON 2001: 420-431 |
| 91 | | Myra B. Cohen,
Charles J. Colbourn:
Ordering disks for double erasure codes.
SPAA 2001: 229-236 |
| 90 | | Charles J. Colbourn,
Feliu Sagols:
Triangulations and a generalization of Bose's method.
Discrete Mathematics 237(1-3): 97-107 (2001) |
| 89 | | Charles J. Colbourn,
Hao Shen:
Preface.
Discrete Mathematics 238(1-3): 1- (2001) |
| 88 | | Charles J. Colbourn,
Jeffrey H. Dinitz,
Douglas R. Stinson:
Quorum Systems Constructed from Combinatorial Designs.
Inf. Comput. 169(2): 160-173 (2001) |
| 87 | | Charles J. Colbourn,
Peng-Jun Wan:
Minimizing drop cost for SONET/WDM networks with wavelength requirements.
Networks 37(2): 107-116 (2001) |
| 86 | | 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) |
| 2000 |
|---|
| 85 | | Myra B. Cohen,
Charles J. Colbourn:
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays.
LATIN 2000: 95-104 |
| 84 | | Charles J. Colbourn:
Multiple Access Communications Using Combinatorial Designs.
Theoretical Aspects of Computer Science 2000: 1-29 |
| 83 | | 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) |
| 82 | | Charles J. Colbourn,
Hadi Kharaghani:
Coding, Cryptography, and Computer Security - Preface.
Discrete Applied Mathematics 102(1-2): 1 (2000) |
| 81 | | 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) |
| 80 | | Alan C. H. Ling,
Charles J. Colbourn:
Modified group divisible designs with block size four.
Discrete Mathematics 219(1-3): 207-221 (2000) |
| 79 | | Charles J. Colbourn,
Alan C. H. Ling:
Quorums from difference covers.
Inf. Process. Lett. 75(1-2): 9-12 (2000) |
| 78 | | Aiden A. Bruen,
Charles J. Colbourn:
Transversal Designs in Classical Planes and Spaces.
J. Comb. Theory, Ser. A 92(1): 88-94 (2000) |
| 1999 |
|---|
| 77 | | M. A. Chateauneuf,
Charles J. Colbourn,
Donald L. Kreher:
Covering Arrays of Strength Three.
Des. Codes Cryptography 16(3): 235-242 (1999) |
| 76 | | Charles J. Colbourn,
Alan C. H. Ling:
Kirkman school project designs.
Discrete Mathematics 203(1-3): 49-60 (1999) |
| 75 | | Charles J. Colbourn,
Jeffrey H. Dinitz,
Alexander Rosa:
Bicoloring Steiner Triple Systems.
Electr. J. Comb. 6: (1999) |
| 1998 |
|---|
| 74 | | Alan C. H. Ling,
Charles J. Colbourn:
Deleting Lines in Projective Planes.
Ars Comb. 50: (1998) |
| 73 | | Charles J. Colbourn,
Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five.
Ars Comb. 50: (1998) |
| 72 | | Charles J. Colbourn,
Alan C. H. Ling:
Point Code Minimum Steiner Triple Systems.
Des. Codes Cryptography 14(2): 141-146 (1998) |
| 71 | | Zhike Jiang,
Charles J. Colbourn:
Completing the spectrum of rotational Mendelsohn triple systems.
Discrete Mathematics 183(1-3): 153-160 (1998) |
| 70 | | Robert P. Gallant,
Charles J. Colbourn:
Tight 4-factor orthogonal main effect plans.
Discrete Mathematics 184(1-3): 101-110 (1998) |
| 69 | | 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) |
| 1997 |
|---|
| 68 | | 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) |
| 67 | | 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) |
| 66 | | Yeow Meng Chee,
Charles J. Colbourn:
Constructions for difference triangle sets.
IEEE Transactions on Information Theory 43(4): 1346-1349 (1997) |
| 65 | | 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) |
| 64 | | Charles J. Colbourn,
Lucien Haddad,
Václav Linek:
Balanced Steiner Triple Systems.
J. Comb. Theory, Ser. A 78(2): 292-302 (1997) |
| 63 | | Charles J. Colbourn,
Jeffrey H. Dinitz:
Complete Arcs in Steiner Triple Systems.
J. Comb. Theory, Ser. A 80(2): 320-333 (1997) |
| 62 | | 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) |
| 1996 |
|---|
| 61 | | Charles J. Colbourn,
Donald L. Kreher:
Concerning Difference Matrices.
Des. Codes Cryptography 9(1): 61-70 (1996) |
| 60 | | Frank E. Bennett,
Charles J. Colbourn,
Lie Zhu:
Existence of three HMOLS of types hn and 2n31.
Discrete Mathematics 160(1-3): 49-65 (1996) |
| 59 | | Charles J. Colbourn:
Transversal Designs of Block Size Eight and Nine.
Eur. J. Comb. 17(1): 1-14 (1996) |
| 58 | | Charles J. Colbourn,
Wendy J. Myrvold,
Eugene Neufeld:
Two Algorithms for Unranking Arborescences.
J. Algorithms 20(2): 268-281 (1996) |
| 57 | | Charles J. Colbourn,
Lucien Haddad,
Václav Linek:
Equitable Embeddings of Steiner Triple Systems.
J. Comb. Theory, Ser. A 73(2): 229-247 (1996) |
| 56 | | Jason I. Brown,
Charles J. Colbourn,
David G. Wagner:
Cohen-Macaulay Rings in Network Reliability.
SIAM J. Discrete Math. 9(3): 377-392 (1996) |
| 1995 |
|---|
| 55 | | Charles J. Colbourn,
J. Scott Provan,
Dirk Vertigan:
The Complexity of Computing the Tutte Polynomial on Transversal Matroids.
Combinatorica 15(1): 1-10 (1995) |
| 54 | | Charles J. Colbourn,
Jeffrey H. Dinitz,
Mieczyslaw Wojtas:
Thwarts in Transversal Designs.
Des. Codes Cryptography 5(3): 189-197 (1995) |
| 53 | | 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) |
| 52 | | 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) |
| 1994 |
|---|
| 51 | | Paul L. Check,
Charles J. Colbourn:
Concerning difference families with block size four.
Discrete Mathematics 133(1-3): 285-289 (1994) |
| 1993 |
|---|
| 50 | | Doreen L. Erickson,
Charles J. Colbourn:
Conflict-Free Access for the Collections of Templates.
PPSC 1993: 949-952 |
| 49 | | Violet R. Syrotiuk,
Charles J. Colbourn,
Jan K. Pachl:
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract).
WDAG 1993: 264-278 |
| 48 | | Miro Kraetzl,
Charles J. Colbourn:
Threshold Channel Graphs.
Combinatorics, Probability & Computing 2: 337-349 (1993) |
| 47 | | Charles J. Colbourn,
Alexander Rosa,
Stefan Znám:
The Spectrum of Maximal Partial Steiner Triple Systems.
Des. Codes Cryptography 3(3): 209-219 (1993) |
| 46 | | 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) |
| 45 | | Charles J. Colbourn,
Ehab S. Elmallah:
Reliable assignments of processors to tasks and factoring on matroids.
Discrete Mathematics 114(1-3): 115-129 (1993) |
| 44 | | Charles J. Colbourn,
Ebadollah S. Mahmoodian:
Support sizes of sixfold triple systems.
Discrete Mathematics 115(1-3): 103-131 (1993) |
| 43 | | 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) |
| 1992 |
|---|
| 42 | | Charles J. Colbourn:
A Note on Bounding k-Terminal Reliability.
Algorithmica 7(2&3): 303-307 (1992) |
| 41 | | 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) |
| 40 | | 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) |
| 39 | | 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) |
| 38 | | Charles J. Colbourn,
Charles C. Lindner:
Support Sizes of Triple Systems.
J. Comb. Theory, Ser. A 61(2): 193-210 (1992) |
| 37 | | Charles J. Colbourn,
Katherine Heinrich:
Conflict-Free Access to Parallel Memories.
J. Parallel Distrib. Comput. 14(2): 193-200 (1992) |
| 36 | | Jason I. Brown,
Charles J. Colbourn:
Roots of the Reliability Polynomial.
SIAM J. Discrete Math. 5(4): 571-585 (1992) |
| 1991 |
|---|
| 35 | | 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) |
| 34 | | 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) |
| 33 | | 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) |
| 32 | | Charles J. Colbourn,
Dieter Jungnickel,
Alexander Rosa:
Preface.
Discrete Mathematics 97(1-3): 1 (1991) |
| 31 | | Charles J. Colbourn,
Alan Hartman:
Intersections and supports of quadruple systems.
Discrete Mathematics 97(1-3): 119-137 (1991) |
| 30 | | Charles J. Colbourn,
Dean G. Hoffman,
C. A. Rodger:
Directed star decompositions of directed multigraphs.
Discrete Mathematics 97(1-3): 139-148 (1991) |
| 29 | | 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) |
| 1990 |
|---|
| 28 | | Janelle J. Harms,
Charles J. Colbourn:
Probabilistic single processor scheduling.
Discrete Applied Mathematics 27(1-2): 101-112 (1990) |
| 27 | | Ehab S. Elmallah,
Charles J. Colbourn:
On two dual classes of planar graphs.
Discrete Mathematics 80(1): 21-40 (1990) |
| 26 | | Charles J. Colbourn,
Ebadollah S. Mahmoodian:
The spectrum of support sizes for threefold triple systems.
Discrete Mathematics 83(1): 9-19 (1990) |
| 25 | | Brent N. Clark,
Charles J. Colbourn,
David S. Johnson:
Unit disk graphs.
Discrete Mathematics 86(1-3): 165-177 (1990) |
| 24 | | Charles J. Colbourn,
Lorna K. Stewart:
Permutation graphs: Connected domination and Steiner trees.
Discrete Mathematics 86(1-3): 179-189 (1990) |
| 1989 |
|---|
| 23 | | Charles J. Colbourn,
Paul C. van Oorschot:
Applications of Combinatorial Designs in Computer Science.
ACM Comput. Surv. 21(2): 223-250 (1989) |
| 22 | | Charles J. Colbourn,
Vojtech Rödl:
Percentages in pairwise balanced designs.
Discrete Mathematics 77(1-3): 57-63 (1989) |
| 21 | | Hosam M. Aboelfotoh,
Charles J. Colbourn:
Series-Parallel Bounds for the Two-Terminal Reliability Problem.
INFORMS Journal on Computing 1(4): 209-222 (1989) |
| 20 | | 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) |
| 19 | | Charles J. Colbourn:
Simple neighbourhoods in triple systems.
J. Comb. Theory, Ser. A 52(1): 10-19 (1989) |
| 18 | | 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) |
| 1988 |
|---|
| 17 | | Charles J. Colbourn,
Dieter Jungnickel,
Alexander Rosa:
The strong chromatic number of partial triple systems.
Discrete Applied Mathematics 20(1): 31-38 (1988) |
| 16 | | Timothy B. Brecht,
Charles J. Colbourn:
Lower bounds on two-terminal network reliability.
Discrete Applied Mathematics 21(3): 185-198 (1988) |
| 15 | | Charles J. Colbourn:
Problem 94.
Discrete Mathematics 71(1): 93 (1988) |
| 14 | | Charles J. Colbourn:
Edge-packing of graphs and network reliability.
Discrete Mathematics 72(1-3): 49-61 (1988) |
| 13 | | Jason I. Brown,
Charles J. Colbourn:
A Set System Polynomial with Colouring and Reliability Applications.
SIAM J. Discrete Math. 1(2): 151-157 (1988) |
| 1985 |
|---|
| 12 | | 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) |
| 11 | | Ehab S. Elmallah,
Charles J. Colbourn:
Optimum Communication Spanning Trees in Series-Parallel Networks.
SIAM J. Comput. 14(4): 915-925 (1985) |
| 1984 |
|---|
| 10 | | Charles J. Colbourn,
Andrzej Proskurowski:
Concurrent Transmissions in Broadcast Networks.
ICALP 1984: 128-136 |
| 9 | | Charles J. Colbourn,
Asia Ivic Weiss:
A census of regular 3-polystroma arising from honeycombs.
Discrete Mathematics 50: 29-36 (1984) |
| 8 | | 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) |
| 1983 |
|---|
| 7 | | Charles J. Colbourn,
Marlene J. Colbourn,
Alexander Rosa:
Completing small partial triple systems.
Discrete Mathematics 45(2-3): 165-179 (1983) |
| 6 | | Charles J. Colbourn,
Marlene J. Colbourn:
Every Twofold Triple System Can Be Directed.
J. Comb. Theory, Ser. A 34(3): 375-378 (1983) |
| 5 | | Charles J. Colbourn:
Embedding Partial Steiner Triple Systems Is NP-Complete.
J. Comb. Theory, Ser. A 35(1): 100-105 (1983) |
| 1982 |
|---|
| 4 | | Charles J. Colbourn:
Computing the Chromatic Index of Steiner Triple Systems.
Comput. J. 25(3): 338-339 (1982) |
| 1981 |
|---|
| 3 | | 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) |
| 1980 |
|---|
| 2 | | 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) |
| 1979 |
|---|
| 1 | | Charles J. Colbourn:
The Complexity of Symmetrizing Matrices.
Inf. Process. Lett. 9(3): 108-109 (1979) |
