| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez |
Cover starters for covering arrays of strength two.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk |
Grooming traffic to minimize load. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Daniel Horsley, Christopher McLean |
Compressive Sensing Matrices and Hash Families. |
IEEE Transactions on Communications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Gennian Ge, Alan C. H. Ling |
Optical grooming with grooming ratio nine. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn |
Covering arrays and hash families. |
Information Security, Coding Theory and Related Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn, D. Richard Kuhn |
Finding Interaction Faults Adaptively Using Distance-Based Strategies. |
ECBS |
2011 |
DBLP DOI BibTeX RDF |
distance-based testing, software testing, Hamming distance, Combinatorial testing |
| 1 | Charles J. Colbourn |
Efficient Conditional Expectation Algorithms for Constructing Hash Families. |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn |
Covering arrays from cyclotomy. |
Des. Codes Cryptography |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichiro Fujiwara, Charles J. Colbourn |
A combinatorial approach to X-tolerant compaction circuits. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk |
Apples and oranges: comparing schedule- and contention-based medium access control. |
MSWiM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski |
Chip firing and all-terminal network reliability bounds. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Gennian Ge, Alan C. H. Ling |
Graph designs for the eight-edge five-vertex graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi |
Minimum embedding of Steiner triple systems into (K4-e)-designs II. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Yuichiro Fujiwara |
Small stopping sets in Steiner triple systems. |
Cryptography and Communications |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
A density-based greedy algorithm for higher strength covering arrays. |
Softw. Test., Verif. Reliab. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas H. Ronneseth, Charles J. Colbourn |
Merging covering arrays and compressing multiple sequence alignments. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Gennian Ge, Alan C. H. Ling |
Optical grooming with grooming ratio eight. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alan C. H. Ling |
Linear hash families and forbidden configurations. |
Des. Codes Cryptography |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 05B15, 11T71, 05B30 |
| 1 | Charles J. Colbourn, Gerzson Kéri |
Binary Covering Arrays and Existentially Closed Graphs. |
IWCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Nayeri, Charles J. Colbourn, Goran Konjevod |
Randomized Postoptimization of Covering Arrays. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Daniel W. McClary |
Locating and detecting arrays for interaction faults. |
J. Comb. Optim. |
2008 |
DBLP DOI BibTeX RDF |
Disjunct matrix, Locating array, Defecting array, Covering array, Orthogonal array, Cover-free family, Factorial design |
| 1 | Charles J. Colbourn, Cécile Huybrechts |
Fully gated graphs: Recognition and convex operations. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling |
Constructing strength three covering arrays with augmented annealing. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi |
Minimum embedding of Steiner triple systems into (K4-e)-designs I. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn |
Strength two covering arrays: Existence tables and projection. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk |
Directed complete bipartite graph decompositions: Indirect constructions. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk |
Grooming for two-period optical networks. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk |
Lower bounds for two-period grooming via linear programming duality. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Violet R. Syrotiuk, Charles J. Colbourn, Sruthi Yellamraju |
Rateless forward error correction for topology-transparent scheduling. |
IEEE/ACM Trans. Netw. |
2008 |
DBLP DOI BibTeX RDF |
rateless forward error correction, topology-transparent scheduling, mobile ad hoc networks |
| 1 | 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. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Violet R. Syrotiuk, Zhiqiang Zhang, Charles J. Colbourn |
Transport schemes for topology-transparent scheduling. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Topology-transparent scheduling, Transport protocols, Forward error correction |
| 1 | Charles J. Colbourn, Sudhir Kumar |
Lower bounds on multiple sequence alignment using exact 3-way alignment. |
BMC Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Toni R. Farley, Charles J. Colbourn |
Multiterminal resilience for series-parallel networks. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeow Meng Chee, Charles J. Colbourn |
Constructions for Difference Triangle Sets |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling |
Optimal Memoryless Encoding for Low Power Off-Chip Data Buses |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
The density algorithm for pairwise interaction testing. |
Softw. Test., Verif. Reliab. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kaushik Srinivasan, Charles J. Colbourn |
Failed disk recovery in double erasure RAID arrays. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dukes, Violet R. Syrotiuk, Charles J. Colbourn |
Ternary Schedules for Energy-Limited Sensor Networks. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
One-test-at-a-time heuristic search for interaction test suites. |
GECCO |
2007 |
DBLP DOI BibTeX RDF |
great flood, t-way interaction testing, test suite prioritization, simulated annealing, tabu search, heuristic search, hill climbing, covering arrays, software interaction testing |
| 1 | Michael P. McGarry, Martin Reisslein, Charles J. Colbourn, Martin Maier |
Just-in-Time Online Scheduling for WDM EPONs. |
ICC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Daniel W. McClary |
Detecting and Locating Interaction Faults. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk |
Slot synchronized topology-transparent scheduling for sensor networks. |
Computer Communications |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk |
The effects of synchronization on topology-transparent scheduling. |
Wireless Networks |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Ad hoc networks, Synchronization models |
| 1 | Wensong Chu, Charles J. Colbourn, Peter Dukes |
On constant composition codes. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
Prioritized interaction testing for pair-wise coverage with seeding and constraints. |
Information & Software Technology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
AMS Classification 05B40, 68N30, 05B15 |
| 1 | Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk |
Topology-Transparent Schedules for Energy Limited Ad hoc Networks. |
PerCom Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling |
Optimal memoryless encoding for low power off-chip data buses. |
ICCAD |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, David A. Drake, Wendy J. Myrvold |
Ovals and hyperovals in nets. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi |
Embedding path designs into kite systems. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wensong Chu, Charles J. Colbourn, Solomon W. Golomb |
A Recursive Construction For Regular Difference Triangle Sets. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
Test prioritization for pairwise interaction coverage. |
ACM SIGSOFT Software Engineering Notes |
2005 |
DBLP DOI BibTeX RDF |
biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
| 1 | Wensong Chu, Charles J. Colbourn |
Optimal frequency-hopping sequences via cyclotomy. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
Constructing interaction test suites with greedy algorithms. |
ASE |
2005 |
DBLP DOI BibTeX RDF |
biased covering arrays, t-way interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
| 1 | Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai |
Progressive Ranking and Composition of Web Services Using Covering Arrays. |
WORDS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Renée C. Bryce, Charles J. Colbourn |
Test prioritization for pairwise interaction coverage. |
A-MOST |
2005 |
DBLP DOI BibTeX RDF |
biased covering arrays, pairwise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
| 1 | Renée C. Bryce, Charles J. Colbourn, Myra B. Cohen |
A framework of greedy methods for constructing interaction test suites. |
ICSE |
2005 |
DBLP DOI BibTeX RDF |
pair-wise interaction coverage, greedy algorithm, covering arrays, software interaction testing, mixed-level covering arrays |
| 1 | Dean S. Hoskins, Charles J. Colbourn, Douglas C. Montgomery |
Software performance testing using covering arrays: efficient screening designs with categorical factors. |
WOSP |
2005 |
DBLP DOI BibTeX RDF |
D-optimal designs, performance testing, covering arrays |
| 1 | Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin |
Preface. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wensong Chu, Charles J. Colbourn |
Optimal (n, 4, 2)-OOC of small orders. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu |
Grooming in unidirectional rings: K4-e designs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Violet R. Syrotiuk, Minghao Cui, S. Ramkumar, Charles J. Colbourn |
Dynamic spectrum utilization in ad hoc networks. |
Computer Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Charles J. Colbourn |
Ladder orderings of pairs and RAID performance. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wensong Chu, Charles J. Colbourn, Peter Dukes |
Constructions for Permutation Codes in Powerline Communications. |
Des. Codes Cryptography |
2004 |
DBLP DOI BibTeX RDF |
permutation array, constant composition code, reactive local search, heuristic search, permutation code, permutation polynomial |
| 1 | Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk |
Cover-Free Families and Topology-Transparent Scheduling for MANETs. |
Des. Codes Cryptography |
2004 |
DBLP DOI BibTeX RDF |
Steiner system, disjunct matrix, topology-transparency, mobile ad hoc network, orthogonal array, cover-free family |
| 1 | Wensong Chu, Charles J. Colbourn |
Sequence designs for ultra-wideband impulse radio with optimal correlation properties. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dean S. Hoskins, Renée Turban, Charles J. Colbourn |
Experimental designs in software engineering: d-optimal designs and covering arrays. |
WISER |
2004 |
DBLP DOI BibTeX RDF |
d-optimal designs, factorial experiments, covering arrays |
| 1 | Charles J. Colbourn, Myra B. Cohen, Renée Turban |
A deterministic density algorithm for pairwise interaction coverage. |
IASTED Conf. on Software Engineering |
2004 |
DBLP BibTeX RDF |
|
| 1 | Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk |
Topology Transparent Scheduling, Synchronization, and Maximum Delay. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Minghao Cui, Violet R. Syrotiuk, Charles J. Colbourn |
Securing dynamic spectrum use. |
VTC Fall |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Charles J. Colbourn |
Optimal and pessimal orderings of Steiner triple systems in disk arrays. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alan C. H. Ling |
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek |
Preface. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alexander Rosa |
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn, James S. Collofello |
Variable Strength Interaction Testing of Components. |
COMPSAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Violet R. Syrotiuk, Alan C. H. Ling |
Steiner Systems for Topology-Transparent Access Control in MANETs. |
ADHOC-NOW |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling |
Topology-transparent scheduling for MANETs using orthogonal arrays. |
DIALM-POMC |
2003 |
DBLP DOI BibTeX RDF |
topology-transparency, scheduling, mobile ad hoc networks, medium access control, orthogonal array |
| 1 | Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling |
Augmenting Simulated Annealing to Build Interaction Test Suites. |
ISSRE |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn |
Constructing Test Suites for Interaction Testing. (PDF / PS) |
ICSE |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Manish K. Gupta |
On Quaternary MacDonald Codes. |
ITCC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Alan C. H. Ling, Martin Tompa |
Construction of optimal quality control for oligo arrays. |
Bioinformatics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn |
Projective planes and congestion-free networks. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Feliu Sagols, Charles J. Colbourn |
NS1D0 Sequences and Anti-Pasch Steiner Triple Systems. |
Ars Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP BibTeX RDF |
|
| 1 | Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees |
Preface: In Honour of Ronald C. Mullin. |
Des. Codes Cryptography |
2002 |
DBLP BibTeX RDF |
|
| 1 | Charles J. Colbourn, Hao Shen |
Preface. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Feliu Sagols |
Triangulations and a generalization of Bose's method. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Peng-Jun Wan |
Minimizing drop cost for SONET/WDM networks with wavelength requirements. |
Networks |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson |
Quorum Systems Constructed from Combinatorial Designs. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa |
Equireplicate Balanced Binary Codes for Oligo Arrays. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Charles J. Colbourn |
Ordering disks for double erasure codes. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek |
Cluttered Orderings for the Complete Graph. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")