Charles J. Colbourn
According to our database^{1},
Charles J. Colbourn
authored at least 275 papers
between 1979 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at www.idref.fr

at viaf.org

at id.loc.gov

at dnb.info
On csauthors.net:
Bibliography
2018
TestAlgebraBased Fault Location Analysis for the Concurrent Combinatorial Testing.
IEEE Trans. Reliability, 2018
On a Combinatorial Framework for Fault Characterization.
Mathematics in Computer Science, 2018
Improved Strength Four Covering Arrays with Three Symbols.
Graphs and Combinatorics, 2018
Fractal Perfect Hash Families (Extended Abstract).
Electronic Notes in Discrete Mathematics, 2018
Asymptotic and constructive methods for covering perfect hash families and covering arrays.
Des. Codes Cryptography, 2018
A hierarchical framework for recovery in compressive sensing.
Discrete Applied Mathematics, 2018
Testbed Evaluation of Optimized REACT over Multihop Paths.
Proceedings of the Wired/Wireless Internet Communications, 2018
Separating Interaction Effects Using Locating and Detecting Arrays.
Proceedings of the Combinatorial Algorithms  29th International Workshop, 2018
Analysis of largescale experimental data from wireless networks.
Proceedings of the IEEE INFOCOM 2018, 2018
Counting Subwords and Regular Languages.
Proceedings of the Developments in Language Theory  22nd International Conference, 2018
2017
Compressed Sensing With Combinatorial Designs: Theory and Simulations.
IEEE Trans. Information Theory, 2017
Upper Bounds on the Size of Covering Arrays.
SIAM J. Discrete Math., 2017
Steiner Triple Systems with High Chromatic Index.
SIAM J. Discrete Math., 2017
Variableweight topologytransparent scheduling.
Computer Networks, 2017
2016
Disjoint Spread Systems and Fault Location.
SIAM J. Discrete Math., 2016
Partial Covering Arrays: Algorithms and Asymptotics.
Proceedings of the Combinatorial Algorithms  27th International Workshop, 2016
Screening interacting factors in a wireless network testbed using locating arrays.
Proceedings of the IEEE Conference on Computer Communications Workshops, 2016
Coverage, Location, Detection, and Measurement.
Proceedings of the Ninth IEEE International Conference on Software Testing, 2016
2015
A Discrete Particle Swarm Optimization for Covering Array Generation.
IEEE Trans. Evolutionary Computation, 2015
Locating Arrays: A New Experimental Design for Screening Complex Engineered Systems.
Operating Systems Review, 2015
Balancing Frequencies and Fault Detection in the InParameterOrder Algorithm.
J. Comput. Sci. Technol., 2015
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures.
Information & Software Technology, 2015
Augmentation of Covering Arrays of Strength Two.
Graphs and Combinatorics, 2015
Optimal lowpower coding for error correction and crosstalk avoidance in onchip data buses.
Des. Codes Cryptography, 2015
Steiner loops satisfying Moufang's theorem.
Australasian J. Combinatorics, 2015
2014
ATLAS: Adaptive Topology andLoadAware Scheduling.
IEEE Trans. Mob. Comput., 2014
Covering arrays, augmentation, and quilting arrays.
Discrete Math., Alg. and Appl., 2014
fvectors of pure complexes and pure multicomplexes of rank three.
Discrete Mathematics, 2014
Sequence Covering Arrays and Linear Extensions.
Proceedings of the Combinatorial Algorithms  25th International Workshop, 2014
2013
Topological Persistence for Medium Access Control.
IEEE Trans. Mob. Comput., 2013
Sequence Covering Arrays.
SIAM J. Discrete Math., 2013
Covering and packing for pairs.
J. Comb. Theory, Ser. A, 2013
The BioIntelligence Framework: a new computational platform for biomedical knowledge computing.
JAMIA, 2013
The Existence of (K 2 × K 6)Designs.
Graphs and Combinatorics, 2013
Randomized postoptimization of covering arrays.
Eur. J. Comb., 2013
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013
Test algebra for combinatorial testing.
Proceedings of the 8th International Workshop on Automation of Software Test, 2013
Adaptive Fault Detection for Testing Tenant Applications in Multitenancy SaaS Systems.
Proceedings of the 2013 IEEE International Conference on Cloud Engineering, 2013
Randomized Postoptimization for tRestrictions.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013
2012
Strengthening hash families and compressive sensing.
J. Discrete Algorithms, 2012
Cover starters for covering arrays of strength two.
Discrete Mathematics, 2012
Grooming traffic to minimize load.
Discrete Mathematics, 2012
Trails of triples in partial triple systems.
Des. Codes Cryptography, 2012
Variable Weight Sequences for Adaptive Scheduled Access in MANETs.
Proceedings of the Sequences and Their Applications  SETA 2012, 2012
2011
Covering arrays and hash families.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011
Compressive Sensing Matrices and Hash Families.
IEEE Trans. Communications, 2011
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.
Discrete Mathematics, 2011
Optical grooming with grooming ratio nine.
Discrete Mathematics, 2011
Efficient Conditional Expectation Algorithms for Constructing Hash Families.
Proceedings of the Combinatorial Algorithms  22nd International Workshop, 2011
Finding Interaction Faults Adaptively Using DistanceBased Strategies.
Proceedings of the 18th IEEE International Conference and Workshops on the Engineering of ComputerBased Systems, 2011
2010
A combinatorial approach to Xtolerant compaction circuits.
IEEE Trans. Information Theory, 2010
Drop Cost and Wavelength Optimal TwoPeriod Grooming with Ratio 4.
SIAM J. Discrete Math., 2010
Covering arrays from cyclotomy.
Des. Codes Cryptography, 2010
Covering and radiuscovering arrays: Constructions and classification.
Discrete Applied Mathematics, 2010
Properties of the Steiner Triple Systems of Order 19.
Electr. J. Comb., 2010
Apples and oranges: comparing schedule and contentionbased medium access control.
Proceedings of the 13th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2010
2009
A densitybased greedy algorithm for higher strength covering arrays.
Softw. Test., Verif. Reliab., 2009
A recursive construction for perfect hash families.
J. Mathematical Cryptology, 2009
MultiTerminal Network Connectedness on SeriesParallel Networks.
Discrete Math., Alg. and Appl., 2009
Minimum embedding of Steiner triple systems into (K_{4}e)designs II.
Discrete Mathematics, 2009
Graph designs for the eightedge fivevertex graphs.
Discrete Mathematics, 2009
Chip firing and allterminal network reliability bounds.
Discrete Optimization, 2009
Linear hash families and forbidden configurations.
Des. Codes Cryptography, 2009
Merging covering arrays and compressing multiple sequence alignments.
Discrete Applied Mathematics, 2009
Optical grooming with grooming ratio eight.
Discrete Applied Mathematics, 2009
Small stopping sets in Steiner triple systems.
Cryptography and Communications, 2009
Randomized Postoptimization of Covering Arrays.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
Locating and Detecting Arrays for Interaction Faults.
Proceedings of the Search Methodologies, 05.07.  10.07.2009, 2009
Binary Covering Arrays and Existentially Closed Graphs.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009
2008
Rateless forward error correction for topologytransparent scheduling.
IEEE/ACM Trans. Netw., 2008
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.
SIAM J. Discrete Math., 2008
Grooming for twoperiod optical networks.
Networks, 2008
Lower bounds for twoperiod grooming via linear programming duality.
Networks, 2008
Directed complete bipartite graph decompositions: Indirect constructions.
Discrete Mathematics, 2008
Minimum embedding of Steiner triple systems into (K_{4}e)designs I.
Discrete Mathematics, 2008
Fully gated graphs: Recognition and convex operations.
Discrete Mathematics, 2008
Strength two covering arrays: Existence tables and projection.
Discrete Mathematics, 2008
Constructing strength three covering arrays with augmented annealing.
Discrete Mathematics, 2008
2007
Ternary Schedules for EnergyLimited Sensor Networks.
IEEE Trans. Information Theory, 2007
The density algorithm for pairwise interaction testing.
Softw. Test., Verif. Reliab., 2007
Multiterminal resilience for seriesparallel networks.
Networks, 2007
Perfect Hash Families: Constructions and Existence.
J. Mathematical Cryptology, 2007
Failed disk recovery in double erasure RAID arrays.
J. Discrete Algorithms, 2007
Transport schemes for topologytransparent scheduling.
J. Comb. Optim., 2007
Biased covering arrays for progressive ranking and composition of Web Services.
IJSPM, 2007
Lower bounds on multiple sequence alignment using exact 3way alignment.
BMC Bioinformatics, 2007
A carrier sense multiple access protocol with power backoff (CSMA/PB).
Ad Hoc Networks, 2007
JustinTime Online Scheduling for WDM EPONs.
Proceedings of IEEE International Conference on Communications, 2007
Onetestatatime heuristic search for interaction test suites.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007
2006
The effects of synchronization on topologytransparent scheduling.
Wireless Networks, 2006
Prioritized interaction testing for pairwise coverage with seeding and constraints.
Information & Software Technology, 2006
Detecting and Locating Interaction Faults.
Electronic Notes in Discrete Mathematics, 2006
Rouxtype constructions for covering arrays of strengths three and four.
Des. Codes Cryptography, 2006
On constant composition codes.
Discrete Applied Mathematics, 2006
Slot synchronized topologytransparent scheduling for sensor networks.
Computer Communications, 2006
TopologyTransparent Schedules for Energy Limited Ad hoc Networks.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006
Optimal memoryless encoding for low power offchip data buses.
Proceedings of the 2006 International Conference on ComputerAided Design, 2006
2005
Optimal frequencyhopping sequences via cyclotomy.
IEEE Trans. Information Theory, 2005
A Recursive Construction For Regular Difference Triangle Sets.
SIAM J. Discrete Math., 2005
Traffic Grooming in Unidirectional WavelengthDivision Multiplexed Rings with Grooming Ratio C = 6.
SIAM J. Discrete Math., 2005
Embedding path designs into kite systems.
Discrete Mathematics, 2005
Ovals and hyperovals in nets.
Discrete Mathematics, 2005
Software performance testing using covering arrays: efficient screening designs with categorical factors.
Proceedings of the Fifth International Workshop on Software and Performance, 2005
Progressive Ranking and Composition of Web Services Using Covering Arrays.
Proceedings of the 10th IEEE International Workshop on ObjectOriented RealTime Dependable Systems (WORDS 2005), 2005
Constructing interaction test suites with greedy algorithms.
Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), 2005
A framework of greedy methods for constructing interaction test suites.
Proceedings of the 27th International Conference on Software Engineering (ICSE 2005), 2005
Test prioritization for pairwise interaction coverage.
Proceedings of the ICSE 2005 Workshop on Advances in ModelBased Software Testing, 2005
2004
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.
IEEE Trans. Information Theory, 2004
Sequence designs for ultrawideband impulse radio with optimal correlation properties.
IEEE Trans. Information Theory, 2004
Optimal (n, 4, 2)OOC of small orders.
Discrete Mathematics, 2004
Grooming in unidirectional rings: K_{4}e designs.
Discrete Mathematics, 2004
Preface.
Discrete Mathematics, 2004
CoverFree Families and TopologyTransparent Scheduling for MANETs.
Des. Codes Cryptography, 2004
Constructions for Permutation Codes in Powerline Communications.
Des. Codes Cryptography, 2004
Ladder orderings of pairs and RAID performance.
Discrete Applied Mathematics, 2004
Dynamic spectrum utilization in ad hoc networks.
Computer Networks, 2004
Experimental designs in software engineering: doptimal designs and covering arrays.
Proceedings of the ACM Workshop on Interdisciplinary Software Engineering Research, 2004
Securing dynamic spectrum use.
Proceedings of the 60th IEEE Vehicular Technology Conference, 2004
Scheduled persistence for medium access control in sensor networks.
Proceedings of the 2004 IEEE International Conference on Mobile Adhoc and Sensor Systems, 2004
Topology Transparent Scheduling, Synchronization, and Maximum Delay.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
A deterministic density algorithm for pairwise interaction coverage.
Proceedings of the IASTED International Conference on Software Engineering, 2004
2003
Specialized BlockColourings of Steiner Triple Systems and the Upper Chromatic Index.
Graphs and Combinatorics, 2003
Graph decompositions with application to wavelength adddrop multiplexing for minimizing SONET ADMs.
Discrete Mathematics, 2003
Preface.
Discrete Mathematics, 2003
Resolving P(v, 3, λ) designs into regular P_{3}configurations.
Australasian J. Combinatorics, 2003
On Quaternary MacDonald Codes.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003
Augmenting Simulated Annealing to Build Interaction Test Suites.
Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003
Constructing Test Suites for Interaction Testing.
Proceedings of the 25th International Conference on Software Engineering, 2003
Topologytransparent scheduling for MANETs using orthogonal arrays.
Proceedings of the DIALMPOMC Joint Workshop on Foundations of Mobile Computing, 2003
Variable Strength Interaction Testing of Components.
Proceedings of the 27th International Computer Software and Applications Conference (COMPSAC 2003): Design and Assessment of Trustworthy SoftwareBased Systems, 2003
Steiner Systems for TopologyTransparent Access Control in MANETs.
Proceedings of the AdHoc, Mobile, and Wireless Networks, Second International Conference, 2003
2002
Kirkman triple systems of order 21 with nontrivial automorphism group.
Math. Comput., 2002
Preface: In Honour of Ronald C. Mullin.
Des. Codes Cryptography, 2002
The Existence of Kirkman SquaresDoubly Resolvable (v, 3, 1)BIBDs.
Des. Codes Cryptography, 2002
Projective planes and congestionfree networks.
Discrete Applied Mathematics, 2002
Construction of optimal quality control for oligo arrays.
Bioinformatics, 2002
NS1D0 Sequences and AntiPasch Steiner Triple Systems.
Ars Comb., 2002
2001
Equireplicate Balanced Binary Codes for Oligo Arrays.
SIAM J. Discrete Math., 2001
Minimizing drop cost for SONET/WDM networks with wavelength requirements.
Networks, 2001
Quorum Systems Constructed from Combinatorial Designs.
Inf. Comput., 2001
Triangulations and a generalization of Bose's method.
Discrete Mathematics, 2001
Preface.
Discrete Mathematics, 2001
(M, S)optimal designs with block size three.
Australasian J. Combinatorics, 2001
Ordering disks for double erasure codes.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Cluttered Orderings for the Complete Graph.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Fourterminal reducibility and projectiveplanar wyedeltawyereducible graphs.
Journal of Graph Theory, 2000
Transversal Designs in Classical Planes and Spaces.
J. Comb. Theory, Ser. A, 2000
Quorums from difference covers.
Inf. Process. Lett., 2000
Modified group divisible designs with block size four.
Discrete Mathematics, 2000
Maximum Kirkman Signal Sets for Synchronous UniPolar MultiUser Communication Systems.
Des. Codes Cryptography, 2000
Coding, Cryptography, and Computer Security  Preface.
Discrete Applied Mathematics, 2000
Asymptotically optimal erasureresilient codes for large disk arrays.
Discrete Applied Mathematics, 2000
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
Multiple Access Communications Using Combinatorial Designs.
Proceedings of the Theoretical Aspects of Computer Science, 2000
1999
Combinatorial Designs.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Kirkman school project designs.
Discrete Mathematics, 1999
Covering Arrays of Strength Three.
Des. Codes Cryptography, 1999
Bicoloring Steiner Triple Systems.
Electr. J. Comb., 1999
Balanced sampling plans with block size four excluding contiguous units.
Australasian J. Combinatorics, 1999
1998
A Linear Time Algorithm for Computing the Most Reliable Source on a SeriesParallel Graph with Unreliable Edges.
Theor. Comput. Sci., 1998
Completing the spectrum of rotational Mendelsohn triple systems.
Discrete Mathematics, 1998
Tight 4factor orthogonal main effect plans.
Discrete Mathematics, 1998
Point Code Minimum Steiner Triple Systems.
Des. Codes Cryptography, 1998
Deleting Lines in Projective Planes.
Ars Comb., 1998
On Directed Incomplete Transversal Designs with Block Size Five.
Ars Comb., 1998
1997
Constructions for difference triangle sets.
IEEE Trans. Information Theory, 1997
Wang Tilings and Distributed Verification on Anonymous Torus Networks.
Theory Comput. Syst., 1997
Pairwise Balanced Designs with Block Sizes 8, 9, and 10.
J. Comb. Theory, Ser. A, 1997
Balanced Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1997
Complete Arcs in Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1997
Pairwise Balanced Designs with Consecutive Block Sizes.
Des. Codes Cryptography, 1997
Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda.
Des. Codes Cryptography, 1997
1996
CohenMacaulay Rings in Network Reliability.
SIAM J. Discrete Math., 1996
Equitable Embeddings of Steiner Triple Systems.
J. Comb. Theory, Ser. A, 1996
Two Algorithms for Unranking Arborescences.
J. Algorithms, 1996
Transversal Designs of Block Size Eight and Nine.
Eur. J. Comb., 1996
Existence of three HMOLS of types h^{n} and 2^{n}3^{1}.
Discrete Mathematics, 1996
Concerning Difference Matrices.
Des. Codes Cryptography, 1996
N(n), v(n): Similarities and Differences.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
1995
Consecutive cuts and paths, and bounds on kterminal reliability.
Networks, 1995
Preface.
Networks, 1995
Partial Steiner Triple Systems with EqualSized Holes.
J. Comb. Theory, Ser. A, 1995
Thwarts in Transversal Designs.
Des. Codes Cryptography, 1995
A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs.
Discrete Applied Mathematics, 1995
The Complexity of Computing the Tutte Polynomial on Transversal Matroids.
Combinatorica, 1995
Existence of six incomplete MOLS.
Australasian J. Combinatorics, 1995
Orthogonal resolutions of triple systems.
Australasian J. Combinatorics, 1995
1994
Antimitre steiner triple systems.
Graphs and Combinatorics, 1994
Concerning difference families with block size four.
Discrete Mathematics, 1994
Network reliability and the probabilistic estimation of damage from fire spread.
Annals OR, 1994
Conflictfree access to constantperimeter, rectangular, subarrays.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994
1993
Evaluating performability: Most probable states and bounds.
Telecommunication Systems, 1993
Transformations on channel graphs.
IEEE Trans. Communications, 1993
Assessing Reliability of Multistage Interconnection Networks.
IEEE Trans. Computers, 1993
Renormalization of two  terminal reliability.
Networks, 1993
Network transformations and bounding network reliability.
Networks, 1993
Book reviews.
ZOR  Meth. & Mod. of OR, 1993
Support sizes of sixfold triple systems.
Discrete Mathematics, 1993
Reliable assignments of processors to tasks and factoring on matroids.
Discrete Mathematics, 1993
The Spectrum of Maximal Partial Steiner Triple Systems.
Des. Codes Cryptography, 1993
Computing Residual Connectedness Reliability for Restricted Networks.
Discrete Applied Mathematics, 1993
Threshold Channel Graphs.
Combinatorics, Probability & Computing, 1993
Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993
ConflictFree Access for the Collections of Templates.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993
1992
Roots of the Reliability Polynomial.
SIAM J. Discrete Math., 1992
Seriesparallel subgraphs of planar graphs.
Networks, 1992
ConflictFree Access to Parallel Memories.
J. Parallel Distrib. Comput., 1992
Directed star decompositions of the complete directed graph.
Journal of Graph Theory, 1992
Support Sizes of Triple Systems.
J. Comb. Theory, Ser. A, 1992
A New Class of Group Divisible Designs with Block Size Three.
J. Comb. Theory, Ser. A, 1992
A Parallelization of Miller's n^log n Isomorphism Technique.
Inf. Process. Lett., 1992
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.
Des. Codes Cryptography, 1992
A Note on Bounding kTerminal Reliability.
Algorithmica, 1992
Networks and Reliability in Maple.
Proceedings of the Computational Support for Discrete Mathematics, 1992
1991
Spanning sets and scattering sets in Steiner triple systems.
J. Comb. Theory, Ser. A, 1991
Partitioning Steiner triple systems into complete arcs.
Discrete Mathematics, 1991
The fine structure of threefold triple systems: u = 1 or 3 (mod 6).
Discrete Mathematics, 1991
Preface.
Discrete Mathematics, 1991
Directed star decompositions of directed multigraphs.
Discrete Mathematics, 1991
Intersections and supports of quadruple systems.
Discrete Mathematics, 1991
The number of twise balance designs.
Combinatorica, 1991
Network reliability: Numbers or insight?  A discussion paper.
Annals OR, 1991
Combinatorial aspects of network reliability.
Annals OR, 1991
Leaves, excesses and neighbourhoods in triple systems.
Australasian J. Combinatorics, 1991
The fine structure of threefold triple systems: v≡5(mod 6).
Australasian J. Combinatorics, 1991
1990
Combining monte carlo estimates and bounds for network reliability.
Networks, 1990
Efficient algorithms for computing the reliability of permutation and interval graphs.
Networks, 1990
Repeated edges in 2factorizations.
Journal of Graph Theory, 1990
On two dual classes of planar graphs.
Discrete Mathematics, 1990
Permutation graphs: Connected domination and Steiner trees.
Discrete Mathematics, 1990
The spectrum of support sizes for threefold triple systems.
Discrete Mathematics, 1990
Unit disk graphs.
Discrete Mathematics, 1990
Probabilistic single processor scheduling.
Discrete Applied Mathematics, 1990
Large sets of disjoint tdesigns.
Australasian J. Combinatorics, 1990
1989
Multiplicative improvements in network reliability bounds.
Networks, 1989
Matroid Steiner problems, the Tutte polynomial and network reliability.
J. Comb. Theory, Ser. B, 1989
Simple neighbourhoods in triple systems.
J. Comb. Theory, Ser. A, 1989
Unranking and Ranking Spanning Trees of a Graph.
J. Algorithms, 1989
SeriesParallel Bounds for the TwoTerminal Reliability Problem.
INFORMS Journal on Computing, 1989
Hybrid triple systems and cubic feedback sets.
Graphs and Combinatorics, 1989
Percentages in pairwise balanced designs.
Discrete Mathematics, 1989
Applications of Combinatorial Designs in Computer Science.
ACM Comput. Surv., 1989
Bounding Network Parameters by Approximating Graphs.
Proceedings of the Reliability Of Computer And Communication Networks, 1989
1988
A Set System Polynomial with Colouring and Reliability Applications.
SIAM J. Discrete Math., 1988
Bounding allterminal reliability in computer networks.
Networks, 1988
Edgepacking of graphs and network reliability.
Discrete Mathematics, 1988
Problem 94.
Discrete Mathematics, 1988
The strong chromatic number of partial triple systems.
Discrete Applied Mathematics, 1988
Lower bounds on twoterminal network reliability.
Discrete Applied Mathematics, 1988
1987
Counting almost minimum cutsets with reliability applications.
Math. Program., 1987
1986
Improving reliability bounds in computer networks.
Networks, 1986
Quadratic leaves of maximal partial triple systems.
Graphs and Combinatorics, 1986
Some NPcomplete problems for hypergraph degree sequences.
Discrete Applied Mathematics, 1986
1985
Some Empirical Observations on Program Behavior with Applications to Program Restructuring.
IEEE Trans. Software Eng., 1985
Optimum Communication Spanning Trees in SeriesParallel Networks.
SIAM J. Comput., 1985
The most reliable seriesparallel networks.
Networks, 1985
Cataloguing the graphs on 10 vertices.
Journal of Graph Theory, 1985
1984
Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda.
J. Comb. Theory, Ser. A, 1984
A census of regular 3polystroma arising from honeycombs.
Discrete Mathematics, 1984
The complexity of completing partial Latin squares.
Discrete Applied Mathematics, 1984
Concurrent Transmissions in Broadcast Networks.
Proceedings of the Automata, 1984
1983
Steiner trees, partial 2trees, and minimum IFI networks.
Networks, 1983
Every Twofold Triple System Can Be Directed.
J. Comb. Theory, Ser. A, 1983
Embedding Partial Steiner Triple Systems Is NPComplete.
J. Comb. Theory, Ser. A, 1983
Completing small partial triple systems.
Discrete Mathematics, 1983
1982
Colouring steiner quadruple systems.
Discrete Applied Mathematics, 1982
Computing the Chromatic Index of Steiner Triple Systems.
Comput. J., 1982
1981
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs.
SIAM J. Comput., 1981
On testing isomorphism of permutation graphs.
Networks, 1981
Cyclic Block Designs With Block Size 3.
Eur. J. Comb., 1981
Concerning the complexity of deciding isomorphism of block designs.
Discrete Applied Mathematics, 1981
1980
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.
Inf. Process. Lett., 1980
On deciding switching equivalence of graphs.
Discrete Applied Mathematics, 1980
1979
Orderly algorithms for generating restricted classes of graphs.
Journal of Graph Theory, 1979
The Complexity of Symmetrizing Matrices.
Inf. Process. Lett., 1979