Charles Colbourn

Q: What Schools Are Affiliated With Charles Colbourn

Charles Colbourn is affiliated with the following schools: University of Saskatchewan, Arizona State University, University of Vermont, University of Waterloo, University of Toronto

Charles Colbourn's AcademicInfluence.com Rankings

Charles Colbourn

Computer Science

#2187

World Rank

#2276

Historical Rank

Database

#1040

World Rank

#1094

Historical Rank

computer-science Degrees

Charles Colbourn

Mathematics

#2918

World Rank

#4401

Historical Rank

Combinatorics

#30

World Rank

#34

Historical Rank

Graph Theory

#55

World Rank

#62

Historical Rank

Measure Theory

#590

World Rank

#821

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Charles Colbourn Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Charles Joseph Colbourn is a Canadian computer scientist and mathematician, whose research concerns graph algorithms, combinatorial designs, and their applications. From 1996 to 2001 he was the Dorothean Professor of Computer Science at the University of Vermont; since then he has been a professor of Computer Science and Engineering at Arizona State University.

(See a Problem?)

Charles Colbourn's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

CRC Handbook of Combinatorial Designs (1996) (1675)
Unit disk graphs (1991) (1456)
The Combinatorics of Network Reliability (1987) (1184)
Handbook of Combinatorial Designs (2006) (949)
Constructing test suites for interaction testing (2003) (406)
Combinatorial aspects of covering arrays (2006) (227)
Steiner trees, partial 2-trees, and minimum IFI networks (1983) (213)
Prioritized interaction testing for pair-wise coverage with seeding and constraints (2006) (200)
The complexity of completing partial Latin squares (1984) (200)
Constructions for Permutation Codes in Powerline Communications (2004) (168)
The density algorithm for pairwise interaction testing (2007) (167)
Mutually orthogonal latin squares (MOLS) (2006) (150)
Permutation arrays for powerline communication and mutually orthogonal latin squares (2004) (147)
Augmenting simulated annealing to build interaction test suites (2003) (142)
A New Class of Group Divisible Designs with Block Size Three (1992) (139)
A deterministic density algorithm for pairwise interaction coverage (2004) (135)
Optimal frequency-hopping sequences via cyclotomy (2005) (133)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications) (2006) (131)
A framework of greedy methods for constructing interaction test suites (2005) (130)
Constructing strength three covering arrays with augmented annealing (2003) (128)
Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking (1999) (125)
A variable strength interaction testing of components (2003) (123)
Products of mixed covering arrays of strength two (2006) (116)
Lower bounds on two-terminal network reliability (1988) (106)
One-test-at-a-time heuristic search for interaction test suites (2007) (101)
Combinatorial Designs (1999) (101)
Locating and detecting arrays for interaction faults (2008) (100)
On constant composition codes (2006) (98)
Just-in-Time Scheduling for Multichannel EPONs (2008) (98)
A density-based greedy algorithm for higher strength covering arrays (2009) (98)
Network resilience (1987) (98)
A density‐based greedy algorithm for higher strength covering arrays (2009) (97)
On testing isomorphism of permutation graphs (1981) (96)
Chapter 11 Network reliability (1995) (93)
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs (1981) (93)
Recursive constructions for cyclic block designs (1984) (85)
The complexity of some edge deletion problems (1988) (81)
A Discrete Particle Swarm Optimization for Covering Array Generation (2015) (78)
CORR 99-01 Applications of Combinatorial Designs to Communications , Cryptography , and Networking (1999) (77)
Computing 2-terminal reliability for radio-broadcast networks (1989) (76)
Roots of the Reliability Polynomial (1992) (74)
Covering Arrays of Strength Three (1999) (69)
Applications of combinatorial designs in computer science (1989) (67)
Mutually orthogonal latin squares: a brief survey of constructions (2001) (66)
Permutation graphs: Connected domination and Steiner trees (1991) (65)
Reliability Issues In Telecommunications Network Planning (1999) (64)
Construction Techniques for Anti‐Pasch Steiner Triple Systems (2000) (63)
Roux-type constructions for covering arrays of strengths three and four (2006) (62)
Embedding Partial Steiner Triple Systems Is NP-Complete (1983) (61)
Resolvable and Near Resolvable Designs (1996) (61)
Covering arrays of higher strength from permutation vectors (2006) (59)
Covering and radius-covering arrays: Constructions and classification (2010) (58)
Two Algorithms for Unranking Arborescences (1996) (57)
Quadratic leaves of maximal partial triple systems (1986) (57)
Tabu search for covering arrays using permutation vectors (2009) (56)
Strength two covering arrays: Existence tables and projection (2008) (55)
Bounding all-terminal reliability in computer networks (1988) (54)
Covering arrays from cyclotomy (2010) (52)
The existence of uniform 5‐GDDs (1997) (51)
Cyclic Block Designs With Block Size 3 (1981) (51)
Recursive constructions for optimal (n,4,2)‐OOCs (2004) (50)
The Existence of Kirkman Squares—Doubly Resolvable (v,3,1)-BIBDs (2002) (47)
Hanani triple systems (1993) (47)
Bicoloring Steiner Triple Systems (1999) (45)
A class of partial triple systems with applications in survey sampling (1998) (45)
Combining monte carlo estimates and bounds for network reliability (1990) (44)
Minimizing setups in ordered sets of fixed width (1985) (44)
Unranking and Ranking Spanning Trees of a Graph (1989) (44)
Grooming in unidirectional rings: K4-e designs (2004) (43)
Pairwise Balanced Designs with Consecutive Block Sizes (1997) (43)
Combinatorial aspects of network reliability (1991) (42)
Some NP-complete problems for hypergraph degree sequences (1986) (40)
Counting almost minimum cutsets with reliability applications (1987) (40)
Randomized Postoptimization of Covering Arrays (2009) (39)
Optimal (n, 4, 2)-OOC of small orders (2004) (38)
Randomized post-optimization of covering arrays (2013) (38)
Topology-transparent scheduling for MANETs using orthogonal arrays (2003) (38)
Reliability Polynomials: A Survey (1998) (38)
Anti-mitre steiner triple systems (1994) (38)
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures (2015) (38)
Asymptotically optimal erasure-resilient codes for large disk arrays (2000) (38)
Edge-packing of graphs and network reliability (1988) (37)
Computing Residual Connectedness Reliability for Restricted Networks (1993) (37)
Properties of the Steiner Triple Systems of Order 19 (2010) (37)
Perfect Hash Families: Constructions and Existence (2007) (37)
Orderly algorithms for generating restricted classes of graphs (1979) (36)
Covering arrays and hash families (2011) (35)
Making the Mols Table (1996) (35)
Sequence Covering Arrays (2013) (35)
Orderly algorithms for graph generation (1979) (34)
Locating A Broadcast Facility In An Unreliable Network (1990) (34)
Modified group divisible designs with block size four (2000) (34)
Efficient algorithms for computing the reliability of permutation and interval graphs (1990) (34)
Network transformations and bounding network reliability (1993) (33)
Quorums from difference covers (2000) (32)
Cover-Free Families and Topology-Transparent Scheduling for MANETs (2004) (32)
Test prioritization for pairwise interaction coverage (2005) (31)
Upper Bounds on the Size of Covering Arrays (2016) (31)
Test prioritization for pairwise interaction coverage (2005) (30)
Software performance testing using covering arrays: efficient screening designs with categorical factors (2005) (30)
The chromatic index of cyclic Steiner 2-designs (1982) (29)
Quintessential pairwise balanced designs (1998) (29)
Group testing for consecutive positives (1999) (29)
The complexity of computing the tutte polynomial on transversal matroids (1995) (29)
Minimum embedding of P3‐designs into (K4—e)‐designs (2003) (28)
The computational complexity of recognizing critical sets (1984) (28)
Graph isomorphism and self-complementary graphs (1978) (28)
A census of regular 3-polystroma arising from honeycombs (1984) (28)
A carrier sense multiple access protocol with power backoff (CSMA/PB) (2007) (27)
Experimental designs in software engineering: d-optimal designs and covering arrays (2004) (27)
On deciding switching equivalence of graphs (1980) (27)
SHARPER BOUNDS IN ADAPTIVE GROUP TESTING (2000) (26)
Evaluating performability: Most probable states and bounds (1993) (26)
Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements (2001) (26)
Steiner trees in probabilistic networks (1983) (26)
Compressive Sensing Matrices and Hash Families (2011) (25)
Sequence designs for ultra-wideband impulse radio with optimal correlation properties (2004) (25)
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs (2000) (25)
The density algorithm for pairwise interaction testing: Research Articles (2007) (25)
Optimality and Constructions of Locating Arrays (2012) (25)
Asymptotic and constructive methods for covering perfect hash families and covering arrays (2018) (25)
Balanced sampling plans with block size four excluding contiguous units (1999) (25)
Some direct constructions for incomplete transversal designs (1996) (25)
Optimal and pessimal orderings of Steiner triple systems in disk arrays (2000) (25)
Series-Parallel Bounds for the Two-Terminal Reliability Problem (1989) (25)
Covering and packing for pairs (2013) (25)
On two dual classes of planar graphs (1990) (25)
Edge-coloured designs with block size four (1988) (24)
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven (2008) (24)
Existence of three HMOLS of types hn and 2n31 (1996) (24)
Merging covering arrays and compressing multiple sequence alignments (2009) (24)
Conflict-Free Access to Parallel Memories (1992) (24)
Existence of Incomplete Transversal Designs with Block Size Five and Any Index λ (1997) (24)
Cataloguing the graphs on 10 vertices (1985) (23)
A Linear Time Algorithm for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges (1998) (23)
Construction Techniques for Mutually Orthogonal Latin Squares (1995) (22)
The effects of synchronization on topology-transparent scheduling (2006) (22)
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs (2003) (22)
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems (2015) (22)
Some Open Problems on Reliability Polynomials (1993) (22)
The most reliable series-parallel networks (1985) (22)
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6 (2005) (21)
An Application of Permutation Arrays to Block Ciphers (2007) (21)
Rateless Forward Error Correction for Topology-Transparent Scheduling (2008) (21)
Test algebra for combinatorial testing (2013) (21)
Steiner Systems for Topology-Transparent Access Control in MANETs (2003) (21)
On the Log Concavity of Reliability and Matroidal Sequences (1994) (20)
Every Twofold Triple System Can Be Directed (1983) (20)
The Spectrum of R -Orthogonal Latin Squares (1995) (20)
Non-Stanley Bounds for Network Reliability (1996) (20)
Doubly Resolvable Nearly Kirkman Triple Systems (2013) (20)
Matroid Steiner problems, the Tutte polynomial and network reliability (1989) (19)
Improving reliability bounds in computer networks (1986) (19)
Construction of optimal quality control for oligo arrays (2002) (19)
Concerning seven and eight mutually orthogonal Latin squares (2004) (19)
Coverage, Location, Detection, and Measurement (2016) (18)
On quaternary MacDonald codes (2003) (18)
Minimizing drop cost for SONET/WDM networks with wavelength requirements (2001) (18)
Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems (2013) (18)
Binary Covering Arrays and Existentially Closed Graphs (2009) (18)
Slot synchronized topology-transparent scheduling for sensor networks (2006) (18)
Small stopping sets in Steiner triple systems (2009) (18)
Completing small partial triple systems (1983) (18)
Disjoint Spread Systems and Fault Location (2016) (17)
Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks (1986) (17)
Cover starters for covering arrays of strength two (2012) (17)
Kirkman school project designs (1999) (17)
Concerning Difference Matrices (1996) (17)
Large sets of disjoint t-designs (1990) (17)
Heterogeneous Hash Families and Covering Arrays (2010) (17)
Concerning the complexity of deciding isomorphism of block designs (1981) (16)
Screening interacting factors in a wireless network testbed using locating arrays (2016) (16)
Biased covering arrays for progressive ranking and composition of Web Services (2007) (16)
Turan-type problems in group testing, coding theory and cryptography (1996) (16)
Separating Interaction Effects Using Locating and Detecting Arrays (2018) (16)
Pairwise Balanced Designs with Block Sizes 8, 9, and 10 (1997) (16)
Partial Covering Arrays: Algorithms and Asymptotics (2016) (16)
The spectrum of support sizes for threefold triple systems (1990) (15)
Finding minimum dominating cycles in permutation graphs (1985) (15)
Partitioning the Edges of a Planar Graph into Two Partial K-Trees (1988) (15)
Covering arrays of strength 3 (1999) (15)
Embedding path designs into kite systems (2005) (15)
Analysis and synthesis problems for network resilience (1993) (15)
Improving Two Recursive Constructions for Covering Arrays (2012) (15)
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs (1995) (15)
Kirkman triple systems of order 21 with nontrivial automorphism group (2002) (15)
Partial Steiner Triple Systems with Equal-Sized Holes (1995) (14)
Thwarts in transversal designs (1995) (14)
The BioIntelligence Framework: a new computational platform for biomedical knowledge computing (2013) (14)
Supplement to Steiner Triple Systems of Order 19 with Nontrivial Automorphism Group (1992) (14)
Hybrid triple systems and cubic feedback sets (1989) (14)
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index (2003) (14)
Two‐stage algorithms for covering array construction (2016) (14)
Reliability polynomials can cross twice (1993) (14)
Locating one pairwise interaction: Three recursive constructions (2016) (14)
Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-UserCommunication Systems (2000) (14)
Constructing Perfect Hash Families Using a Greedy Algorithm (2008) (14)
Quorum Systems Constructed from Combinatorial Designs (2001) (13)
A Combinatorial Approach to X-Tolerant Compaction Circuits (2010) (13)
Network reliability: Heading out on the highway (2020) (13)
Constructing interaction test suites with greedy algorithms (2005) (13)
Farey Series and Maximal Outerplanar Graphs (1982) (13)
The spectrum for rotational Steiner triple systems (1996) (12)
Orthogonal Arrays of Index More Than One (2006) (12)
On a Combinatorial Framework for Fault Characterization (2018) (12)
Projective planes and congestion-free networks (2002) (12)
Greedy Colourings of Steiner Triple Systems (1983) (12)
The Analysis of Directed Triple Systems by Refinement (1982) (12)
ATLAS: Adaptive Topology- and Load-Aware Scheduling (2013) (12)
A recursive construction for perfect hash families (2009) (12)
Geometry, Combinatorial Designs and Related Structures: Rosa triple systems (1997) (11)
Optimal Memoryless Encoding for Low Power Off-Chip Data Buses (2006) (11)
Frameproof codes and compressive sensing (2010) (11)
Computing the Chromatic Index of Steiner Triple Systems (1982) (11)
Trails of triples in partial triple systems (2012) (11)
Network reliability and the probabilistic estimation of damage from fire spread (1994) (11)
Grade of Service Steiner Trees in Series-Parallel Networks (2000) (11)
The CRC Handbook of (2006) (11)
Multiplicative improvements in network reliability bounds (1989) (11)
Renormalization of two - terminal reliability (1993) (11)
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm (2015) (11)
Algorithms for covering arrays (2006) (11)
Just-in-Time Online Scheduling for WDM EPONs (2007) (10)
Weakly union-free twofold triple systems (1997) (10)
Transitive Steiner and Kirkman triple systems of order 27 (1992) (10)
Conditional expectation algorithms for covering arrays (2014) (10)
Linear hash families and forbidden configurations (2009) (10)
The Spectrum of Orthogonal Steiner Triple Systems (1994) (10)
Compressed Sensing With Combinatorial Designs: Theory and Simulations (2015) (10)
Assessing Reliability of Multistage Interconnection Networks (1993) (10)
Combinatorial design theory (1987) (10)
Dynamic spectrum utilization in ad hoc networks (2004) (10)
Access balancing in storage systems by labeling partial Steiner systems (2019) (10)
Expected time to detection of interaction faults (2013) (9)
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation (2013) (9)
Ternary Schedules for Energy-Limited Sensor Networks (2007) (9)
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 (2011) (9)
Concurrent Transmissions in Broadcast Networks (1984) (9)
Grooming for two-period optical networks (2008) (9)
Equireplicate Balanced Binary Codes for Oligo Arrays (2001) (9)
Constructions for difference triangle sets (1997) (9)
Optical grooming with grooming ratio eight (2009) (9)
Support Sizes of Triple Systems (1992) (9)
Element neighbourhoods in twofold triple systems (1987) (9)
The Computational Complexity of Decomposing Block Designs (1985) (9)
Steiner triple systems with disjoint or intersecting subsystems (2000) (9)
Finding Interaction Faults Adaptively Using Distance-Based Strategies (2011) (9)
Pooling, lattice square, and union jack designs (1999) (9)
Some Empirical Observations on Program Behavior with Applications to Program Restructuring (1985) (9)
Concerning difference families with block size four (1994) (9)
An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits (1985) (9)
Support sizes of sixfold triple systems (1993) (8)
Pairwise Balanced Designs with Block Sizes Three and Four (1991) (8)
Coloring Block Designs is NP-Complete (1982) (8)
Multiterminal resilience for series-parallel networks (2007) (8)
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability (1980) (8)
A Steiner 2-design with an automorphism fixing exactly r + 2 points (1999) (8)
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing (2018) (8)
Cohen-Macaulay Rings in Network Reliability (1996) (8)
Spanning sets and scattering sets in Steiner triple systems (1991) (8)
Consecutive cuts and paths, and bounds on k-terminal reliability (1995) (8)
Graph designs for the eight-edge five-vertex graphs (2009) (8)
Series-parallel subgraphs of planar graphs (1992) (8)
Indecomposable 1-factorizations of the complete multigraph (1985) (8)
Scheduled persistence for medium access control in sensor networks (2004) (8)
Using and abusing bounds for network reliability (1990) (8)
Minimum embedding of Steiner triple systems into (K4-e)-designs I (2008) (8)
BRADFORD-ZIPF PHENOMENA IN COMPUTER SYSTEMS. (1982) (8)
Progressive ranking and composition of Web services using covering arrays (2005) (8)
Grooming for two‐period optical networks (2008) (8)
Chip firing and all-terminal network reliability bounds (2009) (8)
Analysis of large-scale experimental data from wireless networks (2018) (7)
Equitable Embeddings of Steiner Triple Systems (1996) (7)
The spectrum of maximal partial steiner triple systems (1993) (7)
Cluttered Orderings for the Complete Graph (2001) (7)
Repeated edges in 2-factorizations (1990) (7)
A golf design of order 11 (1997) (7)
Topology transparent scheduling, synchronization, and maximum delay (2004) (7)
Orthogonal Arrays of Strength Three from Regular 3-Wise Balanced Designs (2002) (7)
Percentages in pairwise balanced designs (1989) (7)
Variable Weight Sequences for Adaptive Scheduled Access in MANETs (2012) (7)
The Computational Complexity of Finding Subdesigns in Combinatorial Designs (1985) (7)
Steiner loops satisfying Moufang's theorem (2015) (7)
The number oft-wise balanced designs (1991) (7)
The strong chromatic number of partial triple systems (1988) (7)
Steiner triple systems as multiple erasure correcting codes in large disk arrays (2000) (7)
Suitable Permutations, Binary Covering Arrays, and Paley Matrices (2015) (7)
Leaves, excesses and neighbourhoods in triple systems (1991) (7)
The fine structure of threefold triple systems: v≡5(mod 6) (1991) (7)
Perfect hash families (2006) (6)
Partitioning Steiner triple systems into complete arcs (1991) (6)
Intersections and supports of quadruple systems (1991) (6)
Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda (1984) (6)
Transversal Designs of Block Size Eight and Nine (1996) (6)
More Thwarts in Transversal Designs (1996) (6)
Deciding Hadamard equivalence of Hadamard matrices (1981) (6)
Algebraic design theory and Hadamard matrices : ADTHM, Lethbridge, Alberta, Canada, July 2014 (2015) (6)
Ladder orderings of pairs and RAID performance (2004) (6)
The Existence of Well‐Balanced Triple Systems (2016) (6)
Colouring steiner quadruple systems (1982) (6)
Fully gated graphs: Recognition and convex operations (2008) (6)
The fine structure of threefold triple systems: u = 1 or 3 (mod 6) (1991) (6)
Egalitarian Steiner triple systems for data popularity (2021) (6)
Mixed covering arrays of strength three with few factors (2011) (6)
Kotzig Factorizations: Existence and Computational Results (1982) (6)
Strengthening hash families and compressive sensing (2012) (6)
Apples and oranges: comparing schedule- and contention-based medium access control (2010) (5)
Design Theory: Antiquity to 1950 (2006) (5)
Supports of (ν,4,2) designs (1991) (5)
Counting Subwords and Regular Languages (2018) (5)
The Complexity of Symmetrizing Matrices (1979) (5)
Topology-transparent schedules for energy limited ad hoc networks (2006) (5)
Sequence Covering Arrays and Linear Extensions (2014) (5)
Orthogonal resolutions of triple systems (1995) (5)
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4 (2009) (5)
A Combinatorial Study of the Reliability Plynomial (1986) (5)
A note on bounds on the minimum area of convex lattice polygons (1992) (5)
Directed star decompositions of the complete directed graph (1992) (5)
Youden Squares and Generalized Youden Designs (2006) (5)
Winning the Lottery (1996) (5)
Partitioned Search with Column Resampling for Locating Array Construction (2019) (5)
Lower bounds for two-period grooming via linear programming duality (2008) (5)
Profiles of covering arrays of strength two (2013) (5)
Dominated error correcting codes with distance two (2002) (5)
Subspace restrictions and affine composition for covering perfect hash families (2018) (5)
Directed complete bipartite graph decompositions: Indirect constructions (2008) (5)
RELIABILITY BOUNDS FOR NETWORKS WITH STATISTICAL DEPENDENCE. (1986) (5)
Reliable assignments of processors to tasks and factoring on matroids (1993) (5)
A Set System Polynomial with Colouring and Reliability Applications (1988) (5)
Optimum Communication Spanning Trees in Series-Parallel Networks (1985) (5)
TOWARDS AN INTRINSIC MEASURE OF PROGRAM LOCALITY. (1983) (5)
Steiner Triple Systems with High Chromatic Index (2017) (5)
Network reliability: Numbers or insight? (1991) (5)
Augmentation of Covering Arrays of Strength Two (2015) (4)
Weakly union-free maximum packings (1999) (4)
Concepts of Network Reliability (2011) (4)
The Existence of (K2 × K6)-Designs (2013) (4)
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract) (1993) (4)
Multiterminal measures for network reliability and resilience (2009) (4)
Ovals and hyperovals in nets (2005) (4)
Point Code Minimum Steiner Triple Systems (1998) (4)
Steiner Loops Satisfying the Statement of Moufang's Theorem (2015) (4)
Grooming Traffic to Maximize Throughput in SONET Rings (2011) (4)
The configuration polytope of ℓ-line configurations in Steiner triple systems (2009) (4)
Transformations on channel graphs (1993) (4)
Post-optimization: necessity analysis for combinatorial arrays (2011) (4)
Topological Persistence for Medium Access Control (2013) (4)
Variable-weight topology-transparent scheduling (2017) (4)
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses (2015) (4)
Wang tilings and distributed verification on anonymous torus networks (2007) (4)
Transversal Designs in Classical Planes and Spaces (2000) (4)
Ordering disks for double erasure codes (2001) (4)
Popularity Block Labelling for Steiner Systems (2020) (4)
Improved Strength Four Covering Arrays with Three Symbols (2015) (4)
Optical grooming with grooming ratio nine (2011) (3)
Resolvable Covering Arrays (2013) (3)
Egalitarian Edge Orderings of Complete Graphs (2021) (3)
Failed disk recovery in double erasure RAID arrays (2007) (3)
The Complexity of Combinatorial Isomorphism Problems (1980) (3)
NS1D0 Sequences and Anti-Pasch Steiner Triple Systems (2002) (3)
FAITHFUL ENCLOSING OF TRIPLE SYSTEMS: DOUBLING THE INDEX (1991) (3)
On Implementing an Environment for Investigating Network reliability (1992) (3)
Deleting Lines in Projective Planes (1998) (3)
Directed star decompositions of directed multigraphs (1991) (3)
Covering arrays and perfect hash families (2005) (3)
Partitions into Indecomposable Triple Systems (1987) (3)
Minimum weights of point codes of Steiner triple systems (2001) (3)
Algorithms in combinatorial design theory (1985) (3)
Simple neighbourhoods in triple systems (1989) (3)
Existence of six incomplete MOLS (1995) (3)
Block Sizes in Pairwise Balanced Designs (1984) (3)
Minimum embedding of Steiner triple systems into (K4-e)-designs II (2009) (3)
Multi-Terminal Network Connectedness on Series-Parallel Networks (2009) (3)
D-Optimal Designs with Interaction Coverage (2009) (3)
Bounding flow-performance in probabilistic weighted networks (1997) (3)
Balanced Steiner Triple Systems (1997) (3)
Multiterminal resilience for series‐parallel networks (2007) (3)
Cubic Neighbourhoods in Triple Systems (1987) (3)
Probabilistic single processor scheduling (1990) (2)
Decomposition of block designs: Computational issues (1983) (2)
Networks and Reliability in Maple (1992) (2)
The Leggett bounds for network reliability (1985) (2)
Transport schemes for topology-transparent scheduling (2007) (2)
Efficient Conditional Expectation Algorithms for Constructing Hash Families (2011) (2)
In-Parameter-Order strategies for covering perfect hash families (2022) (2)
Randomized Post-optimization for t-Restrictions (2013) (2)
Detecting Arrays for Main Effects (2019) (2)
COMPUTING RELIABILITY FOR A GENERALIZATION OF SERIES-PARALLEL NETWORKS. (1982) (2)
ON A PROBLEM OF HARTMAN AND HEINRICH CONCERNING PAIRWISE BALANCED DESIGNS WITH HOLES ∗ (2007) (2)
A Recursive Construction For Regular Difference Triangle Sets (2005) (2)
Extending the Concept of Decomposability for Triple Systems (1988) (2)
Opening the door (2006) (2)
Covering arrays, augmentation, and quilting arrays (2014) (2)
Set-Codes with Small Intersections and Small Discrepancies (2019) (2)
A Note on Bounding k-Terminal Reliability 1 (2)
Realizing airtime allocations in multi-hop Wi-Fi networks: A stability and convergence study with testbed evaluation (2019) (2)
Automorphisms of directed triple systems (1991) (2)
A hierarchical framework for recovery in compressive sensing (2018) (2)
Constructions of optimal orthogonal arrays with repeated rows (2018) (2)
Bounds for All-Terminal Reliability in Planar Networks (1987) (2)
Uniform Orthogonal Group Divisible Designs with Block Size Three (1996) (2)
Performability analysis of large-scale packet switching networks (1992) (2)
Bounding Network Parameters by Approximating Graphs (1989) (2)
F-vectors of Pure Complexes and Pure Multicomplexes of Rank Three (2014) (2)
2011 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems ECBS 2011 (2011) (2)
Generalized Cover-Free Families for Topology-Transparent Channel Assignment (2007) (2)
Tight 4-factor orthogonal main effect plans (1998) (2)
Resolving P(v, 3, λ) designs into regular P3-configurations (2003) (2)
Perfect Hash Families: The Generalization to Higher Indices (2020) (2)
Lower bounds on multiple sequence alignment using exact 3-way alignment (2007) (2)
New bounds on the maximum size of Sperner partition systems (2018) (2)
Generating sets in Steiner triple systems (2000) (2)
Other Combinatorial Designs (2006) (1)
Group divisible covering designs with block size four (2018) (1)
Combinatorics Advances (2014) (1)
Truncated D-Optimal Designs for Screening Experiments (2008) (1)
Complete Arcs in Steiner Triple Systems (1997) (1)
Triangulations and a generalization of Bose's method (2001) (1)
Concerning difference matrices (1996) (1)
Computational Issues in Network Reliability (2008) (1)
Distributing hash families with few rows (2019) (1)
Block-transitive designs (2006) (1)
Lower bounds for two‐period grooming via linear programming duality (2008) (1)
The 3-GDDs of type $g^3u^2$ (2016) (1)
Conflict-free access to constant-perimeter, rectangular, subarrays (1994) (1)
Problem 94 (1988) (1)
Representing Surfaces Using Polygons (1999) (1)
Grooming traffic to minimize load (2012) (1)
Renewal Networks: Connectivity and Reachability on a Time Interval (1991) (1)
Completing the spectrum of rotational Mendelsohn triple systems (1998) (1)
Securing dynamic spectrum use (2004) (1)
Genetic algorithms for affine transformations to existential t-restrictions (2019) (1)
Non-Stanley bounds for network reliability (1996) (1)
Algorithmic methods for covering arrays of higher index (2022) (1)
On a latin square problem of fuchs (2018) (1)
Multiple Access Communications Using Combinatorial Designs (2000) (1)
Neighbor designs and m-wheel systems (1991) (1)
On Directed Incomplete Transversal Designs with Block Size Five (1998) (1)
Balanced and Swap-Robust Trades for Dynamical Distributed Storage (2022) (1)
On the maximum double independence number of Steiner triple systems (2020) (1)
A note on boundingk-terminal reliability (1992) (1)
Concerning multiplier automorphisms of cyclic Steiner triple systems (1992) (1)
Compressed sensing and designs: theory and simulations (2015) (1)
Threshold Channel Graphs (1993) (1)
Detecting and Locating Interaction Faults (2006) (1)
Coding, Cryptography, and Computer Security - Preface (2000) (0)
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm (2015) (0)
Maximizing theMean NumberofCommunicating Vertex Pairs inSeries-Parallel Networks (1986) (0)
ASYMPTOTIC AND CONSTRUCTIVE BOUNDS FOR HASH FAMILIES (2018) (0)
Construction techniques for anti-PaschSteiner Triple (1997) (0)
Requirements on Locating Arrays in Practical Experimentation (2019) (0)
Bounding techniques for the reliability of multistage interconnection networks (1993) (0)
Supplement to Transitive Steiner and Kirkman Triple Systems of Order 27 (1992) (0)
Egalitarian Steiner quadruple systems of doubly even order (2022) (0)
Kirkman Triple Systems of Orders 27 , 33 , and 39 (2007) (0)
The forth national conference on combinatorial designs and their applications Program 2012 (2012) (0)
Conditional Reliability and the Identification of Communities Final Report (2009) (0)
Designs and graphs (1992) (0)
The Existence of (K2 × K6)-Designs (2012) (0)
Preface: In Honour of Ronald C. Mullin (2002) (0)
The spectrum of resolvable Bose triple systems (2023) (0)
A Parallelization of Miller's n^log n Isomorphism Technique (1992) (0)
(M, S)-optimal designs with block size three (2001) (0)
Conflict-Free Access for the Collections of Templates (1993) (0)
Hash Families and Covering Arrays ( Extended (2010) (0)
Sets of mutually orthogoval projective and affine planes (2022) (0)
Discrete Structures and Applications The 3-GDDs of type g 3 u 2 Research Article (2016) (0)
On uncollapsing three factor orthogonal main effect plans (1998) (0)
SomeEmpirical Observations on ProgramBehavior withApplications toProgramRestructuring (1985) (0)
Orthogonal arrays of strength more than two (2006) (0)
Optimization University of Waterloo Waterloo , Ontario N 2 L 3 G 1 Canada (2003) (0)
Spatial/Temporal Back-off Mechanism for Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) Medium Access Control Protocols for Wireless Networks (2005) (0)
Other combinatorial structures (2013) (0)
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses (2015) (0)
NETWORK RELIABILITY: NEW BOUNDS FROM OLD. (1985) (0)
Mixed covering arrays on graphs of small treewidth (2021) (0)
Augmentation of Covering Arrays of Strength Two (2015) (0)
Rateless Forward Error Correction as a Data Link Layer Mechanism in Lossy Networks (2004) (0)
Cover-Free Families and Topology-Transparent Communication (2005) (0)
Grooming in Unidire tional Rings : K 4 � (2007) (0)
Ideals , varieties , stability , colorings and combinatorial designs ∗ (2008) (0)
There Must be Fifty Ways to Miss a Cover (2019) (0)
Optimal Memoryless Encoding forLowPowerOff-Chip DataBuses (2006) (0)
The complexity of graph isomorphism and related problems (1980) (0)
N ( n ) and ν ( n ) : Similarities and Differences (2017) (0)
The notion of a monotonic directed design ( v , k , 1 )-MDD was introduced to construct difference triangle sets in (0)
Directing and Orienting Triple Systems (1987) (0)
Fractal Perfect Hash Families (Extended Abstract) (2018) (0)
Optical Communications and Networking (2011) (0)
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019) (2020) (0)
Hierarchical Recovery in Compressive Sensing (2014) (0)
Constructing heterogeneous hash families by puncturing linear transversal designs (2011) (0)
Algorithm for Continuous Distributed Lexicographic Max-Min Resource Allocation (2013) (0)
Robustness of Recovery in Locating Array-Based Screening Experiments (2019) (0)
Book reviews (1993) (0)
N(n), v(n): Similarities and Differences (1996) (0)
Boolean Aspects of Network Reliability (2010) (0)
Algorithms for Constructing Anonymizing Arrays (2020) (0)
On a Combinatorial Framework for Fault Characterization (2018) (0)
Conditional Reliability and the Identification of Communities (2009) (0)
Scalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects (2008) (0)
Asymptotic and constructive methods for covering perfect hash families and covering arrays (2017) (0)
Asymptotic Existence of Tight Orthogonal Main Effect Plans (1998) (0)
Program of Scientific Activity of the Catania Combinatorial Group (2003) (0)
Improved Strength Four Covering Arrays with Three Symbols (2017) (0)
Reliability of Large Scale Disk Arrays (2001) (0)
Preface (2003) (0)
Testbed Evaluation of Optimized REACT over Multi-hop Paths (2018) (0)
Book reviewElements of the theory of computation : By H. R. Lewis and C. H. Papadimitriou. Prentice-Hall, Englewood Cliffs, New Jersey 1981. 466 pp. (1982) (0)
Trails of triples in partial triple systems (2011) (0)
On Choosability and Paintability of Graphs by Ran Wang A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Approved April 2015 by the Graduate Supervisory Committee: H.A. Kierstead, Chair (2015) (0)
Faithful Enclosing of Triple Systems: A Generalization of Stern’s Theorem (2017) (0)
Abstracts for talks to be presented in the CCCS 98 Workshop Instructional Lectures (2004) (0)
Partial Covering Arrays: Algorithms and Asymptotics (2017) (0)
Block designs (2013) (0)
Preface (1991) (0)
Covering strong separating hash families (2020) (0)

This paper list is powered by the following services:

Other Resources About Charles Colbourn

en.wikipedia.org

What Schools Are Affiliated With Charles Colbourn?

Charles Colbourn is affiliated with the following schools:

Charles Colbourn's Academic­Influence.com Rankings

Why Is Charles Colbourn Influential?

Charles Colbourn's Published Works

Published Works

Other Resources About Charles Colbourn

What Schools Are Affiliated With Charles Colbourn?

Charles Colbourn's AcademicInfluence.com Rankings