Charles J. Colbourn

332 papers A* 4A 6B 7C 9Misc 2Journal 263Unranked 34

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Detecting arrays for effects of multiple interacting factors. Inf. Comput. Charles J. Colbourn, Violet R. Syrotiuk
2024	J	`jnl`	Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN Comput. Sci. Charles J. Colbourn
2024	J	`jnl`	Guaranteeing anonymity in attribute-based authorization. J. Inf. Secur. Appl. Erin Lanus, Charles J. Colbourn, Gail-Joon Ahn
2024	J	`jnl`	Sets of mutually orthogoval projective and affine planes. Comb. Theory Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens
2023	J	`jnl`	Algorithmic methods for covering arrays of higher index. J. Comb. Optim. Ryan E. Dougherty, Kristoffer Kleine, Michael Wagner, Charles J. Colbourn, Dimitris E. Simos
2023	J	`jnl`	Guaranteeing Anonymity in Attribute-Based Authorization. CoRR Erin Lanus, Charles J. Colbourn, Gail-Joon Ahn
2023	—	`conf`	Summary of In-Parameter-Order strategies for covering perfect hash families. ICSTW Michael Wagner, Charles J. Colbourn, Dimitris E. Simos
2023	J	`jnl`	The spectrum of resolvable Bose triple systems. Discret. Math. Dylan Lusi, Charles J. Colbourn
2022	B	`conf`	Balanced and Swap-Robust Trades for Dynamical Distributed Storage. ISIT Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic
2022	J	`jnl`	Balanced and Swap-Robust Trades for Dynamical Distributed Storage. CoRR Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic
2022	J	`jnl`	Egalitarian Steiner quadruple systems of doubly even order. Discret. Math. Charles J. Colbourn
2022	J	`jnl`	In-Parameter-Order strategies for covering perfect hash families. Appl. Math. Comput. Michael Wagner, Charles J. Colbourn, Dimitris E. Simos
2022	J	`jnl`	Mixed covering arrays on graphs of small treewidth. Discret. Math. Algorithms Appl. Soumen Maity, Charles J. Colbourn
2022	J	`jnl`	Sets of mutually orthogoval projective and affine planes. CoRR Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, Ken W. Smith, Brett Stevens
2021	J	`jnl`	Egalitarian Edge Orderings of Complete Graphs. Graphs Comb. Charles J. Colbourn
2021	J	`jnl`	Egalitarian Steiner triple systems for data popularity. Des. Codes Cryptogr. Charles J. Colbourn
2021	J	`jnl`	Network reliability: Heading out on the highway. Networks Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
2020	J	`jnl`	Access balancing in storage systems by labeling partial Steiner systems. Des. Codes Cryptogr. Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic
2020	C	`conf`	Algorithms for Constructing Anonymizing Arrays. IWOCA Erin Lanus, Charles J. Colbourn
2020	J	`jnl`	Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. Nadia Pisanti, Charles J. Colbourn, Roberto Grossi
2020	J	`jnl`	New bounds on the maximum size of Sperner partition systems. Eur. J. Comb. Yanxun Chang, Charles J. Colbourn, Adam Gowty, Daniel Horsley, Junling Zhou
2020	Misc	`conf`	Popularity Block Labelling for Steiner Systems. ACCT Charles J. Colbourn
2020	J	`jnl`	Set-Codes with Small Intersections and Small Discrepancies. SIAM J. Discret. Math. Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic
2019	J	`jnl`	Access Balancing in Storage Systems by Labeling Partial Steiner Systems. CoRR Yeow Meng Chee, Charles J. Colbourn, Hoang Dau, Ryan Gabrys, Alan C. H. Ling, Dylan Lusi, Olgica Milenkovic
2019	C	`ed.`	Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings IWOCA Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
2019	J	`jnl`	Constructions of optimal orthogonal arrays with repeated rows. Discret. Math. Charles J. Colbourn, Douglas R. Stinson, Shannon Veitch
2019	—	`conf`	Detecting Arrays for Main Effects. CAI Charles J. Colbourn, Violet R. Syrotiuk
2019	J	`jnl`	Distributing hash families with few rows. Theor. Comput. Sci. Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley
2019	—	`conf`	Genetic algorithms for affine transformations to existential GECCO (Companion) Ryan E. Dougherty, Erin Lanus, Charles J. Colbourn, Stephanie Forrest
2019	—	`conf`	Partitioned Search with Column Resampling for Locating Array Construction. ICST Workshops Erin Lanus, Charles J. Colbourn, Douglas C. Montgomery
2019	J	`jnl`	Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation. Comput. Commun. Matthew J. Mellott, Domenico Garlisi, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello
2019	—	`conf`	Robustness of Recovery in Locating Array-Based Screening Experiments. SpringSim Stephen A. Seidel, Charles J. Colbourn, Violet R. Syrotiuk
2019	B	`conf`	Set-Codes with Small Intersections and Small Discrepancies. ISIT Ryan Gabrys, Hoang Dau, Charles J. Colbourn, Olgica Milenkovic
2019	J	`jnl`	Set-Codes with Small Intersections and Small Discrepancies. CoRR Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic
2018	J	`jnl`	A hierarchical framework for recovery in compressive sensing. Discret. Appl. Math. Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
2018	—	`conf`	Analysis of large-scale experimental data from wireless networks. INFOCOM Workshops Stephen A. Seidel, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Ingrid Moerman, Violet R. Syrotiuk
2018	J	`jnl`	Asymptotic and constructive methods for covering perfect hash families and covering arrays. Des. Codes Cryptogr. Charles J. Colbourn, Erin Lanus, Kaushik Sarkar
2018	C	`conf`	Counting Subwords and Regular Languages. DLT Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018	J	`jnl`	Counting Subwords and Regular Languages. CoRR Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit
2018	J	`jnl`	Fractal Perfect Hash Families (Extended Abstract). Electron. Notes Discret. Math. Charles J. Colbourn, Ryan E. Dougherty
2018	J	`jnl`	Improved Strength Four Covering Arrays with Three Symbols. Graphs Comb. Soumen Maity, Yasmeen Akhtar, Reshma C. Chandrasekharan, Charles J. Colbourn
2018	J	`jnl`	On a Combinatorial Framework for Fault Characterization. Math. Comput. Sci. Charles J. Colbourn, Violet R. Syrotiuk
2018	J	`jnl`	Partial Covering Arrays: Algorithms and Asymptotics. Theory Comput. Syst. Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
2018	C	`conf`	Separating Interaction Effects Using Locating and Detecting Arrays. IWOCA Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk
2018	J	`jnl`	Subspace restrictions and affine composition for covering perfect hash families. Art Discret. Appl. Math. Charles J. Colbourn, Erin Lanus
2018	J	`jnl`	Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing. IEEE Trans. Reliab. Guanqiu Qi, Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Zhiqin Zhu
2018	—	`conf`	Testbed Evaluation of Optimized REACT over Multi-hop Paths. WWIC Matthew J. Mellott, Charles J. Colbourn, Violet R. Syrotiuk, Ilenia Tinnirello
2017	J	`jnl`	Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
2017	J	`jnl`	Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless
2017	J	`jnl`	Upper Bounds on the Size of Covering Arrays. SIAM J. Discret. Math. Kaushik Sarkar, Charles J. Colbourn
2017	J	`jnl`	Variable-weight topology-transparent scheduling. Comput. Networks Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
2016	—	`conf`	Coverage, Location, Detection, and Measurement. ICST Workshops Charles J. Colbourn, Violet R. Syrotiuk
2016	J	`jnl`	Disjoint Spread Systems and Fault Location. SIAM J. Discret. Math. Charles J. Colbourn, Bingli Fan, Daniel Horsley
2016	C	`conf`	Partial Covering Arrays: Algorithms and Asymptotics. IWOCA Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
2016	J	`jnl`	Partial Covering Arrays: Algorithms and Asymptotics. CoRR Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro
2016	—	`conf`	Screening interacting factors in a wireless network testbed using locating arrays. INFOCOM Workshops Randy Compton, Michael T. Mehari, Charles J. Colbourn, Eli De Poorter, Violet R. Syrotiuk
2016	J	`jnl`	Two-stage algorithms for covering array construction. CoRR Kaushik Sarkar, Charles J. Colbourn
2015	J	`jnl`	A Discrete Particle Swarm Optimization for Covering Array Generation. IEEE Trans. Evol. Comput. Huayao Wu, Changhai Nie, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn
2015	J	`jnl`	A combinatorial approach to X-tolerant compaction circuits. CoRR Yuichiro Fujiwara, Charles J. Colbourn
2015	J	`jnl`	Augmentation of Covering Arrays of Strength Two. Graphs Comb. Charles J. Colbourn
2015	J	`jnl`	Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm. J. Comput. Sci. Technol. Shi-wei Gao, Jianghua Lv, Bing-Lei Du, Charles J. Colbourn, Shilong Ma
2015	J	`jnl`	Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures. Inf. Softw. Technol. Changhai Nie, Huayao Wu, Xintao Niu, Fei-Ching Kuo, Hareton K. N. Leung, Charles J. Colbourn
2015	J	`jnl`	Compressed sensing and designs: theory and simulations. CoRR Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
2015	J	`jnl`	Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems. ACM SIGOPS Oper. Syst. Rev. Abraham N. Aldaco, Charles J. Colbourn, Violet R. Syrotiuk
2015	J	`jnl`	Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses. Des. Codes Cryptogr. Yeow Meng Chee, Charles J. Colbourn, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang
2015	J	`jnl`	Steiner loops satisfying Moufang's theorem. Australas. J Comb. Charles J. Colbourn, Maria De Lourdes Merlini Giuliani, Alexander Rosa, Izabella Stuhl
2014	J	`jnl`	ATLAS: Adaptive Topology- andLoad-Aware Scheduling. IEEE Trans. Mob. Comput. Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
2014	J	`jnl`	Covering arrays, augmentation, and quilting arrays. Discret. Math. Algorithms Appl. Charles J. Colbourn
2014	J	`jnl`	Hierarchical Recovery in Compressive Sensing. CoRR Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
2014	C	`conf`	Sequence Covering Arrays and Linear Extensions. IWOCA Patrick C. Murray, Charles J. Colbourn
2014	J	`jnl`	f-vectors of pure complexes and pure multicomplexes of rank three. Discret. Math. Charles J. Colbourn, Melissa S. Keranen, Donald L. Kreher
2013	J	`jnl`	ATLAS: Adaptive Topology- and Load-Aware Scheduling CoRR Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
2013	B	`conf`	Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems. IC2E Wei-Tek Tsai, Qingyang Li, Charles J. Colbourn, Xiaoying Bai
2013	—	`ch.`	Block designs. Handbook of Finite Fields Charles J. Colbourn, Jeffrey H. Dinitz
2013	J	`jnl`	Covering and packing for pairs. J. Comb. Theory A Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling, Richard M. Wilson
2013	—	`conf`	Empirically Identifying the Best Greedy Algorithm for Covering Array Generation. ICST Workshops Changhai Nie, Jing Jiang, Huayao Wu, Hareton Leung, Charles J. Colbourn
2013	—	`ch.`	Other combinatorial structures. Handbook of Finite Fields Jeffrey H. Dinitz, Charles J. Colbourn
2013	—	`conf`	Randomized Post-optimization for t-Restrictions. Information Theory, Combinatorics, and Search Theory Charles J. Colbourn, Peyman Nayeri
2013	J	`jnl`	Randomized post-optimization of covering arrays. Eur. J. Comb. Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
2013	J	`jnl`	Sequence Covering Arrays. SIAM J. Discret. Math. Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou
2013	—	`conf`	Test algebra for combinatorial testing. AST@ICSE Wei-Tek Tsai, Charles J. Colbourn, Jie Luo, Guanqiu Qi, Qingyang Li, Xiaoying Bai
2013	J	`jnl`	The BioIntelligence Framework: a new computational platform for biomedical knowledge computing. J. Am. Medical Informatics Assoc. Toni R. Farley, Jeff Kiefer, Preston Lee, Daniel Von Hoff, Jeffrey M. Trent, Charles J. Colbourn, Spyro Mousses
2013	J	`jnl`	The Existence of (K 2 × K 6)-Designs. Graphs Comb. Chengmin Wang, Charles J. Colbourn
2013	J	`jnl`	Topological Persistence for Medium Access Control. IEEE Trans. Mob. Comput. Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
2012	J	`jnl`	Cover starters for covering arrays of strength two. Discret. Math. Jason R. Lobb, Charles J. Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez
2012	J	`jnl`	Grooming traffic to minimize load. Discret. Math. Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, Violet R. Syrotiuk
2012	J	`jnl`	Strengthening hash families and compressive sensing. J. Discrete Algorithms Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
2012	J	`jnl`	Trails of triples in partial triple systems. Des. Codes Cryptogr. Charles J. Colbourn, Daniel Horsley, Chengmin Wang
2012	C	`conf`	Variable Weight Sequences for Adaptive Scheduled Access in MANETs. SETA Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
2011	J	`jnl`	Compressive Sensing Matrices and Hash Families. IEEE Trans. Commun. Charles J. Colbourn, Daniel Horsley, Christopher McLean
2011	—	`ch.`	Covering arrays and hash families. Information Security, Coding Theory and Related Combinatorics Charles J. Colbourn
2011	C	`conf`	Efficient Conditional Expectation Algorithms for Constructing Hash Families. IWOCA Charles J. Colbourn
2011	—	`conf`	Finding Interaction Faults Adaptively Using Distance-Based Strategies. ECBS Renée C. Bryce, Charles J. Colbourn, D. Richard Kuhn
2011	J	`jnl`	Grooming Traffic to Maximize Throughput in SONET Rings. JOCN Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk
2011	J	`jnl`	Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
2011	J	`jnl`	Optical grooming with grooming ratio nine. Discret. Math. Charles J. Colbourn, Gennian Ge, Alan C. H. Ling
2010	J	`jnl`	A combinatorial approach to X-tolerant compaction circuits. IEEE Trans. Inf. Theory Yuichiro Fujiwara, Charles J. Colbourn
2010	A	`conf`	Apples and oranges: comparing schedule- and contention-based medium access control. MSWiM Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
2010	—	`ch.`	Boolean Aspects of Network Reliability. Boolean Models and Methods Charles J. Colbourn, Yves Crama, Peter L. Hammer
2010	J	`jnl`	Covering and radius-covering arrays: Constructions and classification. Discret. Appl. Math. Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta
2010	J	`jnl`	Covering arrays from cyclotomy. Des. Codes Cryptogr. Charles J. Colbourn
2010	J	`jnl`	Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discret. Math. Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau
2010	—	`conf`	Frameproof codes and compressive sensing. Allerton Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
2010	J	`jnl`	Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
2009	J	`jnl`	A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verification Reliab. Renée C. Bryce, Charles J. Colbourn
2009	J	`jnl`	A recursive construction for perfect hash families. J. Math. Cryptol. Charles J. Colbourn, Alan C. H. Ling
2009	—	`conf`	Binary Covering Arrays and Existentially Closed Graphs. IWCC Charles J. Colbourn, Gerzson Kéri
2009	J	`jnl`	Chip firing and all-terminal network reliability bounds. Discret. Optim. Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski
2009	J	`jnl`	Graph designs for the eight-edge five-vertex graphs. Discret. Math. Charles J. Colbourn, Gennian Ge, Alan C. H. Ling
2009	J	`jnl`	Linear hash families and forbidden configurations. Des. Codes Cryptogr. Charles J. Colbourn, Alan C. H. Ling
2009	—	`conf`	Locating and Detecting Arrays for Interaction Faults. Search Methodologies Charles J. Colbourn, Daniel W. McClary
2009	J	`jnl`	Merging covering arrays and compressing multiple sequence alignments. Discret. Appl. Math. Andreas H. Ronneseth, Charles J. Colbourn
2009	J	`jnl`	Minimum embedding of Steiner triple systems into (K Discret. Math. Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi
2009	J	`jnl`	Multi-Terminal Network Connectedness on Series-Parallel Networks. Discret. Math. Algorithms Appl. Toni R. Farley, Charles J. Colbourn
2009	—	`conf`	Multiterminal measures for network reliability and resilience. DRCN Toni R. Farley, Charles J. Colbourn
2009	J	`jnl`	Optical grooming with grooming ratio eight. Discret. Appl. Math. Charles J. Colbourn, Gennian Ge, Alan C. H. Ling
2009	C	`conf`	Randomized Postoptimization of Covering Arrays. IWOCA Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
2009	J	`jnl`	Small stopping sets in Steiner triple systems. Cryptogr. Commun. Charles J. Colbourn, Yuichiro Fujiwara
2008	J	`jnl`	Constructing strength three covering arrays with augmented annealing. Discret. Math. Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling
2008	J	`jnl`	Directed complete bipartite graph decompositions: Indirect constructions. Discret. Math. Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk
2008	J	`jnl`	Fully gated graphs: Recognition and convex operations. Discret. Math. Charles J. Colbourn, Cécile Huybrechts
2008	J	`jnl`	Grooming for two-period optical networks. Networks Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk
2008	J	`jnl`	Locating and detecting arrays for interaction faults. J. Comb. Optim. Charles J. Colbourn, Daniel W. McClary
2008	J	`jnl`	Lower bounds for two-period grooming via linear programming duality. Networks Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk
2008	J	`jnl`	Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. SIAM J. Discret. Math. Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu
2008	J	`jnl`	Minimum embedding of Steiner triple systems into (K Discret. Math. Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi
2008	J	`jnl`	Rateless forward error correction for topology-transparent scheduling. IEEE/ACM Trans. Netw. Violet R. Syrotiuk, Charles J. Colbourn, Sruthi Yellamraju
2008	J	`jnl`	Strength two covering arrays: Existence tables and projection. Discret. Math. Charles J. Colbourn
2007	J	`jnl`	A carrier sense multiple access protocol with power backoff (CSMA/PB). Ad Hoc Networks Charles J. Colbourn, Minghao Cui, Errol L. Lloyd, Violet R. Syrotiuk
2007	J	`jnl`	Biased covering arrays for progressive ranking and composition of Web Services. Int. J. Simul. Process. Model. Renée C. Bryce, Yinong Chen, Charles J. Colbourn
2007	J	`jnl`	Constructions for Difference Triangle Sets CoRR Yeow Meng Chee, Charles J. Colbourn
2007	J	`jnl`	Failed disk recovery in double erasure RAID arrays. J. Discrete Algorithms Kaushik Srinivasan, Charles J. Colbourn
2007	—	`conf`	Just-in-Time Online Scheduling for WDM EPONs. ICC Michael P. McGarry, Martin Reisslein, Charles J. Colbourn, Martin Maier
2007	J	`jnl`	Lower bounds on multiple sequence alignment using exact 3-way alignment. BMC Bioinform. Charles J. Colbourn, Sudhir Kumar
2007	J	`jnl`	Multiterminal resilience for series-parallel networks. Networks Toni R. Farley, Charles J. Colbourn
2007	A	`conf`	One-test-at-a-time heuristic search for interaction test suites. GECCO Renée C. Bryce, Charles J. Colbourn
2007	J	`jnl`	Optimal Memoryless Encoding for Low Power Off-Chip Data Buses CoRR Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling
2007	J	`jnl`	Perfect Hash Families: Constructions and Existence. J. Math. Cryptol. Robert A. Walker, Charles J. Colbourn
2007	J	`jnl`	Ternary Schedules for Energy-Limited Sensor Networks. IEEE Trans. Inf. Theory Peter Dukes, Violet R. Syrotiuk, Charles J. Colbourn
2007	J	`jnl`	The density algorithm for pairwise interaction testing. Softw. Test. Verification Reliab. Renée C. Bryce, Charles J. Colbourn
2007	J	`jnl`	Transport schemes for topology-transparent scheduling. J. Comb. Optim. Violet R. Syrotiuk, Zhiqiang Zhang, Charles J. Colbourn
2006	J	`jnl`	Detecting and Locating Interaction Faults. Electron. Notes Discret. Math. Charles J. Colbourn, Daniel W. McClary
2006	J	`jnl`	On constant composition codes. Discret. Appl. Math. Wensong Chu, Charles J. Colbourn, Peter Dukes
2006	A	`conf`	Optimal memoryless encoding for low power off-chip data buses. ICCAD Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling
2006	J	`jnl`	Prioritized interaction testing for pair-wise coverage with seeding and constraints. Inf. Softw. Technol. Renée C. Bryce, Charles J. Colbourn
2006	J	`jnl`	Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr. Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker
2006	J	`jnl`	Slot synchronized topology-transparent scheduling for sensor networks. Comput. Commun. Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk
2006	J	`jnl`	The effects of synchronization on topology-transparent scheduling. Wirel. Networks Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk
2006	—	`conf`	Topology-Transparent Schedules for Energy Limited Ad hoc Networks. PerCom Workshops Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk
2005	J	`jnl`	A Recursive Construction For Regular Difference Triangle Sets. SIAM J. Discret. Math. Wensong Chu, Charles J. Colbourn, Solomon W. Golomb
2005	A*	`conf`	A framework of greedy methods for constructing interaction test suites. ICSE Renée C. Bryce, Charles J. Colbourn, Myra B. Cohen
2005	A*	`conf`	Constructing interaction test suites with greedy algorithms. ASE Renée C. Bryce, Charles J. Colbourn
2005	J	`jnl`	Embedding path designs into kite systems. Discret. Math. Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi
2005	J	`jnl`	Optimal frequency-hopping sequences via cyclotomy. IEEE Trans. Inf. Theory Wensong Chu, Charles J. Colbourn
2005	J	`jnl`	Ovals and hyperovals in nets. Discret. Math. Charles J. Colbourn, David A. Drake, Wendy J. Myrvold
2005	—	`conf`	Progressive Ranking and Composition of Web Services Using Covering Arrays. WORDS Charles J. Colbourn, Yinong Chen, Wei-Tek Tsai
2005	—	`conf`	Software performance testing using covering arrays: efficient screening designs with categorical factors. WOSP Dean S. Hoskins, Charles J. Colbourn, Douglas C. Montgomery
2005	—	`conf`	Test prioritization for pairwise interaction coverage. A-MOST Renée C. Bryce, Charles J. Colbourn
2005	J	`jnl`	Test prioritization for pairwise interaction coverage. ACM SIGSOFT Softw. Eng. Notes Renée C. Bryce, Charles J. Colbourn
2005	J	`jnl`	Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio SIAM J. Discret. Math. Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz
2004	—	`conf`	A deterministic density algorithm for pairwise interaction coverage. IASTED Conf. on Software Engineering Charles J. Colbourn, Myra B. Cohen, Renée Turban
2004	J	`jnl`	Constructions for Permutation Codes in Powerline Communications. Des. Codes Cryptogr. Wensong Chu, Charles J. Colbourn, Peter Dukes
2004	J	`jnl`	Cover-Free Families and Topology-Transparent Scheduling for MANETs. Des. Codes Cryptogr. Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk
2004	J	`jnl`	Dynamic spectrum utilization in ad hoc networks. Comput. Networks Violet R. Syrotiuk, Minghao Cui, S. Ramkumar, Charles J. Colbourn
2004	—	`conf`	Experimental designs in software engineering: d-optimal designs and covering arrays. WISER Dean S. Hoskins, Renée Turban, Charles J. Colbourn
2004	J	`jnl`	Grooming in unidirectional rings: Discret. Math. Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu
2004	J	`jnl`	Ladder orderings of pairs and RAID performance. Discret. Appl. Math. Myra B. Cohen, Charles J. Colbourn
2004	J	`jnl`	Optimal ( Discret. Math. Wensong Chu, Charles J. Colbourn
2004	J	`jnl`	Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. IEEE Trans. Inf. Theory Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling
2004	J	`jnl`	Preface. Discret. Math. Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin
2004	B	`conf`	Scheduled persistence for medium access control in sensor networks. MASS Charles J. Colbourn, Violet R. Syrotiuk
2004	—	`conf`	Securing dynamic spectrum use. VTC Fall (2) Minghao Cui, Violet R. Syrotiuk, Charles J. Colbourn
2004	J	`jnl`	Sequence designs for ultra-wideband impulse radio with optimal correlation properties. IEEE Trans. Inf. Theory Wensong Chu, Charles J. Colbourn
2004	A	`conf`	Topology Transparent Scheduling, Synchronization, and Maximum Delay. IPDPS Wensong Chu, Charles J. Colbourn, Violet R. Syrotiuk
2003	A	`conf`	Augmenting Simulated Annealing to Build Interaction Test Suites. ISSRE Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling
2003	A*	`conf`	Constructing Test Suites for Interaction Testing. ICSE Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn
2003	J	`jnl`	Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs. Discret. Math. Charles J. Colbourn, Alan C. H. Ling
2003	—	`conf`	On Quaternary MacDonald Codes. ITCC Charles J. Colbourn, Manish K. Gupta
2003	J	`jnl`	Optimal and pessimal orderings of Steiner triple systems in disk arrays. Theor. Comput. Sci. Myra B. Cohen, Charles J. Colbourn
2003	J	`jnl`	Preface. Discret. Math. Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek
2003	J	`jnl`	Resolving P(v, 3, λ) designs into regular P Australas. J Comb. Charles J. Colbourn, Gaetano Quattrocchi, Alexander Rosa
2003	J	`jnl`	Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs Comb. Charles J. Colbourn, Alexander Rosa
2003	—	`conf`	Steiner Systems for Topology-Transparent Access Control in MANETs. ADHOC-NOW Charles J. Colbourn, Violet R. Syrotiuk, Alan C. H. Ling
2003	—	`conf`	Topology-transparent scheduling for MANETs using orthogonal arrays. DIALM-POMC Violet R. Syrotiuk, Charles J. Colbourn, Alan C. H. Ling
2003	B	`conf`	Variable Strength Interaction Testing of Components. COMPSAC Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugridge, Charles J. Colbourn, James S. Collofello
2002	J	`jnl`	Construction of optimal quality control for oligo arrays. Bioinform. Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
2002	J	`jnl`	Kirkman triple systems of order 21 with nontrivial automorphism group. Math. Comput. Myra B. Cohen, Charles J. Colbourn, Lee A. Ives, Alan C. H. Ling
2002	J	`jnl`	NS1D0 Sequences and Anti-Pasch Steiner Triple Systems. Ars Comb. Feliu Sagols, Charles J. Colbourn
2002	J	`jnl`	Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptogr. Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees
2002	J	`jnl`	Projective planes and congestion-free networks. Discret. Appl. Math. Charles J. Colbourn
2002	J	`jnl`	The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. Des. Codes Cryptogr. Charles J. Colbourn, Esther R. Lamken, Alan C. H. Ling, W. H. Mills
2001	J	`jnl`	(M, S)-optimal designs with block size three. Australas. J Comb. Charles J. Colbourn, Alan C. H. Ling
2001	Misc	`conf`	Cluttered Orderings for the Complete Graph. COCOON Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek
2001	J	`jnl`	Equireplicate Balanced Binary Codes for Oligo Arrays. SIAM J. Discret. Math. Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa
2001	J	`jnl`	Minimizing drop cost for SONET/WDM networks with wavelength requirements. Networks Charles J. Colbourn, Peng-Jun Wan
2001	B	`conf`	Ordering disks for double erasure codes. SPAA Myra B. Cohen, Charles J. Colbourn
2001	J	`jnl`	Preface. Discret. Math. Charles J. Colbourn, Hao Shen
2001	J	`jnl`	Quorum Systems Constructed from Combinatorial Designs. Inf. Comput. Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson
2001	J	`jnl`	Triangulations and a generalization of Bose's method. Discret. Math. Charles J. Colbourn, Feliu Sagols
2000	J	`jnl`	Asymptotically optimal erasure-resilient codes for large disk arrays. Discret. Appl. Math. Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling
2000	J	`jnl`	Coding, Cryptography, and Computer Security - Preface. Discret. Appl. Math. Charles J. Colbourn, Hadi Kharaghani
2000	J	`jnl`	Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. J. Graph Theory Dan Archdeacon, Charles J. Colbourn, Isidoro Gitler, J. Scott Provan
2000	J	`jnl`	Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-User Communication Systems. Des. Codes Cryptogr. Charles J. Colbourn, Sufang Zhao
2000	J	`jnl`	Modified group divisible designs with block size four. Discret. Math. Alan C. H. Ling, Charles J. Colbourn
2000	A	`conf`	Multiple Access Communications Using Combinatorial Designs. Theoretical Aspects of Computer Science Charles J. Colbourn
2000	B	`conf`	Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. LATIN Myra B. Cohen, Charles J. Colbourn
2000	J	`jnl`	Quorums from difference covers. Inf. Process. Lett. Charles J. Colbourn, Alan C. H. Ling
2000	J	`jnl`	Transversal Designs in Classical Planes and Spaces. J. Comb. Theory A Aiden A. Bruen, Charles J. Colbourn
1999	J	`jnl`	Balanced sampling plans with block size four excluding contiguous units. Australas. J Comb. Charles J. Colbourn, Alan C. H. Ling
1999	J	`jnl`	Bicoloring Steiner Triple Systems. Electron. J. Comb. Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa
1999	—	`ch.`	Combinatorial Designs. Handbook of Discrete and Combinatorial Mathematics Charles J. Colbourn, Jeffrey H. Dinitz
1999	J	`jnl`	Covering Arrays of Strength Three. Des. Codes Cryptogr. M. A. Chateauneuf, Charles J. Colbourn, Donald L. Kreher
1999	J	`jnl`	Kirkman school project designs. Discret. Math. Charles J. Colbourn, Alan C. H. Ling
1998	J	`jnl`	A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. Theor. Comput. Sci. Charles J. Colbourn, Guoliang Xue
1998	J	`jnl`	Completing the spectrum of rotational Mendelsohn triple systems. Discret. Math. Zhike Jiang, Charles J. Colbourn
1998	J	`jnl`	Deleting Lines in Projective Planes. Ars Comb. Alan C. H. Ling, Charles J. Colbourn
1998	J	`jnl`	On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. Charles J. Colbourn, Jianxing Yin
1998	J	`jnl`	Point Code Minimum Steiner Triple Systems. Des. Codes Cryptogr. Charles J. Colbourn, Alan C. H. Ling
1998	J	`jnl`	Tight 4-factor orthogonal main effect plans. Discret. Math. Robert P. Gallant, Charles J. Colbourn
1997	J	`jnl`	Balanced Steiner Triple Systems. J. Comb. Theory A Charles J. Colbourn, Lucien Haddad, Václav Linek
1997	J	`jnl`	Complete Arcs in Steiner Triple Systems. J. Comb. Theory A Charles J. Colbourn, Jeffrey H. Dinitz
1997	J	`jnl`	Constructions for difference triangle sets. IEEE Trans. Inf. Theory Yeow Meng Chee, Charles J. Colbourn
1997	J	`jnl`	Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. Des. Codes Cryptogr. R. Julian R. Abel, Charles J. Colbourn, Jianxing Yin, Hantao Zhang
1997	J	`jnl`	Pairwise Balanced Designs with Block Sizes 8, 9, and 10. J. Comb. Theory A Charles J. Colbourn, Alan C. H. Ling
1997	J	`jnl`	Pairwise Balanced Designs with Consecutive Block Sizes. Des. Codes Cryptogr. Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin
1997	J	`jnl`	Wang Tilings and Distributed Verification on Anonymous Torus Networks. Theory Comput. Syst. Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl
1996	J	`jnl`	Cohen-Macaulay Rings in Network Reliability. SIAM J. Discret. Math. Jason I. Brown, Charles J. Colbourn, David G. Wagner
1996	J	`jnl`	Concerning Difference Matrices. Des. Codes Cryptogr. Charles J. Colbourn, Donald L. Kreher
1996	J	`jnl`	Equitable Embeddings of Steiner Triple Systems. J. Comb. Theory A Charles J. Colbourn, Lucien Haddad, Václav Linek
1996	J	`jnl`	Existence of three HMOLS of types h Discret. Math. Frank E. Bennett, Charles J. Colbourn, Lie Zhu
1996	—	`conf`	N(n), v(n): Similarities and Differences. DMTCS Charles J. Colbourn, Jeffrey H. Dinitz
1996	J	`jnl`	Transversal Designs of Block Size Eight and Nine. Eur. J. Comb. Charles J. Colbourn
1996	J	`jnl`	Two Algorithms for Unranking Arborescences. J. Algorithms Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld
1995	J	`jnl`	A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. Discret. Appl. Math. Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
1995	J	`jnl`	Consecutive cuts and paths, and bounds on Networks Heidi J. Strayer, Charles J. Colbourn
1995	J	`jnl`	Existence of six incomplete MOLS. Australas. J Comb. Charles J. Colbourn, Lie Zhu
1995	J	`jnl`	Orthogonal resolutions of triple systems. Australas. J Comb. Charles J. Colbourn, Alexander Rosa
1995	J	`jnl`	Partial Steiner Triple Systems with Equal-Sized Holes. J. Comb. Theory A Charles J. Colbourn, Charles A. Cusack, Donald L. Kreher
1995	J	`jnl`	Preface. Networks Charles J. Colbourn, Klaus Sutner
1995	J	`jnl`	The Complexity of Computing the Tutte Polynomial on Transversal Matroids. Comb. Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
1995	J	`jnl`	Thwarts in Transversal Designs. Des. Codes Cryptogr. Charles J. Colbourn, Jeffrey H. Dinitz, Mieczyslaw Wojtas
1994	J	`jnl`	Anti-mitre steiner triple systems. Graphs Comb. Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán
1994	J	`jnl`	Concerning difference families with block size four. Discret. Math. Paul L. Check, Charles J. Colbourn
1994	—	`conf`	Conflict-free access to constant-perimeter, rectangular, subarrays. Interconnection Networks and Mapping and Scheduling Parallel Computations Doreen L. Erickson, Charles J. Colbourn
1994	J	`jnl`	Network reliability and the probabilistic estimation of damage from fire spread. Ann. Oper. Res. Charles J. Colbourn, Louis D. Nel, T. Brian Boffey, Derek F. Yates
1993	J	`jnl`	Assessing Reliability of Multistage Interconnection Networks. IEEE Trans. Computers Charles J. Colbourn, John S. Devitt, Daryl D. Harms, Miro Kraetzl
1993	J	`jnl`	Book reviews. ZOR Methods Model. Oper. Res. G. Ronning, D. Wagner, Michael M. Richter, Rainer Hettich, Charles J. Colbourn
1993	J	`jnl`	Computing Residual Connectedness Reliability for Restricted Networks. Discret. Appl. Math. Charles J. Colbourn, Appajosyula Satyanarayana, Charles L. Suffel, Klaus Sutner
1993	—	`conf`	Conflict-Free Access for the Collections of Templates. PPSC Doreen L. Erickson, Charles J. Colbourn
1993	J	`jnl`	Evaluating performability: Most probable states and bounds. Telecommun. Syst. Charles J. Colbourn, Daryl D. Harms
1993	J	`jnl`	Network transformations and bounding network reliability. Networks Jason I. Brown, Charles J. Colbourn, John S. Devitt
1993	J	`jnl`	Reliable assignments of processors to tasks and factoring on matroids. Discret. Math. Charles J. Colbourn, Ehab S. Elmallah
1993	J	`jnl`	Renormalization of two - terminal reliability. Networks Daryl D. Harms, Charles J. Colbourn
1993	J	`jnl`	Support sizes of sixfold triple systems. Discret. Math. Charles J. Colbourn, Ebadollah S. Mahmoodian
1993	J	`jnl`	The Spectrum of Maximal Partial Steiner Triple Systems. Des. Codes Cryptogr. Charles J. Colbourn, Alexander Rosa, Stefan Znám
1993	J	`jnl`	Threshold Channel Graphs. Comb. Probab. Comput. Miro Kraetzl, Charles J. Colbourn
1993	J	`jnl`	Transformations on channel graphs. IEEE Trans. Commun. Miro Kraetzl, Charles J. Colbourn
1993	—	`conf`	Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract). WDAG Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl
1992	J	`jnl`	A New Class of Group Divisible Designs with Block Size Three. J. Comb. Theory A Charles J. Colbourn, Dean G. Hoffman, Rolf S. Rees
1992	J	`jnl`	A Note on Bounding k-Terminal Reliability. Algorithmica Charles J. Colbourn
1992	J	`jnl`	A Parallelization of Miller's n^log n Isomorphism Technique. Inf. Process. Lett. Charles J. Colbourn, Douglas R. Stinson, Luc Teirlinck
1992	J	`jnl`	Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems. Des. Codes Cryptogr. Charles J. Colbourn, Eric Mendelsohn, Cheryl E. Praeger, Vladimir D. Tonchev
1992	J	`jnl`	Conflict-Free Access to Parallel Memories. J. Parallel Distributed Comput. Charles J. Colbourn, Katherine Heinrich
1992	J	`jnl`	Directed star decompositions of the complete directed graph. J. Graph Theory Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger
1992	—	`conf`	Networks and Reliability in Maple. Computational Support for Discrete Mathematics Daryl D. Harms, John S. Devitt, Charles J. Colbourn
1992	—	`ch.`	On Implementing an Environment for Investigating Network reliability. Computer Science and Operations Research John S. Devitt, Charles J. Colbourn
1992	J	`jnl`	Roots of the Reliability Polynomial. SIAM J. Discret. Math. Jason I. Brown, Charles J. Colbourn
1992	J	`jnl`	Series-parallel subgraphs of planar graphs. Networks Ehab S. Elmallah, Charles J. Colbourn
1992	J	`jnl`	Support Sizes of Triple Systems. J. Comb. Theory A Charles J. Colbourn, Charles C. Lindner
1991	J	`jnl`	Combinatorial aspects of network reliability. Ann. Oper. Res. Charles J. Colbourn
1991	J	`jnl`	Directed star decompositions of directed multigraphs. Discret. Math. Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger
1991	J	`jnl`	Intersections and supports of quadruple systems. Discret. Math. Charles J. Colbourn, Alan Hartman
1991	J	`jnl`	Leaves, excesses and neighbourhoods in triple systems. Australas. J Comb. Charles J. Colbourn, Alexander Rosa
1991	J	`jnl`	Network reliability: Numbers or insight? - A discussion paper. Ann. Oper. Res. Charles J. Colbourn
1991	J	`jnl`	Partitioning Steiner triple systems into complete arcs. Discret. Math. Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa
1991	J	`jnl`	Preface. Discret. Math. Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa
1991	J	`jnl`	Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory A Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson
1991	J	`jnl`	The fine structure of threefold triple systems: u = 1 or 3 (mod 6). Discret. Math. Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby
1991	J	`jnl`	The fine structure of threefold triple systems: v≡5(mod 6). Australas. J Comb. Charles J. Colbourn, Rudolf Mathon, Nabil Shalaby
1991	J	`jnl`	The number of t-wise balance designs. Comb. Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler
1990	J	`jnl`	Combining monte carlo estimates and bounds for network reliability. Networks Louis D. Nel, Charles J. Colbourn
1990	J	`jnl`	Efficient algorithms for computing the reliability of permutation and interval graphs. Networks Hosam M. Aboelfotoh, Charles J. Colbourn
1990	J	`jnl`	Large sets of disjoint t-designs. Australas. J Comb. Yeow Meng Chee, Charles J. Colbourn, Steven Furino, Donald L. Kreher
1990	J	`jnl`	On two dual classes of planar graphs. Discret. Math. Ehab S. Elmallah, Charles J. Colbourn
1990	J	`jnl`	Permutation graphs: Connected domination and Steiner trees. Discret. Math. Charles J. Colbourn, Lorna K. Stewart
1990	J	`jnl`	Probabilistic single processor scheduling. Discret. Appl. Math. Janelle J. Harms, Charles J. Colbourn
1990	J	`jnl`	Repeated edges in 2-factorizations. J. Graph Theory Charles J. Colbourn, Alexander Rosa
1990	J	`jnl`	The spectrum of support sizes for threefold triple systems. Discret. Math. Charles J. Colbourn, Ebadollah S. Mahmoodian
1990	J	`jnl`	Unit disk graphs. Discret. Math. Brent N. Clark, Charles J. Colbourn, David S. Johnson
1989	J	`jnl`	Applications of Combinatorial Designs in Computer Science. ACM Comput. Surv. Charles J. Colbourn, Paul C. van Oorschot
1989	—	`conf`	Bounding Network Parameters by Approximating Graphs. Reliability Of Computer And Communication Networks Charles J. Colbourn, Eugene I. Litvak
1989	J	`jnl`	Hybrid triple systems and cubic feedback sets. Graphs Comb. Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa
1989	J	`jnl`	Matroid Steiner problems, the Tutte polynomial and network reliability. J. Comb. Theory B Charles J. Colbourn, William R. Pulleyblank
1989	J	`jnl`	Multiplicative improvements in network reliability bounds. Networks Timothy B. Brecht, Charles J. Colbourn
1989	J	`jnl`	Percentages in pairwise balanced designs. Discret. Math. Charles J. Colbourn, Vojtech Rödl
1989	J	`jnl`	Series-Parallel Bounds for the Two-Terminal Reliability Problem. INFORMS J. Comput. Hosam M. Aboelfotoh, Charles J. Colbourn
1989	J	`jnl`	Simple neighbourhoods in triple systems. J. Comb. Theory A Charles J. Colbourn
1989	J	`jnl`	Unranking and Ranking Spanning Trees of a Graph. J. Algorithms Charles J. Colbourn, Robert P. J. Day, Louis D. Nel
1988	J	`jnl`	A Set System Polynomial with Colouring and Reliability Applications. SIAM J. Discret. Math. Jason I. Brown, Charles J. Colbourn
1988	J	`jnl`	Bounding all-terminal reliability in computer networks. Networks Charles J. Colbourn, Daryl D. Harms
1988	J	`jnl`	Edge-packing of graphs and network reliability. Discret. Math. Charles J. Colbourn
1988	J	`jnl`	Lower bounds on two-terminal network reliability. Discret. Appl. Math. Timothy B. Brecht, Charles J. Colbourn
1988	J	`jnl`	Problem 94. Discret. Math. Charles J. Colbourn
1988	J	`jnl`	The strong chromatic number of partial triple systems. Discret. Appl. Math. Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa
1987	J	`jnl`	Counting almost minimum cutsets with reliability applications. Math. Program. Aparna Ramanathan, Charles J. Colbourn
1986	J	`jnl`	Improving reliability bounds in computer networks. Networks Timothy B. Brecht, Charles J. Colbourn
1986	J	`jnl`	Quadratic leaves of maximal partial triple systems. Graphs Comb. Charles J. Colbourn, Alexander Rosa
1986	J	`jnl`	Some NP-complete problems for hypergraph degree sequences. Discret. Appl. Math. Charles J. Colbourn, William L. Kocay, Douglas R. Stinson
1985	J	`jnl`	Cataloguing the graphs on 10 vertices. J. Graph Theory R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald
1985	J	`jnl`	Optimum Communication Spanning Trees in Series-Parallel Networks. SIAM J. Comput. Ehab S. Elmallah, Charles J. Colbourn
1985	J	`jnl`	Some Empirical Observations on Program Behavior with Applications to Program Restructuring. IEEE Trans. Software Eng. Judith B. Peachey, Richard B. Bunt, Charles J. Colbourn
1985	J	`jnl`	The most reliable series-parallel networks. Networks Eric Neufeld, Charles J. Colbourn
1984	J	`jnl`	A census of regular 3-polystroma arising from honeycombs. Discret. Math. Charles J. Colbourn, Asia Ivic Weiss
1984	A*	`conf`	Concurrent Transmissions in Broadcast Networks. ICALP Charles J. Colbourn, Andrzej Proskurowski
1984	J	`jnl`	Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda. J. Comb. Theory A Charles J. Colbourn, Rose C. Hamm, C. A. Rodger
1984	J	`jnl`	The complexity of completing partial Latin squares. Discret. Appl. Math. Charles J. Colbourn
1983	J	`jnl`	Completing small partial triple systems. Discret. Math. Charles J. Colbourn, Marlene J. Colbourn, Alexander Rosa
1983	J	`jnl`	Embedding Partial Steiner Triple Systems Is NP-Complete. J. Comb. Theory A Charles J. Colbourn
1983	J	`jnl`	Every Twofold Triple System Can Be Directed. J. Comb. Theory A Charles J. Colbourn, Marlene J. Colbourn
1983	J	`jnl`	Steiner trees, partial 2-trees, and minimum IFI networks. Networks Joseph A. Wald, Charles J. Colbourn
1982	J	`jnl`	Colouring steiner quadruple systems. Discret. Appl. Math. Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl
1982	J	`jnl`	Computing the Chromatic Index of Steiner Triple Systems. Comput. J. Charles J. Colbourn
1981	J	`jnl`	Concerning the complexity of deciding isomorphism of block designs. Discret. Appl. Math. Marlene J. Colbourn, Charles J. Colbourn
1981	J	`jnl`	Cyclic Block Designs With Block Size 3. Eur. J. Comb. Marlene J. Colbourn, Charles J. Colbourn
1981	J	`jnl`	Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs. SIAM J. Comput. Charles J. Colbourn, Kellogg S. Booth
1981	J	`jnl`	On testing isomorphism of permutation graphs. Networks Charles J. Colbourn
1980	J	`jnl`	A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. Inf. Process. Lett. Charles J. Colbourn, Brendan D. McKay
1980	J	`jnl`	On deciding switching equivalence of graphs. Discret. Appl. Math. Charles J. Colbourn, Derek G. Corneil
1980	—	`—`	The complexity of graph isomorphism and related problems. Charles J. Colbourn
1979	J	`jnl`	Orderly algorithms for generating restricted classes of graphs. J. Graph Theory Charles J. Colbourn, Ronald C. Read
1979	J	`jnl`	The Complexity of Symmetrizing Matrices. Inf. Process. Lett. Charles J. Colbourn
1978	J	`jnl`	Graph isomorphism and self-complementary graphs. SIGACT News Marlene J. Colbourn, Charles J. Colbourn