Charles J. Colbourn

From MaRDI portal
Person:168193

Available identifiers

zbMath Open colbourn.charles-jWikidataQ92704 ScholiaQ92704MaRDI QIDQ168193

List of research outcomes

PublicationDate of PublicationType
On the maximum double independence number of Steiner triple systems2024-01-31Paper
Bussey systems and Steiner's tactical problem2024-01-31Paper
https://portal.mardi4nfdi.de/entity/Q61823782024-01-25Paper
Network reliability: Heading out on the highway2023-12-11Paper
Detecting arrays for effects of single factors2023-11-10Paper
The spectrum of resolvable Bose triple systems2023-05-15Paper
Network reliability2023-04-28Paper
Algorithms for Constructing Anonymizing Arrays2022-10-13Paper
Egalitarian Steiner quadruple systems of doubly even order2022-05-17Paper
Mixed covering arrays on graphs of small treewidth2022-03-17Paper
Perfect hash families: the generalization to higher indices2021-10-04Paper
Egalitarian Steiner triple systems for data popularity2021-10-04Paper
Egalitarian edge orderings of complete graphs2021-07-28Paper
Covering strong separating hash families2021-06-15Paper
New bounds on the maximum size of Sperner partition systems2021-02-08Paper
https://portal.mardi4nfdi.de/entity/Q51336592020-11-10Paper
Access balancing in storage systems by labeling partial Steiner systems2020-10-21Paper
Set-Codes with Small Intersections and Small Discrepancies2020-06-09Paper
Detecting arrays for main effects2020-04-29Paper
Two‐stage algorithms for covering array construction2019-12-12Paper
Distributing hash families with few rows2019-11-13Paper
https://portal.mardi4nfdi.de/entity/Q52411202019-10-30Paper
https://portal.mardi4nfdi.de/entity/Q52411212019-10-30Paper
Subspace restrictions and affine composition for covering perfect hash families2019-10-02Paper
Resolvable covering arrays2019-08-27Paper
Optimality and constructions of locating arrays2019-08-27Paper
Improving two recursive constructions for covering arrays2019-08-27Paper
Constructions of optimal orthogonal arrays with repeated rows2019-07-18Paper
https://portal.mardi4nfdi.de/entity/Q46140412019-01-30Paper
Counting subwords and regular languages2018-11-22Paper
On a combinatorial framework for fault characterization2018-11-01Paper
Assessing reliability of multistage interconnection networks2018-09-14Paper
Separating interaction effects using locating and detecting arrays2018-09-06Paper
Partial covering arrays: algorithms and asymptotics2018-08-03Paper
Group divisible covering designs with block size four2018-05-22Paper
Fractal perfect hash families (extended abstract)2018-04-12Paper
Asymptotic and constructive methods for covering perfect hash families and covering arrays2018-04-10Paper
Improved strength four covering arrays with three symbols2018-03-22Paper
A hierarchical framework for recovery in compressive sensing2018-01-11Paper
Steiner Triple Systems with High Chromatic Index2017-11-24Paper
Compressed Sensing With Combinatorial Designs: Theory and Simulations2017-10-19Paper
A Combinatorial Approach to X-Tolerant Compaction Circuits2017-07-27Paper
Upper Bounds on the Size of Covering Arrays2017-06-23Paper
Disjoint Spread Systems and Fault Location2016-10-28Paper
Partial covering arrays: algorithms and asymptotics2016-09-29Paper
Steiner Loops Satisfying the Statement of Moufang's Theorem2016-07-06Paper
Quorums from difference covers2016-06-16Paper
The Existence of Well-Balanced Triple Systems2016-05-24Paper
Suitable Permutations, Binary Covering Arrays, and Paley Matrices2016-01-25Paper
Augmentation of covering arrays of strength two2015-12-17Paper
https://portal.mardi4nfdi.de/entity/Q34514492015-11-16Paper
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses2015-10-26Paper
https://portal.mardi4nfdi.de/entity/Q31950922015-10-21Paper
Sequence Covering Arrays and Linear Extensions2015-09-15Paper
Covering and packing for pairs2015-06-19Paper
https://portal.mardi4nfdi.de/entity/Q29277632014-11-04Paper
Covering arrays, augmentation, and quilting arrays2014-09-29Paper
Sequence Covering Arrays2014-04-10Paper
\(f\)-vectors of pure complexes and pure multicomplexes of rank three2014-01-27Paper
https://portal.mardi4nfdi.de/entity/Q28665622013-12-13Paper
The existence of \((K_2\times K_6)\)-designs2013-09-26Paper
Doubly Resolvable Nearly Kirkman Triple Systems2013-08-13Paper
https://portal.mardi4nfdi.de/entity/Q53270642013-08-01Paper
Randomized Post-optimization for t-Restrictions2013-04-09Paper
Strengthening hash families and compressive sensing2013-01-18Paper
Trails of triples in partial triple systems2012-11-28Paper
Randomized post-optimization of covering arrays2012-11-15Paper
Variable Weight Sequences for Adaptive Scheduled Access in MANETs2012-09-07Paper
Constructing heterogeneous hash families by puncturing linear transversal designs2012-04-12Paper
Cover starters for covering arrays of strength two2012-03-16Paper
Efficient Conditional Expectation Algorithms for Constructing Hash Families2012-01-13Paper
Grooming traffic to minimize load2012-01-11Paper
Mixed covering arrays of strength three with few factors2011-08-01Paper
https://portal.mardi4nfdi.de/entity/Q30008932011-05-31Paper
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 192011-05-10Paper
D-optimal designs with interaction coverage2011-04-18Paper
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 42011-04-15Paper
https://portal.mardi4nfdi.de/entity/Q30816342011-03-09Paper
Optical grooming with grooming ratio nine2011-01-07Paper
Covering and radius-covering arrays: constructions and classification2010-10-11Paper
Properties of the Steiner triple systems of order 192010-08-12Paper
Covering arrays from cyclotomy2010-05-19Paper
A recursive construction for perfect hash families2010-05-06Paper
Optical grooming with grooming ratio eight2010-04-28Paper
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven2010-03-17Paper
Graph designs for the eight-edge five-vertex graphs2009-12-15Paper
Randomized Postoptimization of Covering Arrays2009-12-11Paper
Chip firing and all-terminal network reliability bounds2009-11-23Paper
Small stopping sets in Steiner triple systems2009-10-26Paper
MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS2009-09-22Paper
Truncated D-Optimal Designs for Screening Experiments2009-08-03Paper
Binary Covering Arrays and Existentially Closed Graphs2009-07-23Paper
Merging covering arrays and compressing multiple sequence alignments2009-06-24Paper
Linear hash families and forbidden configurations2009-03-31Paper
Scalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects2009-03-09Paper
Constructing Perfect Hash Families Using a Greedy Algorithm2009-03-09Paper
The configuration polytope of ℓ-line configurations in Steiner triple systems2009-02-09Paper
Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II2009-01-28Paper
Fully gated graphs: Recognition and convex operations2009-01-27Paper
Minimum embedding of Steiner triple systems into \((K4-e)\)-designs. I2009-01-27Paper
Sequence Designs for Ultra-Wideband Impulse Radio With Optimal Correlation Properties2008-12-21Paper
Optimal Frequency-Hopping Sequences Via Cyclotomy2008-12-21Paper
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares2008-12-21Paper
Ternary Schedules for Energy-Limited Sensor Networks2008-12-21Paper
Lower bounds for two-period grooming via linear programming duality2008-12-17Paper
Grooming for two-period optical networks2008-12-17Paper
Tabu search for covering arrays using permutation vectors2008-11-06Paper
Constructing strength three covering arrays with augmented annealing2008-05-29Paper
Failed disk recovery in double erasure RAID arrays2008-05-16Paper
Locating and detecting arrays for interaction faults2008-04-23Paper
Transport schemes for topology-transparent scheduling2008-02-18Paper
Strength two covering arrays: existence tables and projection2008-02-14Paper
Directed complete bipartite graph decompositions: indirect constructions2008-01-30Paper
Multiterminal resilience for series‐parallel networks2007-09-21Paper
https://portal.mardi4nfdi.de/entity/Q35940482007-08-07Paper
Perfect Hash Families: Constructions and Existence2007-07-27Paper
Detecting and Locating Interaction Faults2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34247112007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34247122007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34247142007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34247192007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34247262007-03-05Paper
Renewal Networks: Connectivity and Reachability on a Time Interval2007-01-19Paper
Roux-type constructions for covering arrays of strengths three and four2006-11-22Paper
https://portal.mardi4nfdi.de/entity/Q54883792006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883902006-09-14Paper
On constant composition codes2006-06-09Paper
Covering arrays of higher strength from permutation vectors2006-06-06Paper
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 62006-06-01Paper
Products of mixed covering arrays of strength two2006-05-16Paper
https://portal.mardi4nfdi.de/entity/Q57104342005-12-02Paper
Embedding path designs into kite systems2005-09-22Paper
A Recursive Construction For Regular Difference Triangle Sets2005-09-16Paper
https://portal.mardi4nfdi.de/entity/Q54614782005-07-26Paper
Ovals and hyperovals in nets2005-06-23Paper
https://portal.mardi4nfdi.de/entity/Q46779872005-05-23Paper
Recursive constructions for optimal (n,4,2)-OOCs2005-01-12Paper
Grooming in unidirectional rings: \(K_{4}-e\) designs2004-08-20Paper
Constructions for permutation codes in powerline communications2004-08-16Paper
Cover-free families and topology-transparent scheduling for MANETs2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q47368792004-08-11Paper
Preface (to the special issue in honor of Zhu Lie's 60th birthday)2004-03-29Paper
Optimal \((n,4,2)\)-OOC of small orders.2004-03-29Paper
Ladder orderings of pairs and RAID performance.2004-03-29Paper
Concerning seven and eight mutually orthogonal Latin squares2004-03-15Paper
https://portal.mardi4nfdi.de/entity/Q47985142004-02-03Paper
Minimum embedding of P3-designs into (K4?e)-designs2003-11-10Paper
Specialized block-colourings of Steiner triple systems and the upper chromatic index2003-10-16Paper
Optimal and pessimal orderings of Steiner triple systems in disk arrays.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44056502003-06-23Paper
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs2003-03-16Paper
Quorum systems constructed from combinatorial designs2003-01-14Paper
Transversal designs in classical planes and spaces2002-10-13Paper
Dominated error correcting codes with distance two2002-09-29Paper
https://portal.mardi4nfdi.de/entity/Q45513812002-09-05Paper
Projective planes and congestion-free networks2002-08-29Paper
Orthogonal arrays of strength three from regular 3-wise balanced designs2002-05-20Paper
Triangulations and a generalization of Bose's method2002-05-02Paper
Kirkman triple systems of order 21 with nontrivial automorphism group2002-03-19Paper
https://portal.mardi4nfdi.de/entity/Q27775052002-03-07Paper
Minimum weights of point codes of Steiner triple systems2002-01-21Paper
Mutually orthogonal Latin squares: A brief survey of constructions2002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q42636582001-11-22Paper
Equireplicate Balanced Binary Codes for Oligo Arrays2001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45083662001-11-08Paper
https://portal.mardi4nfdi.de/entity/Q27125212001-09-02Paper
Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems2001-08-20Paper
Sharper bounds in adpative group testing2001-07-19Paper
https://portal.mardi4nfdi.de/entity/Q27149122001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q27136422001-06-10Paper
https://portal.mardi4nfdi.de/entity/Q27136512001-06-10Paper
https://portal.mardi4nfdi.de/entity/Q27165132001-05-16Paper
Quintessential pairwise balanced designs2001-01-03Paper
Construction Techniques for Anti-Pasch Steiner Triple Systems2000-12-13Paper
Tight \(4\)-factor orthogonal main effect plans2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q45052712000-09-26Paper
Modified group divisible designs with block size four2000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q44953952000-08-10Paper
https://portal.mardi4nfdi.de/entity/Q49465442000-07-24Paper
https://portal.mardi4nfdi.de/entity/Q49348422000-07-19Paper
https://portal.mardi4nfdi.de/entity/Q42629932000-06-09Paper
A golf design of order 112000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q42694302000-05-18Paper
https://portal.mardi4nfdi.de/entity/Q49457992000-03-23Paper
Weakly union-free maximum packings2000-03-13Paper
Group testing for consecutive positives2000-02-16Paper
Kirkman school project designs2000-01-11Paper
Asymptotically optimal erasure-resilient codes for large disk arrays.2000-01-01Paper
Covering arrays of strength three1999-11-22Paper
Pooling, lattice square, and union jack designs1999-11-11Paper
https://portal.mardi4nfdi.de/entity/Q42563581999-07-11Paper
https://portal.mardi4nfdi.de/entity/Q42282171999-06-30Paper
Bicoloring Steiner triple systems1999-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42481751999-06-03Paper
https://portal.mardi4nfdi.de/entity/Q42218721999-05-16Paper
Weakly union-free twofold triple systems1999-01-14Paper
Point code minimum Steiner triple systems1999-01-14Paper
A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42219181998-12-02Paper
A class of partial triple systems with applications in survey sampling1998-11-25Paper
https://portal.mardi4nfdi.de/entity/Q42175791998-11-11Paper
Completing the spectrum of rotational Mendelsohn triple systems1998-10-28Paper
Asymptotic Existence of Tight Orthogonal Main Effect Plans1998-10-25Paper
https://portal.mardi4nfdi.de/entity/Q43932491998-06-08Paper
More thwarts in transversal designs1998-04-26Paper
Complete arcs in Steiner triple systems1998-04-01Paper
https://portal.mardi4nfdi.de/entity/Q43573481998-03-02Paper
Wang tilings and distributed verification on anonymous torus networks1997-09-07Paper
Existence of incomplete transversal designs with block size five and any index \(\lambda\)1997-08-27Paper
Pairwise balanced designs with block sizes 8, 9, and 101997-08-27Paper
Some direct constructions for incomplete transversal designs1997-07-28Paper
https://portal.mardi4nfdi.de/entity/Q48769301997-06-29Paper
https://portal.mardi4nfdi.de/entity/Q48770001997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q48769841997-06-09Paper
Balanced Steiner triple systems1997-06-04Paper
https://portal.mardi4nfdi.de/entity/Q48581551997-05-28Paper
Pairwise balanced designs with consecutive block sizes1997-05-20Paper
https://portal.mardi4nfdi.de/entity/Q43373551997-05-19Paper
Concerning difference matrices1997-03-23Paper
Cohen–Macaulay Rings in Network Reliability1997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48842151997-02-17Paper
Constructions for difference triangle sets1997-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48769511996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48769241996-11-21Paper
https://portal.mardi4nfdi.de/entity/Q48769291996-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48769911996-11-03Paper
https://portal.mardi4nfdi.de/entity/Q48769981996-11-03Paper
https://portal.mardi4nfdi.de/entity/Q48769481996-08-29Paper
https://portal.mardi4nfdi.de/entity/Q48889031996-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48769941996-07-17Paper
Transversal designs of block size eight and nine1996-07-04Paper
Two Algorithms for Unranking Arborescences1996-06-04Paper
Equitable embeddings of Steiner triple systems1996-05-13Paper
https://portal.mardi4nfdi.de/entity/Q48769271996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48769281996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48769311996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48589591996-04-29Paper
Non-Stanley bounds for network reliability1996-03-17Paper
A new approach to solving three combinatorial enumeration problems on planar graphs1996-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48589601996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48453731996-02-18Paper
https://portal.mardi4nfdi.de/entity/Q48581611995-12-12Paper
https://portal.mardi4nfdi.de/entity/Q48537661995-11-01Paper
Consecutive cuts and paths, and bounds on k‐terminal reliability1995-07-20Paper
Thwarts in transversal designs1995-05-04Paper
The complexity of computing the Tutte polynomial on transversal matroids1995-05-04Paper
Concerning difference families with block size four1995-05-03Paper
Anti-mitre Steiner triple systems1995-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46975771995-05-01Paper
https://portal.mardi4nfdi.de/entity/Q47633321995-04-11Paper
Partial Steiner triple systems with equal-sized holes1995-04-04Paper
The Spectrum of Orthogonal Steiner Triple Systems1995-03-20Paper
Reliability polynomials can cross twice1995-01-08Paper
Analysis and synthesis problems for network resilience1994-12-04Paper
Network reliability and the probabilistic estimation of damage from fire spread1994-12-01Paper
https://portal.mardi4nfdi.de/entity/Q43019171994-11-27Paper
https://portal.mardi4nfdi.de/entity/Q31397381994-10-31Paper
On the log concavity of reliability and matroidal sequences1994-07-03Paper
Threshold Channel Graphs1994-04-28Paper
https://portal.mardi4nfdi.de/entity/Q42880811994-04-21Paper
Transformations on channel graphs1994-01-16Paper
Computing residual connectedness reliability for restricted networks1993-11-28Paper
https://portal.mardi4nfdi.de/entity/Q31369781993-11-01Paper
Reliable assignments of processors to tasks and factoring on matroids1993-10-24Paper
The spectrum of maximal partial Steiner triple systems1993-08-29Paper
Renormalization of two—terminal reliability1993-08-23Paper
Network transformations and bounding network reliability1993-06-29Paper
Support sizes of sixfold triple systems1993-06-20Paper
https://portal.mardi4nfdi.de/entity/Q40353591993-05-18Paper
Roots of the Reliability Polynomials1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40261461993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40261521993-02-21Paper
Support sizes of triple systems1993-01-17Paper
Series-Parallel Bounds for the Two-Terminal Reliability Problem1993-01-17Paper
Directed star decompositions of the complete directed graph1993-01-17Paper
Series-parallel subgraphs of planar graphs1993-01-17Paper
A parallelization of Miller's \(n^{\log n}\) isomorphism technique1993-01-16Paper
Concerning multiplier automorphisms of cyclic Steiner triple systems1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171791993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171931993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40146251992-10-18Paper
https://portal.mardi4nfdi.de/entity/Q40142971992-10-06Paper
Pairwise Balanced Designs with Block Sizes Three and Four1992-09-27Paper
Steiner triple systems of order 19 with nontrivial automorphism group1992-09-27Paper
The fine structure of threefold triple systems: \(v\equiv 1 \text{ or }3\pmod 6\)1992-06-28Paper
Intersections and supports of quadruple systems1992-06-28Paper
Directed star decompositions of directed multigraphs1992-06-28Paper
A new class of group divisible designs with block size three1992-06-28Paper
A note on bounding \(k\)-terminal reliability1992-06-28Paper
Transitive Steiner and Kirkman Triple Systems of Order 271992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39879501992-06-28Paper
Combinatorial aspects of network reliability1992-06-27Paper
The number of \(t\)-wise balanced designs1992-06-27Paper
Unit disk graphs1992-06-25Paper
Permutation graphs: Connected domination and Steiner trees1992-06-25Paper
Spanning sets and scattering sets in Steiner triple systems1992-06-25Paper
Partitioning Steiner triple systems into complete arcs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39741511992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39746961992-06-25Paper
Neighbor designs and m-wheel systems1991-01-01Paper
Network reliability: Numbers or insight? (A discussion paper)1991-01-01Paper
Automorphisms of directed triple systems1991-01-01Paper
Probabilistic single processor scheduling1990-01-01Paper
On two dual classes of planar graphs1990-01-01Paper
The spectrum of support sizes for threefold triple systems1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31978301990-01-01Paper
Efficient algorithms for computing the reliability of permutation and interval graphs1990-01-01Paper
Locating A Broadcast Facility In An Unreliable Network1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57508651990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33608751990-01-01Paper
Combining monte carlo estimates and bounds for network reliability1990-01-01Paper
Repeated edges in 2-factorizations1990-01-01Paper
Simple neighbourhoods in triple systems1989-01-01Paper
Percentages in pairwise balanced designs1989-01-01Paper
Matroid Steiner problems, the Tutte polynomial and network reliability1989-01-01Paper
Hybrid triple systems and cubic feedback sets1989-01-01Paper
Computing 2-terminal reliability for radio-broadcast networks1989-01-01Paper
Unranking and ranking spanning trees of a graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900051989-01-01Paper
Multiplicative improvements in network reliability bounds1989-01-01Paper
The strong chromatic number of partial triple systems1988-01-01Paper
Problem 941988-01-01Paper
Edge-packings of graphs and network reliability1988-01-01Paper
Edge-coloured designs with block size four1988-01-01Paper
Lower bounds on two-terminal network reliability1988-01-01Paper
A Set System Polynomial with Colouring and Reliability Applications1988-01-01Paper
The complexity of some edge deletion problems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38098101988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38135871988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183501988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38216011988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38325831988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340871988-01-01Paper
Element neighbourhoods in twofold triple systems1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30308481987-01-01Paper
Counting almost minimum cutsets with reliability applications1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37705481987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37780301987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37780321987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37811131987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37811141987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37833171987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37864881987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895761987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895771987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37896141987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37896151987-01-01Paper
Network Resilience1987-01-01Paper
Some NP-complete problems for hypergraph degree sequences1986-01-01Paper
Quadratic leaves of maximal partial triple systems1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30270231986-01-01Paper
Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 11986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47220821986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37184641986-01-01Paper
Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37827341986-01-01Paper
Improving reliability bounds in computer networks1986-01-01Paper
Minimizing setups in ordered sets of fixed width1985-01-01Paper
Finding minimum dominating cycles in permutation graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30267111985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30431601985-01-01Paper
The Leggett bounds for network reliability1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841501985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36928651985-01-01Paper
Optimum Communication Spanning Trees in Series-Parallel Networks1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36997161985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37054661985-01-01Paper
The most reliable series-parallel networks1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37243581985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37289121985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37458511985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588691985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37926931985-01-01Paper
Cataloguing the graphs on 10 vertices1985-01-01Paper
The complexity of completing partial Latin squares1984-01-01Paper
A census of regular 3-polystroma arising from honeycombs1984-01-01Paper
Recursive constructions for cyclic block designs1984-01-01Paper
Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\)1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32180701984-01-01Paper
Block Sizes in Pairwise Balanced Designs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33408711984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33440261984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463351984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761581984-01-01Paper
Embedding partial Steiner triple systems is NP-complete1983-01-01Paper
Completing small partial triple systems1983-01-01Paper
Every twofold triple system can be directed1983-01-01Paper
Steiner trees, partial 2–trees, and minimum IFI networks1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33138651983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221481983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33239631983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33294821983-01-01Paper
Greedy Colourings of Steiner Triple Systems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33425831983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36633111983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746751983-01-01Paper
The chromatic index of cyclic Steiner 2-designs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32166601982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47427971982-01-01Paper
Kotzig Factorizations: Existence and Computational Results1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47498451982-01-01Paper
Colouring Steiner quadruple systems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36597991982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36633211982-01-01Paper
The Analysis of Directed Triple Systems by Refinement1982-01-01Paper
Coloring Block Designs is NP-Complete1982-01-01Paper
Farey Series and Maximal Outerplanar Graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39689621982-01-01Paper
Cyclic block designs with block size 31981-01-01Paper
Concerning the complexity of deciding isomorphism of block designs1981-01-01Paper
Deciding Hadamard equivalence of Hadamard matrices1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47481651981-01-01Paper
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs1981-01-01Paper
On testing isomorphism of permutation graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39217621981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569571981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39585061981-01-01Paper
On deciding switching equivalence of graphs1980-01-01Paper
A correction to Colbourn's paper on the complexity of matrix symmetrizability1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38638991980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38851881980-01-01Paper
The Complexity of Combinatorial Isomorphism Problems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39000791980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030161980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030171980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39090581980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39166021980-01-01Paper
The complexity of symmetrizing matrices1979-01-01Paper
Orderly algorithms for graph generation1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863671979-01-01Paper
Orderly algorithms for generating restricted classes of graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39242521979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41707601978-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Charles J. Colbourn