![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Charles J. Colbourn
Person information
- affiliation: Arizona State University, Tempe, School of Computing, Informatics and Decision Systems Engineering
- affiliation: University of Waterloo, Department of Computer Science, University of Waterloo
- award (2003): Euler Medal
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1980
- [b1]Charles J. Colbourn:
The complexity of graph isomorphism and related problems. University of Toronto, Canada, 1980
Journal Articles
- 2024
- [j247]Charles J. Colbourn, Violet R. Syrotiuk:
Detecting arrays for effects of multiple interacting factors. Inf. Comput. 301: 105202 (2024) - [j246]Charles J. Colbourn
:
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN Comput. Sci. 5(2): 247 (2024) - 2023
- [j245]Dylan Lusi, Charles J. Colbourn
:
The spectrum of resolvable Bose triple systems. Discret. Math. 346(7): 113396 (2023) - [j244]Ryan E. Dougherty
, Kristoffer Kleine, Michael Wagner
, Charles J. Colbourn, Dimitris E. Simos
:
Algorithmic methods for covering arrays of higher index. J. Comb. Optim. 45(1): 28 (2023) - 2022
- [j243]Michael Wagner, Charles J. Colbourn, Dimitris E. Simos:
In-Parameter-Order strategies for covering perfect hash families. Appl. Math. Comput. 421: 126952 (2022) - [j242]Charles J. Colbourn
:
Egalitarian Steiner quadruple systems of doubly even order. Discret. Math. 345(7): 112887 (2022) - [j241]Soumen Maity, Charles J. Colbourn:
Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. 14(1): 2150085:1-2150085:15 (2022) - 2021
- [j240]Charles J. Colbourn
:
Egalitarian Steiner triple systems for data popularity. Des. Codes Cryptogr. 89(10): 2373-2395 (2021) - [j239]Charles J. Colbourn
:
Egalitarian Edge Orderings of Complete Graphs. Graphs Comb. 37(4): 1405-1413 (2021) - [j238]Jason I. Brown
, Charles J. Colbourn, Danielle Cox, Christina Graves
, Lucas Mol
:
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - 2020
- [j237]Yeow Meng Chee
, Charles J. Colbourn
, Hoang Dau
, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access balancing in storage systems by labeling partial Steiner systems. Des. Codes Cryptogr. 88(11): 2361-2376 (2020) - [j236]Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley
, Junling Zhou:
New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. 90: 103165 (2020) - [j235]Nadia Pisanti, Charles J. Colbourn, Roberto Grossi:
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. 64(7): 1155-1157 (2020) - [j234]Ryan Gabrys
, Son Hoang Dau
, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. SIAM J. Discret. Math. 34(2): 1148-1171 (2020) - 2019
- [j233]Matthew J. Mellott, Domenico Garlisi
, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello:
Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation. Comput. Commun. 145: 273-283 (2019) - [j232]Charles J. Colbourn, Douglas R. Stinson
, Shannon Veitch
:
Constructions of optimal orthogonal arrays with repeated rows. Discret. Math. 342(9): 2455-2466 (2019) - [j231]Charles J. Colbourn, Ryan E. Dougherty
, Daniel Horsley
:
Distributing hash families with few rows. Theor. Comput. Sci. 800: 31-41 (2019) - 2018
- [j230]Charles J. Colbourn, Erin Lanus:
Subspace restrictions and affine composition for covering perfect hash families. Art Discret. Appl. Math. 1(2): #P2.03 (2018) - [j229]Charles J. Colbourn, Daniel Horsley
, Violet R. Syrotiuk:
A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. 236: 96-107 (2018) - [j228]Charles J. Colbourn, Erin Lanus, Kaushik Sarkar:
Asymptotic and constructive methods for covering perfect hash families and covering arrays. Des. Codes Cryptogr. 86(4): 907-937 (2018) - [j227]Charles J. Colbourn, Ryan E. Dougherty
:
Fractal Perfect Hash Families (Extended Abstract). Electron. Notes Discret. Math. 65: 37-42 (2018) - [j226]Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan
, Charles J. Colbourn:
Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. 34(1): 223-239 (2018) - [j225]Charles J. Colbourn, Violet R. Syrotiuk:
On a Combinatorial Framework for Fault Characterization. Math. Comput. Sci. 12(4): 429-451 (2018) - [j224]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. Theory Comput. Syst. 62(6): 1470-1489 (2018) - [j223]Guanqiu Qi
, Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Zhiqin Zhu
:
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing. IEEE Trans. Reliab. 67(3): 802-831 (2018) - 2017
- [j222]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Variable-weight topology-transparent scheduling. Comput. Networks 122: 16-28 (2017) - [j221]Kaushik Sarkar, Charles J. Colbourn:
Upper Bounds on the Size of Covering Arrays. SIAM J. Discret. Math. 31(2): 1277-1293 (2017) - [j220]Darryn E. Bryant
, Charles J. Colbourn, Daniel Horsley
, Ian M. Wanless:
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31(4): 2603-2611 (2017) - [j219]Darryn E. Bryant
, Charles J. Colbourn, Daniel Horsley
, Padraig Ó Catháin
:
Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory 63(8): 4850-4859 (2017) - 2016
- [j218]Charles J. Colbourn, Bingli Fan, Daniel Horsley
:
Disjoint Spread Systems and Fault Location. SIAM J. Discret. Math. 30(4): 2011-2026 (2016) - 2015
- [j217]Charles J. Colbourn, Maria De Lourdes Merlini Giuliani, Alexander Rosa, Izabella Stuhl:
Steiner loops satisfying Moufang's theorem. Australas. J Comb. 63: 170-181 (2015) - [j216]Yeow Meng Chee
, Charles J. Colbourn, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang:
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses. Des. Codes Cryptogr. 77(2-3): 479-491 (2015) - [j215]Charles J. Colbourn:
Augmentation of Covering Arrays of Strength Two. Graphs Comb. 31(6): 2137-2147 (2015) - [j214]Changhai Nie, Huayao Wu, Xintao Niu, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn:
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures. Inf. Softw. Technol. 62: 198-213 (2015) - [j213]Shi-Wei Gao, Jianghua Lv, Bing-Lei Du, Charles J. Colbourn, Shilong Ma:
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm. J. Comput. Sci. Technol. 30(5): 957-968 (2015) - [j212]Abraham N. Aldaco
, Charles J. Colbourn, Violet R. Syrotiuk:
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems. ACM SIGOPS Oper. Syst. Rev. 49(1): 31-40 (2015) - [j211]Huayao Wu, Changhai Nie, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn:
A Discrete Particle Swarm Optimization for Covering Array Generation. IEEE Trans. Evol. Comput. 19(4): 575-591 (2015) - 2014
- [j210]Charles J. Colbourn, Melissa S. Keranen, Donald L. Kreher
:
f-vectors of pure complexes and pure multicomplexes of rank three. Discret. Math. 320: 26-39 (2014) - [j209]Charles J. Colbourn:
Covering arrays, augmentation, and quilting arrays. Discret. Math. Algorithms Appl. 6(3) (2014) - [j208]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
ATLAS: Adaptive Topology- andLoad-Aware Scheduling. IEEE Trans. Mob. Comput. 13(10): 2255-2268 (2014) - 2013
- [j207]Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
:
Randomized post-optimization of covering arrays. Eur. J. Comb. 34(1): 91-103 (2013) - [j206]Chengmin Wang, Charles J. Colbourn:
The Existence of (K 2 × K 6)-Designs. Graphs Comb. 29(5): 1557-1567 (2013) - [j205]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. J. Am. Medical Informatics Assoc. 20(1): 128-133 (2013) - [j204]Yeow Meng Chee
, Charles J. Colbourn, Alan C. H. Ling, Richard M. Wilson:
Covering and packing for pairs. J. Comb. Theory A 120(7): 1440-1449 (2013) - [j203]Yeow Meng Chee
, Charles J. Colbourn, Daniel Horsley
, Junling Zhou:
Sequence Covering Arrays. SIAM J. Discret. Math. 27(4): 1844-1861 (2013) - [j202]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Topological Persistence for Medium Access Control. IEEE Trans. Mob. Comput. 12(8): 1598-1612 (2013) - 2012
- [j201]Charles J. Colbourn, Daniel Horsley
, Chengmin Wang:
Trails of triples in partial triple systems. Des. Codes Cryptogr. 65(3): 199-212 (2012) - [j200]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming traffic to minimize load. Discret. Math. 312(3): 536-544 (2012) - [j199]Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez
:
Cover starters for covering arrays of strength two. Discret. Math. 312(5): 943-956 (2012) - [j198]Charles J. Colbourn, Daniel Horsley
, Violet R. Syrotiuk:
Strengthening hash families and compressive sensing. J. Discrete Algorithms 16: 170-186 (2012) - 2011
- [j197]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio nine. Discret. Math. 311(1): 8-15 (2011) - [j196]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. Discret. Math. 311(10-11): 827-834 (2011) - [j195]Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming Traffic to Maximize Throughput in SONET Rings. JOCN 3(1): 10-16 (2011) - [j194]Charles J. Colbourn, Daniel Horsley
, Christopher McLean:
Compressive Sensing Matrices and Hash Families. IEEE Trans. Commun. 59(7): 1840-1845 (2011) - 2010
- [j193]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. Electron. J. Comb. 17(1) (2010) - [j192]Charles J. Colbourn, Gerzson Kéri
, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta:
Covering and radius-covering arrays: Constructions and classification. Discret. Appl. Math. 158(11): 1158-1180 (2010) - [j191]Charles J. Colbourn:
Covering arrays from cyclotomy. Des. Codes Cryptogr. 55(2-3): 201-219 (2010) - [j190]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. Discret. Math. 24(2): 400-419 (2010) - [j189]Yuichiro Fujiwara
, Charles J. Colbourn:
A combinatorial approach to X-tolerant compaction circuits. IEEE Trans. Inf. Theory 56(7): 3196-3206 (2010) - 2009
- [j188]Charles J. Colbourn, Yuichiro Fujiwara
:
Small stopping sets in Steiner triple systems. Cryptogr. Commun. 1(1): 31-46 (2009) - [j187]Andreas H. Ronneseth, Charles J. Colbourn:
Merging covering arrays and compressing multiple sequence alignments. Discret. Appl. Math. 157(9): 2177-2190 (2009) - [j186]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio eight. Discret. Appl. Math. 157(13): 2763-2772 (2009) - [j185]Charles J. Colbourn, Alan C. H. Ling:
Linear hash families and forbidden configurations. Des. Codes Cryptogr. 52(1): 25-55 (2009) - [j184]Jason I. Brown
, Charles J. Colbourn, Richard J. Nowakowski
:
Chip firing and all-terminal network reliability bounds. Discret. Optim. 6(4): 436-445 (2009) - [j183]Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs II. Discret. Math. 309(2): 400-411 (2009) - [j182]Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Graph designs for the eight-edge five-vertex graphs. Discret. Math. 309(22): 6440-6445 (2009) - [j181]Toni R. Farley, Charles J. Colbourn:
Multi-Terminal Network Connectedness on Series-Parallel Networks. Discret. Math. Algorithms Appl. 1(2): 253-266 (2009) - [j180]Charles J. Colbourn, Alan C. H. Ling:
A recursive construction for perfect hash families. J. Math. Cryptol. 3(4): 291-306 (2009) - [j179]Renée C. Bryce, Charles J. Colbourn:
A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verification Reliab. 19(1): 37-53 (2009) - 2008
- [j178]Peter Dukes
, Charles J. Colbourn, Violet R. Syrotiuk:
Directed complete bipartite graph decompositions: Indirect constructions. Discret. Math. 308(2-3): 367-374 (2008) - [j177]Charles J. Colbourn:
Strength two covering arrays: Existence tables and projection. Discret. Math. 308(5-6): 772-786 (2008) - [j176]Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling:
Constructing strength three covering arrays with augmented annealing. Discret. Math. 308(13): 2709-2722 (2008) - [j175]Charles J. Colbourn, Cécile Huybrechts:
Fully gated graphs: Recognition and convex operations. Discret. Math. 308(22): 5184-5195 (2008) - [j174]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs I. Discret. Math. 308(22): 5308-5311 (2008) - [j173]Charles J. Colbourn, Daniel W. McClary:
Locating and detecting arrays for interaction faults. J. Comb. Optim. 15(1): 17-48 (2008) - [j172]Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Lower bounds for two-period grooming via linear programming duality. Networks 52(4): 299-306 (2008) - [j171]Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk:
Grooming for two-period optical networks. Networks 52(4): 307-324 (2008) - [j170]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. Discret. Math. 23(1): 109-122 (2008) - [j169]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) - 2007
- [j168]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) - [j167]Charles J. Colbourn, Sudhir Kumar
:
Lower bounds on multiple sequence alignment using exact 3-way alignment. BMC Bioinform. 8 (2007) - [j166]Renée C. Bryce, Yinong Chen
, Charles J. Colbourn:
Biased covering arrays for progressive ranking and composition of Web Services. Int. J. Simul. Process. Model. 3(1/2): 80-87 (2007) - [j165]Violet R. Syrotiuk, Zhiqiang Zhang, Charles J. Colbourn:
Transport schemes for topology-transparent scheduling. J. Comb. Optim. 14(2-3): 229-248 (2007) - [j164]Kaushik Srinivasan, Charles J. Colbourn:
Failed disk recovery in double erasure RAID arrays. J. Discrete Algorithms 5(1): 115-128 (2007) - [j163]Robert A. Walker, Charles J. Colbourn:
Perfect Hash Families: Constructions and Existence. J. Math. Cryptol. 1(2): 125-150 (2007) - [j162]Toni R. Farley, Charles J. Colbourn:
Multiterminal resilience for series-parallel networks. Networks 50(2): 164-172 (2007) - [j161]Renée C. Bryce, Charles J. Colbourn:
The density algorithm for pairwise interaction testing. Softw. Test. Verification Reliab. 17(3): 159-182 (2007) - [j160]Peter Dukes
, Violet R. Syrotiuk, Charles J. Colbourn:
Ternary Schedules for Energy-Limited Sensor Networks. IEEE Trans. Inf. Theory 53(8): 2791-2798 (2007) - 2006
- [j159]Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk:
Slot synchronized topology-transparent scheduling for sensor networks. Comput. Commun. 29(4): 421-428 (2006) - [j158]Wensong Chu, Charles J. Colbourn, Peter Dukes
:
On constant composition codes. Discret. Appl. Math. 154(6): 912-929 (2006) - [j157]Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker:
Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr. 41(1): 33-57 (2006) - [j156]Charles J. Colbourn, Daniel W. McClary:
Detecting and Locating Interaction Faults. Electron. Notes Discret. Math. 27: 17-18 (2006) - [j155]Renée C. Bryce, Charles J. Colbourn:
Prioritized interaction testing for pair-wise coverage with seeding and constraints. Inf. Softw. Technol. 48(10): 960-970 (2006) - [j154]Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk:
The effects of synchronization on topology-transparent scheduling. Wirel. Networks 12(6): 681-690 (2006) - 2005
- [j153]Charles J. Colbourn, David A. Drake, Wendy J. Myrvold
:
Ovals and hyperovals in nets. Discret. Math. 294(1-2): 53-74 (2005) - [j152]Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi:
Embedding path designs into kite systems. Discret. Math. 297(1-3): 38-48 (2005) - [j151]Wensong Chu, Charles J. Colbourn, Solomon W. Golomb:
A Recursive Construction For Regular Difference Triangle Sets. SIAM J. Discret. Math. 18(4): 741-748 (2005) - [j150]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. Discret. Math. 19(2): 523-542 (2005) - [j149]Renée C. Bryce, Charles J. Colbourn:
Test prioritization for pairwise interaction coverage. ACM SIGSOFT Softw. Eng. Notes 30(4): 1-7 (2005) - [j148]Wensong Chu, Charles J. Colbourn:
Optimal frequency-hopping sequences via cyclotomy. IEEE Trans. Inf. Theory 51(3): 1139-1141 (2005) - 2004
- [j147]Violet R. Syrotiuk, Minghao Cui, S. Ramkumar, Charles J. Colbourn:
Dynamic spectrum utilization in ad hoc networks. Comput. Networks 46(5): 665-678 (2004) - [j146]Myra B. Cohen, Charles J. Colbourn:
Ladder orderings of pairs and RAID performance. Discret. Appl. Math. 138(1-2): 35-46 (2004) - [j145]Wensong Chu, Charles J. Colbourn, Peter Dukes
:
Constructions for Permutation Codes in Powerline Communications. Des. Codes Cryptogr. 32(1-3): 51-64 (2004) - [j144]Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk:
Cover-Free Families and Topology-Transparent Scheduling for MANETs. Des. Codes Cryptogr. 32(1-3): 65-95 (2004) - [j143]Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin:
Preface. Discret. Math. 279(1-3): 1-2 (2004) - [j142]Wensong Chu, Charles J. Colbourn:
Optimal (n, 4, 2)-OOC of small orders. Discret. Math. 279(1-3): 163-172 (2004) - [j141]Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu:
Grooming in unidirectional rings: K4-e designs. Discret. Math. 284(1-3): 57-62 (2004) - [j140]Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling:
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. IEEE Trans. Inf. Theory 50(6): 1289-1291 (2004) - [j139]Wensong Chu, Charles J. Colbourn:
Sequence designs for ultra-wideband impulse radio with optimal correlation properties. IEEE Trans. Inf. Theory 50(10): 2402-2407 (2004) - 2003
- [j138]Charles J. Colbourn, Gaetano Quattrocchi, Alexander Rosa:
Resolving P(v, 3, λ) designs into regular P3-configurations. Australas. J Comb. 27: 205-212 (2003) - [j137]Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek
:
Preface. Discret. Math. 261(1-3): 1-2 (2003) - [j136]Charles J. Colbourn, Alan C. H. Ling:
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. Discret. Math. 261(1-3): 141-156 (2003) - [j135]Charles J. Colbourn, Alexander Rosa:
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs Comb. 19(3): 335-345 (2003) - [j134]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
- [j133]Feliu Sagols, Charles J. Colbourn:
NS1D0 Sequences and Anti-Pasch Steiner Triple Systems. Ars Comb. 62 (2002) - [j132]Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Construction of optimal quality control for oligo arrays. Bioinform. 18(4): 529-535 (2002) - [j131]Charles J. Colbourn:
Projective planes and congestion-free networks. Discret. Appl. Math. 122(1-3): 117-126 (2002) - [j130]Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees:
Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptogr. 26(1-3): 5-6 (2002) - [j129]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 Cryptogr. 26(1-3): 169-196 (2002) - [j128]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
- [j127]Charles J. Colbourn, Alan C. H. Ling:
(M, S)-optimal designs with block size three. Australas. J Comb. 23: 171-180 (2001) - [j126]Charles J. Colbourn, Feliu Sagols:
Triangulations and a generalization of Bose's method. Discret. Math. 237(1-3): 97-107 (2001) - [j125]Charles J. Colbourn, Hao Shen:
Preface. Discret. Math. 238(1-3): 1- (2001) - [j124]Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson:
Quorum Systems Constructed from Combinatorial Designs. Inf. Comput. 169(2): 160-173 (2001) - [j123]Charles J. Colbourn, Peng-Jun Wan:
Minimizing drop cost for SONET/WDM networks with wavelength requirements. Networks 37(2): 107-116 (2001) - [j122]Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. 14(4): 481-497 (2001) - 2000
- [j121]Charles J. Colbourn, Hadi Kharaghani:
Coding, Cryptography, and Computer Security - Preface. Discret. Appl. Math. 102(1-2): 1 (2000) - [j120]Yeow Meng Chee
, Charles J. Colbourn, Alan C. H. Ling:
Asymptotically optimal erasure-resilient codes for large disk arrays. Discret. Appl. Math. 102(1-2): 3-36 (2000) - [j119]Charles J. Colbourn, Sufang Zhao:
Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems. Des. Codes Cryptogr. 20(3): 219-227 (2000) - [j118]Alan C. H. Ling, Charles J. Colbourn:
Modified group divisible designs with block size four. Discret. Math. 219(1-3): 207-221 (2000) - [j117]Charles J. Colbourn, Alan C. H. Ling:
Quorums from difference covers. Inf. Process. Lett. 75(1-2): 9-12 (2000) - [j116]Aiden A. Bruen, Charles J. Colbourn:
Transversal Designs in Classical Planes and Spaces. J. Comb. Theory A 92(1): 88-94 (2000) - [j115]Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan:
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. J. Graph Theory 33(2): 83-93 (2000) - 1999
- [j114]Charles J. Colbourn, Alan C. H. Ling:
Balanced sampling plans with block size four excluding contiguous units. Australas. J Comb. 20: 37-46 (1999) - [j113]Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa:
Bicoloring Steiner Triple Systems. Electron. J. Comb. 6 (1999) - [j112]M. A. Chateauneuf, Charles J. Colbourn, Donald L. Kreher
:
Covering Arrays of Strength Three. Des. Codes Cryptogr. 16(3): 235-242 (1999) - [j111]Charles J. Colbourn, Alan C. H. Ling:
Kirkman school project designs. Discret. Math. 203(1-3): 49-60 (1999) - 1998
- [j110]Charles J. Colbourn, Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. 50 (1998) - [j109]Alan C. H. Ling, Charles J. Colbourn:
Deleting Lines in Projective Planes. Ars Comb. 50 (1998) - [j108]Charles J. Colbourn, Alan C. H. Ling:
Point Code Minimum Steiner Triple Systems. Des. Codes Cryptogr. 14(2): 141-146 (1998) - [j107]Zhike Jiang, Charles J. Colbourn:
Completing the spectrum of rotational Mendelsohn triple systems. Discret. Math. 183(1-3): 153-160 (1998) - [j106]Robert P. Gallant, Charles J. Colbourn:
Tight 4-factor orthogonal main effect plans. Discret. Math. 184(1-3): 101-110 (1998) - [j105]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
- [j104]Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin:
Pairwise Balanced Designs with Consecutive Block Sizes. Des. Codes Cryptogr. 10(2): 203-222 (1997) - [j103]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 Cryptogr. 10(3): 275-307 (1997) - [j102]Charles J. Colbourn, Alan C. H. Ling:
Pairwise Balanced Designs with Block Sizes 8, 9, and 10. J. Comb. Theory A 77(2): 228-245 (1997) - [j101]Charles J. Colbourn, Lucien Haddad, Václav Linek:
Balanced Steiner Triple Systems. J. Comb. Theory A 78(2): 292-302 (1997) - [j100]Charles J. Colbourn, Jeffrey H. Dinitz:
Complete Arcs in Steiner Triple Systems. J. Comb. Theory A 80(2): 320-333 (1997) - [j99]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) - [j98]Yeow Meng Chee
, Charles J. Colbourn:
Constructions for difference triangle sets. IEEE Trans. Inf. Theory 43(4): 1346-1349 (1997) - 1996
- [j97]Charles J. Colbourn, Donald L. Kreher:
Concerning Difference Matrices. Des. Codes Cryptogr. 9(1): 61-70 (1996) - [j96]Frank E. Bennett, Charles J. Colbourn, Lie Zhu:
Existence of three HMOLS of types hn and 2n31. Discret. Math. 160(1-3): 49-65 (1996) - [j95]Charles J. Colbourn:
Transversal Designs of Block Size Eight and Nine. Eur. J. Comb. 17(1): 1-14 (1996) - [j94]Charles J. Colbourn, Wendy J. Myrvold
, Eugene Neufeld:
Two Algorithms for Unranking Arborescences. J. Algorithms 20(2): 268-281 (1996) - [j93]Charles J. Colbourn, Lucien Haddad, Václav Linek:
Equitable Embeddings of Steiner Triple Systems. J. Comb. Theory A 73(2): 229-247 (1996) - [j92]Jason I. Brown
, Charles J. Colbourn, David G. Wagner:
Cohen-Macaulay Rings in Network Reliability. SIAM J. Discret. Math. 9(3): 377-392 (1996) - 1995
- [j91]Charles J. Colbourn, Lie Zhu:
Existence of six incomplete MOLS. Australas. J Comb. 12: 175-192 (1995) - [j90]Charles J. Colbourn, Alexander Rosa:
Orthogonal resolutions of triple systems. Australas. J Comb. 12: 259-270 (1995) - [j89]Charles J. Colbourn, J. Scott Provan, Dirk Vertigan:
The Complexity of Computing the Tutte Polynomial on Transversal Matroids. Comb. 15(1): 1-10 (1995) - [j88]Charles J. Colbourn, J. Scott Provan, Dirk Vertigan:
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. Discret. Appl. Math. 60(1-3): 119-129 (1995) - [j87]Charles J. Colbourn, Jeffrey H. Dinitz, Mieczyslaw Wojtas:
Thwarts in Transversal Designs. Des. Codes Cryptogr. 5(3): 189-197 (1995) - [j86]Charles J. Colbourn, Charles A. Cusack, Donald L. Kreher:
Partial Steiner Triple Systems with Equal-Sized Holes. J. Comb. Theory A 70(1): 56-65 (1995) - [j85]Charles J. Colbourn, Klaus Sutner:
Preface. Networks 25(3): 99 (1995) - [j84]Heidi J. Strayer, Charles J. Colbourn:
Consecutive cuts and paths, and bounds on k-terminal reliability. Networks 25(3): 165-175 (1995) - 1994
- [j83]Charles J. Colbourn, Louis D. Nel, T. Brian Boffey, Derek F. Yates:
Network reliability and the probabilistic estimation of damage from fire spread. Ann. Oper. Res. 50(1): 173-185 (1994) - [j82]Paul L. Check, Charles J. Colbourn:
Concerning difference families with block size four. Discret. Math. 133(1-3): 285-289 (1994) - [j81]Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán:
Anti-mitre steiner triple systems. Graphs Comb. 10(2-4): 215-224 (1994) - 1993
- [j80]Miro Kraetzl, Charles J. Colbourn:
Threshold Channel Graphs. Comb. Probab. Comput. 2: 337-349 (1993) - [j79]Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner:
Computing Residual Connectedness Reliability for Restricted Networks. Discret. Appl. Math. 44(1-3): 221-232 (1993) - [j78]Charles J. Colbourn, Alexander Rosa, Stefan Znám:
The Spectrum of Maximal Partial Steiner Triple Systems. Des. Codes Cryptogr. 3(3): 209-219 (1993) - [j77]Charles J. Colbourn, Ehab S. Elmallah:
Reliable assignments of processors to tasks and factoring on matroids. Discret. Math. 114(1-3): 115-129 (1993) - [j76]Charles J. Colbourn, Ebadollah S. Mahmoodian:
Support sizes of sixfold triple systems. Discret. Math. 115(1-3): 103-131 (1993) - [j75]G. Ronning, D. Wagner, Michael M. Richter, Rainer Hettich, Charles J. Colbourn:
Book reviews. ZOR Methods Model. Oper. Res. 38(1): 101-108 (1993) - [j74]Jason I. Brown
, Charles J. Colbourn, John S. Devitt:
Network transformations and bounding network reliability. Networks 23(1): 1-17 (1993) - [j73]Daryl D. Harms, Charles J. Colbourn:
Renormalization of two - terminal reliability. Networks 23(4): 289-297 (1993) - [j72]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) - [j71]Miro Kraetzl, Charles J. Colbourn:
Transformations on channel graphs. IEEE Trans. Commun. 41(5): 664-666 (1993) - [j70]Charles J. Colbourn, Daryl D. Harms:
Evaluating performability: Most probable states and bounds. Telecommun. Syst. 2(1): 275-300 (1993) - 1992
- [j69]Charles J. Colbourn:
A Note on Bounding k-Terminal Reliability. Algorithmica 7(2&3): 303-307 (1992) - [j68]Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger
, Vladimir D. Tonchev
:
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. Des. Codes Cryptogr. 2(3): 237-251 (1992) - [j67]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) - [j66]Charles J. Colbourn, Dean G. Hoffman, Rolf S. Rees:
A New Class of Group Divisible Designs with Block Size Three. J. Comb. Theory A 59(1): 73-89 (1992) - [j65]Charles J. Colbourn, Charles C. Lindner:
Support Sizes of Triple Systems. J. Comb. Theory A 61(2): 193-210 (1992) - [j64]Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of the complete directed graph. J. Graph Theory 16(5): 517-528 (1992) - [j63]Charles J. Colbourn, Katherine Heinrich:
Conflict-Free Access to Parallel Memories. J. Parallel Distributed Comput. 14(2): 193-200 (1992) - [j62]Ehab S. Elmallah, Charles J. Colbourn:
Series-parallel subgraphs of planar graphs. Networks 22(6): 607-614 (1992) - [j61]Jason I. Brown, Charles J. Colbourn:
Roots of the Reliability Polynomial. SIAM J. Discret. Math. 5(4): 571-585 (1992) - 1991
- [j60]Charles J. Colbourn, Rudolf Mathon, Nabil Shalaby:
The fine structure of threefold triple systems: v≡5(mod 6). Australas. J Comb. 3: 75-92 (1991) - [j59]Charles J. Colbourn, Alexander Rosa:
Leaves, excesses and neighbourhoods in triple systems. Australas. J Comb. 4: 143-178 (1991) - [j58]Charles J. Colbourn:
Combinatorial aspects of network reliability. Ann. Oper. Res. 33(1): 1-15 (1991) - [j57]Charles J. Colbourn:
Network reliability: Numbers or insight? - A discussion paper. Ann. Oper. Res. 33(2): 85-93 (1991) - [j56]Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler
:
The number of t-wise balance designs. Comb. 11(3): 207-218 (1991) - [j55]Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa:
Partitioning Steiner triple systems into complete arcs. Discret. Math. 89(2): 149-160 (1991) - [j54]Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby:
The fine structure of threefold triple systems: u = 1 or 3 (mod 6). Discret. Math. 92(1-3): 49-64 (1991) - [j53]Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa:
Preface. Discret. Math. 97(1-3): 1 (1991) - [j52]Charles J. Colbourn, Alan Hartman
:
Intersections and supports of quadruple systems. Discret. Math. 97(1-3): 119-137 (1991) - [j51]Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of directed multigraphs. Discret. Math. 97(1-3): 139-148 (1991) - [j50]Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson:
Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory A 57(1): 46-59 (1991) - 1990
- [j49]Yeow Meng Chee, Charles J. Colbourn, Steven Furino, Donald L. Kreher:
Large sets of disjoint t-designs. Australas. J Comb. 2: 111-120 (1990) - [j48]Janelle J. Harms, Charles J. Colbourn:
Probabilistic single processor scheduling. Discret. Appl. Math. 27(1-2): 101-112 (1990) - [j47]Ehab S. Elmallah, Charles J. Colbourn:
On two dual classes of planar graphs. Discret. Math. 80(1): 21-40 (1990) - [j46]Charles J. Colbourn, Ebadollah S. Mahmoodian:
The spectrum of support sizes for threefold triple systems. Discret. Math. 83(1): 9-19 (1990) - [j45]Brent N. Clark, Charles J. Colbourn, David S. Johnson:
Unit disk graphs. Discret. Math. 86(1-3): 165-177 (1990) - [j44]Charles J. Colbourn, Lorna K. Stewart:
Permutation graphs: Connected domination and Steiner trees. Discret. Math. 86(1-3): 179-189 (1990) - [j43]Charles J. Colbourn, Alexander Rosa:
Repeated edges in 2-factorizations. J. Graph Theory 14(1): 5-24 (1990) - [j42]Louis D. Nel, Charles J. Colbourn:
Combining monte carlo estimates and bounds for network reliability. Networks 20(3): 277-298 (1990) - [j41]Hosam M. Aboelfotoh, Charles J. Colbourn:
Efficient algorithms for computing the reliability of permutation and interval graphs. Networks 20(7): 883-898 (1990) - 1989
- [j40]Charles J. Colbourn, Paul C. van Oorschot
:
Applications of Combinatorial Designs in Computer Science. ACM Comput. Surv. 21(2): 223-250 (1989) - [j39]Charles J. Colbourn, Vojtech Rödl:
Percentages in pairwise balanced designs. Discret. Math. 77(1-3): 57-63 (1989) - [j38]Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa:
Hybrid triple systems and cubic feedback sets. Graphs Comb. 5(1): 15-28 (1989) - [j37]Hosam M. Aboelfotoh, Charles J. Colbourn:
Series-Parallel Bounds for the Two-Terminal Reliability Problem. INFORMS J. Comput. 1(4): 209-222 (1989) - [j36]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) - [j35]Charles J. Colbourn, William R. Pulleyblank:
Matroid Steiner problems, the Tutte polynomial and network reliability. J. Comb. Theory B 47(1): 20-31 (1989) - [j34]Charles J. Colbourn:
Simple neighbourhoods in triple systems. J. Comb. Theory A 52(1): 10-19 (1989) - [j33]Timothy B. Brecht, Charles J. Colbourn:
Multiplicative improvements in network reliability bounds. Networks 19(5): 521-529 (1989) - 1988
- [j32]Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa:
The strong chromatic number of partial triple systems. Discret. Appl. Math. 20(1): 31-38 (1988) - [j31]Timothy B. Brecht, Charles J. Colbourn:
Lower bounds on two-terminal network reliability. Discret. Appl. Math. 21(3): 185-198 (1988) - [j30]Charles J. Colbourn:
Problem 94. Discret. Math. 71(1): 93 (1988) - [j29]Charles J. Colbourn:
Edge-packing of graphs and network reliability. Discret. Math. 72(1-3): 49-61 (1988) - [j28]Charles J. Colbourn, Daryl D. Harms:
Bounding all-terminal reliability in computer networks. Networks 18(1): 1-12 (1988) - [j27]Jason I. Brown, Charles J. Colbourn:
A Set System Polynomial with Colouring and Reliability Applications. SIAM J. Discret. Math. 1(2): 151-157 (1988) - 1987
- [j26]Aparna Ramanathan, Charles J. Colbourn:
Counting almost minimum cutsets with reliability applications. Math. Program. 39(3): 253-261 (1987) - 1986
- [j25]Charles J. Colbourn, William L. Kocay, Douglas R. Stinson:
Some NP-complete problems for hypergraph degree sequences. Discret. Appl. Math. 14(3): 239-254 (1986) - [j24]Charles J. Colbourn, Alexander Rosa:
Quadratic leaves of maximal partial triple systems. Graphs Comb. 2(1): 317-337 (1986) - [j23]Timothy B. Brecht, Charles J. Colbourn:
Improving reliability bounds in computer networks. Networks 16(4): 369-380 (1986) - 1985
- [j22]R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald:
Cataloguing the graphs on 10 vertices. J. Graph Theory 9(4): 551-562 (1985) - [j21]Eric Neufeld, Charles J. Colbourn:
The most reliable series-parallel networks. Networks 15(1): 27-32 (1985) - [j20]Ehab S. Elmallah, Charles J. Colbourn:
Optimum Communication Spanning Trees in Series-Parallel Networks. SIAM J. Comput. 14(4): 915-925 (1985) - [j19]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) - 1984
- [j18]Charles J. Colbourn:
The complexity of completing partial Latin squares. Discret. Appl. Math. 8(1): 25-30 (1984) - [j17]Charles J. Colbourn, Asia Ivic Weiss:
A census of regular 3-polystroma arising from honeycombs. Discret. Math. 50: 29-36 (1984) - [j16]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 A 37(3): 363-369 (1984) - 1983
- [j15]Charles J. Colbourn, Marlene J. Colbourn, Alexander Rosa:
Completing small partial triple systems. Discret. Math. 45(2-3): 165-179 (1983) - [j14]Charles J. Colbourn, Marlene J. Colbourn:
Every Twofold Triple System Can Be Directed. J. Comb. Theory A 34(3): 375-378 (1983) - [j13]Charles J. Colbourn:
Embedding Partial Steiner Triple Systems Is NP-Complete. J. Comb. Theory A 35(1): 100-105 (1983) - [j12]Joseph A. Wald, Charles J. Colbourn:
Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13(2): 159-167 (1983) - 1982
- [j11]Charles J. Colbourn:
Computing the Chromatic Index of Steiner Triple Systems. Comput. J. 25(3): 338-339 (1982) - [j10]Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl:
Colouring steiner quadruple systems. Discret. Appl. Math. 4(2): 103-111 (1982) - 1981
- [j9]Marlene J. Colbourn, Charles J. Colbourn:
Concerning the complexity of deciding isomorphism of block designs. Discret. Appl. Math. 3(3): 155-162 (1981) - [j8]Marlene J. Colbourn, Charles J. Colbourn:
Cyclic Block Designs With Block Size 3. Eur. J. Comb. 2(1): 21-26 (1981) - [j7]Charles J. Colbourn:
On testing isomorphism of permutation graphs. Networks 11(1): 13-21 (1981) - [j6]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
- [j5]Charles J. Colbourn, Derek G. Corneil:
On deciding switching equivalence of graphs. Discret. Appl. Math. 2(3): 181-184 (1980) - [j4]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
- [j3]Charles J. Colbourn:
The Complexity of Symmetrizing Matrices. Inf. Process. Lett. 9(3): 108-109 (1979) - [j2]Charles J. Colbourn, Ronald C. Read:
Orderly algorithms for generating restricted classes of graphs. J. Graph Theory 3(2): 187-195 (1979) - 1978
- [j1]Marlene J. Colbourn, Charles J. Colbourn:
Graph isomorphism and self-complementary graphs. SIGACT News 10(1): 25-29 (1978)
Conference and Workshop Papers
- 2023
- [c61]Michael Wagner
, Charles J. Colbourn, Dimitris E. Simos:
Summary of In-Parameter-Order strategies for covering perfect hash families. ICSTW 2023: 268-270 - 2022
- [c60]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT 2022: 2385-2390 - 2020
- [c59]Charles J. Colbourn:
Popularity Block Labelling for Steiner Systems. ACCT 2020: 41-46 - [c58]Yeow Meng Chee
, Charles Joseph Colbourn, Hoang Dau
, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. ISIT 2020: 566-570 - [c57]Erin Lanus
, Charles J. Colbourn
:
Algorithms for Constructing Anonymizing Arrays. IWOCA 2020: 382-394 - 2019
- [c56]Charles J. Colbourn, Violet R. Syrotiuk:
Detecting Arrays for Main Effects. CAI 2019: 112-123 - [c55]Ryan E. Dougherty
, Erin Lanus, Charles J. Colbourn, Stephanie Forrest
:
Genetic algorithms for affine transformations to existential t-restrictions. GECCO (Companion) 2019: 1707-1708 - [c54]Erin Lanus, Charles J. Colbourn, Douglas C. Montgomery:
Partitioned Search with Column Resampling for Locating Array Construction. ICST Workshops 2019: 214-223 - [c53]Ryan Gabrys, Hoang Dau
, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. ISIT 2019: 2359-2363 - [c52]Stephen A. Seidel, Charles J. Colbourn, Violet R. Syrotiuk:
Robustness of Recovery in Locating Array-Based Screening Experiments. SpringSim 2019: 1-12 - 2018
- [c51]Charles J. Colbourn, Ryan E. Dougherty
, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. DLT 2018: 231-242 - [c50]Stephen A. Seidel, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Ingrid Moerman
, Violet R. Syrotiuk:
Analysis of large-scale experimental data from wireless networks. INFOCOM Workshops 2018: 535-540 - [c49]Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk:
Separating Interaction Effects Using Locating and Detecting Arrays. IWOCA 2018: 349-360 - [c48]Matthew J. Mellott, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello:
Testbed Evaluation of Optimized REACT over Multi-hop Paths. WWIC 2018: 134-145 - 2016
- [c47]Charles J. Colbourn, Violet R. Syrotiuk:
Coverage, Location, Detection, and Measurement. ICST Workshops 2016: 19-25 - [c46]Randy Compton, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Violet R. Syrotiuk:
Screening interacting factors in a wireless network testbed using locating arrays. INFOCOM Workshops 2016: 650-655 - [c45]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. IWOCA 2016: 437-448 - 2014
- [c44]Patrick C. Murray, Charles J. Colbourn:
Sequence Covering Arrays and Linear Extensions. IWOCA 2014: 274-285 - 2013
- [c43]Charles J. Colbourn, Peyman Nayeri:
Randomized Post-optimization for t-Restrictions. Information Theory, Combinatorics, and Search Theory 2013: 597-608 - [c42]Wei-Tek Tsai, Qingyang Li, Charles J. Colbourn, Xiaoying Bai:
Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems. IC2E 2013: 183-192 - [c41]Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Guanqiu Qi
, Qingyang Li, Xiaoying Bai:
Test algebra for combinatorial testing. AST 2013: 19-25 - [c40]Changhai Nie, Jing Jiang, Huayao Wu, Hareton Leung
, Charles J. Colbourn:
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation. ICST Workshops 2013: 239-248 - 2012
- [c39]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Variable Weight Sequences for Adaptive Scheduled Access in MANETs. SETA 2012: 53-64 - 2011
- [c38]Renée C. Bryce, Charles J. Colbourn, D. Richard Kuhn:
Finding Interaction Faults Adaptively Using Distance-Based Strategies. ECBS 2011: 4-13 - [c37]Charles J. Colbourn:
Efficient Conditional Expectation Algorithms for Constructing Hash Families. IWOCA 2011: 144-155 - 2010
- [c36]Charles J. Colbourn, Daniel Horsley
, Violet R. Syrotiuk:
Frameproof codes and compressive sensing. Allerton 2010: 985-990 - [c35]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
Apples and oranges: comparing schedule- and contention-based medium access control. MSWiM 2010: 319-326 - 2009
- [c34]Charles J. Colbourn, Gerzson Kéri
:
Binary Covering Arrays and Existentially Closed Graphs. IWCC 2009: 22-33 - [c33]Toni R. Farley, Charles J. Colbourn:
Multiterminal measures for network reliability and resilience. DRCN 2009: 107-114 - [c32]Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
:
Randomized Postoptimization of Covering Arrays. IWOCA 2009: 408-419 - 2007
- [c31]Renée C. Bryce, Charles J. Colbourn:
One-test-at-a-time heuristic search for interaction test suites. GECCO 2007: 1082-1089 - [c30]Michael P. McGarry, Martin Reisslein
, Charles J. Colbourn, Martin Maier:
Just-in-Time Online Scheduling for WDM EPONs. ICC 2007: 2174-2179 - 2006
- [c29]Yeow Meng Chee
, Charles J. Colbourn, Alan C. H. Ling:
Optimal memoryless encoding for low power off-chip data buses. ICCAD 2006: 369-374 - [c28]Peter Dukes
, Charles J. Colbourn, Violet R. Syrotiuk:
Topology-Transparent Schedules for Energy Limited Ad hoc Networks. PerCom Workshops 2006: 85-90 - 2005
- [c27]Renée C. Bryce, Charles J. Colbourn:
Test prioritization for pairwise interaction coverage. A-MOST 2005 - [c26]Renée C. Bryce, Charles J. Colbourn, Myra B. Cohen:
A framework of greedy methods for constructing interaction test suites. ICSE 2005: 146-155 - [c25]Renée C. Bryce, Charles J. Colbourn:
Constructing interaction test suites with greedy algorithms. ASE 2005: 440-443 - [c24]Charles J. Colbourn, Yinong Chen
, Wei-Tek Tsai:
Progressive Ranking and Composition of Web Services Using Covering Arrays. WORDS 2005: 179-185 - [c23]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 - 2004
- [c22]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 - [c21]Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk:
Topology Transparent Scheduling, Synchronization, and Maximum Delay. IPDPS 2004 - [c20]Charles J. Colbourn, Violet R. Syrotiuk:
Scheduled persistence for medium access control in sensor networks. MASS 2004: 264-273 - [c19]Minghao Cui, Violet R. Syrotiuk, Charles J. Colbourn:
Securing dynamic spectrum use. VTC Fall (2) 2004: 1153-1157 - [c18]Dean S. Hoskins, Renée Turban, Charles J. Colbourn:
Experimental designs in software engineering: d-optimal designs and covering arrays. WISER 2004: 55-66 - 2003
- [c17]Charles J. Colbourn, Violet R. Syrotiuk, Alan C. H. Ling:
Steiner Systems for Topology-Transparent Access Control in MANETs. ADHOC-NOW 2003: 247-258 - [c16]Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn, James S. Collofello:
Variable Strength Interaction Testing of Components. COMPSAC 2003: 413- - [c15]Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling:
Topology-transparent scheduling for MANETs using orthogonal arrays. DIALM-POMC 2003: 43-49 - [c14]Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn:
Constructing Test Suites for Interaction Testing. ICSE 2003: 38-48 - [c13]Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling:
Augmenting Simulated Annealing to Build Interaction Test Suites. ISSRE 2003: 394-405 - [c12]Charles J. Colbourn, Manish K. Gupta
:
On Quaternary MacDonald Codes. ITCC 2003: 212-215 - 2001
- [c11]Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek:
Cluttered Orderings for the Complete Graph. COCOON 2001: 420-431 - [c10]Myra B. Cohen, Charles J. Colbourn:
Ordering disks for double erasure codes. SPAA 2001: 229-236 - 2000
- [c9]Charles J. Colbourn:
Multiple Access Communications Using Combinatorial Designs. Theoretical Aspects of Computer Science 2000: 1-29 - [c8]Myra B. Cohen, Charles J. Colbourn:
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. LATIN 2000: 95-104 - 1996
- [c7]Charles J. Colbourn, Jeffrey H. Dinitz:
N(n), v(n): Similarities and Differences. DMTCS 1996: 25-37 - 1994
- [c6]Doreen L. Erickson, Charles J. Colbourn:
Conflict-free access to constant-perimeter, rectangular, subarrays. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 105-124 - 1993
- [c5]Doreen L. Erickson, Charles J. Colbourn:
Conflict-Free Access for the Collections of Templates. PPSC 1993: 949-952 - [c4]Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl:
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract). WDAG 1993: 264-278 - 1992
- [c3]Daryl D. Harms, John S. Devitt, Charles J. Colbourn:
Networks and Reliability in Maple. Computational Support for Discrete Mathematics 1992: 223-243 - 1989
- [c2]Charles J. Colbourn, Eugene I. Litvak:
Bounding Network Parameters by Approximating Graphs. Reliability Of Computer And Communication Networks 1989: 91-104 - 1984
- [c1]Charles J. Colbourn, Andrzej Proskurowski:
Concurrent Transmissions in Broadcast Networks. ICALP 1984: 128-136
Parts in Books or Collections
- 2013
- [p5]Charles J. Colbourn, Jeffrey H. Dinitz:
Block designs. Handbook of Finite Fields 2013: 589-598 - [p4]Jeffrey H. Dinitz, Charles J. Colbourn:
Other combinatorial structures. Handbook of Finite Fields 2013: 607-618 - 2011
- [p3]Charles J. Colbourn:
Covering arrays and hash families. Information Security, Coding Theory and Related Combinatorics 2011: 99-135 - 2010
- [p2]Charles J. Colbourn, Yves Crama, Peter L. Hammer:
Boolean Aspects of Network Reliability. Boolean Models and Methods 2010: 723-759 - 1992
- [p1]John S. Devitt, Charles J. Colbourn:
On Implementing an Environment for Investigating Network reliability. Computer Science and Operations Research 1992: 159-173
Editorship
- 2019
- [e1]Charles J. Colbourn, Roberto Grossi, Nadia Pisanti:
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Lecture Notes in Computer Science 11638, Springer 2019, ISBN 978-3-030-25004-1 [contents]
Reference Works
- 1999
- [r1]Charles J. Colbourn, Jeffrey H. Dinitz:
Combinatorial Designs. Handbook of Discrete and Combinatorial Mathematics 1999
Informal and Other Publications
- 2023
- [i15]Erin Lanus, Charles J. Colbourn, Gail-Joon Ahn:
Guaranteeing Anonymity in Attribute-Based Authorization. CoRR abs/2310.04896 (2023) - 2022
- [i14]Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR abs/2201.09171 (2022) - [i13]Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens:
Sets of mutually orthogoval projective and affine planes. CoRR abs/2210.11961 (2022) - 2019
- [i12]Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. CoRR abs/1901.05559 (2019) - [i11]Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. CoRR abs/1906.12073 (2019) - 2018
- [i10]Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. CoRR abs/1804.11175 (2018) - 2016
- [i9]Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro:
Partial Covering Arrays: Algorithms and Asymptotics. CoRR abs/1605.02131 (2016) - [i8]Kaushik Sarkar, Charles J. Colbourn:
Two-stage algorithms for covering array construction. CoRR abs/1606.06730 (2016) - 2015
- [i7]Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin:
Compressed sensing and designs: theory and simulations. CoRR abs/1503.07424 (2015) - [i6]Yuichiro Fujiwara, Charles J. Colbourn:
A combinatorial approach to X-tolerant compaction circuits. CoRR abs/1508.00481 (2015) - 2014
- [i5]Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk:
Hierarchical Recovery in Compressive Sensing. CoRR abs/1403.1835 (2014) - 2013
- [i4]Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk:
ATLAS: Adaptive Topology- and Load-Aware Scheduling. CoRR abs/1305.4897 (2013) - 2009
- [i3]Charles J. Colbourn, Daniel W. McClary:
Locating and Detecting Arrays for Interaction Faults. Search Methodologies 2009 - 2007
- [i2]Yeow Meng Chee, Charles J. Colbourn:
Constructions for Difference Triangle Sets. CoRR abs/0712.2553 (2007) - [i1]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)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint