| Publication | Date of Publication | Type |
|---|
Detecting arrays for effects of multiple interacting factors
Information and Computation | 2024-12-03 | Paper |
| Mixed-level covering, locating, and detecting arrays via cyclotomy | 2024-10-09 | Paper |
| Resolutions for an infinite family of Bose triple systems | 2024-10-09 | Paper |
Sets of mutually orthogoval projective and affine planes
Combinatorial Theory | 2024-10-08 | Paper |
| Asymptotic existence of egalitarian Steiner 2-designs | 2024-10-02 | Paper |
| An efficient screening method for identifying parameters and interactions that impact wireless network performance | 2024-10-02 | Paper |
On the maximum double independence number of Steiner triple systems
Journal of Combinatorial Designs | 2024-01-31 | Paper |
Bussey systems and Steiner's tactical problem
Glasnik Matematicki | 2024-01-31 | Paper |
| Covering perfect hash families and covering arrays of higher index | 2024-01-25 | Paper |
Network reliability: Heading out on the highway
Networks | 2023-12-11 | Paper |
Detecting arrays for effects of single factors
European Congress of Mathematics | 2023-11-10 | Paper |
The spectrum of resolvable Bose triple systems
Discrete Mathematics | 2023-05-15 | Paper |
Network reliability
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
| Sets of mutually orthogoval projective and affine planes | 2022-10-21 | Paper |
Algorithms for Constructing Anonymizing Arrays
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Egalitarian Steiner quadruple systems of doubly even order
Discrete Mathematics | 2022-05-17 | Paper |
Mixed covering arrays on graphs of small treewidth
Discrete Mathematics, Algorithms and Applications | 2022-03-17 | Paper |
| Balanced and Swap-Robust Trades for Dynamical Distributed Storage | 2022-01-22 | Paper |
| Perfect hash families: the generalization to higher indices | 2021-10-04 | Paper |
Egalitarian Steiner triple systems for data popularity
Designs, Codes and Cryptography | 2021-10-04 | Paper |
Egalitarian edge orderings of complete graphs
Graphs and Combinatorics | 2021-07-28 | Paper |
Covering strong separating hash families
Finite Fields and their Applications | 2021-06-15 | Paper |
New bounds on the maximum size of Sperner partition systems
European Journal of Combinatorics | 2021-02-08 | Paper |
| There must be fifty ways to miss a cover | 2020-11-10 | Paper |
Access balancing in storage systems by labeling partial Steiner systems
Designs, Codes and Cryptography | 2020-10-21 | Paper |
Set-codes with small intersections and small discrepancies
SIAM Journal on Discrete Mathematics | 2020-06-09 | Paper |
| Detecting arrays for main effects | 2020-04-29 | Paper |
Two-stage algorithms for covering array construction
Journal of Combinatorial Designs | 2019-12-12 | Paper |
Distributing hash families with few rows
Theoretical Computer Science | 2019-11-13 | Paper |
| Locating one pairwise interaction: three recursive constructions | 2019-10-30 | Paper |
| The 3-GDDs of type \(g^3u^2\) | 2019-10-30 | Paper |
Subspace restrictions and affine composition for covering perfect hash families
The Art of Discrete and Applied Mathematics | 2019-10-02 | Paper |
Optimality and constructions of locating arrays
Journal of Statistical Theory and Practice | 2019-08-27 | Paper |
Improving two recursive constructions for covering arrays
Journal of Statistical Theory and Practice | 2019-08-27 | Paper |
Resolvable covering arrays
Journal of Statistical Theory and Practice | 2019-08-27 | Paper |
Constructions of optimal orthogonal arrays with repeated rows
Discrete Mathematics | 2019-07-18 | Paper |
| On a latin square problem of Fuchs | 2019-01-30 | Paper |
Counting subwords and regular languages
(available as arXiv preprint) | 2018-11-22 | Paper |
On a combinatorial framework for fault characterization
Mathematics in Computer Science | 2018-11-01 | Paper |
Assessing reliability of multistage interconnection networks
IEEE Transactions on Computers | 2018-09-14 | Paper |
| Separating interaction effects using locating and detecting arrays | 2018-09-06 | Paper |
Partial covering arrays: algorithms and asymptotics
Theory of Computing Systems | 2018-08-03 | Paper |
Group divisible covering designs with block size four
Journal of Combinatorial Designs | 2018-05-22 | Paper |
| Fractal perfect hash families (extended abstract) | 2018-04-12 | Paper |
Asymptotic and constructive methods for covering perfect hash families and covering arrays
Designs, Codes and Cryptography | 2018-04-10 | Paper |
Improved strength four covering arrays with three symbols
Graphs and Combinatorics | 2018-03-22 | Paper |
A hierarchical framework for recovery in compressive sensing
Discrete Applied Mathematics | 2018-01-11 | Paper |
Steiner triple systems with high chromatic index
SIAM Journal on Discrete Mathematics | 2017-11-24 | Paper |
Compressed Sensing With Combinatorial Designs: Theory and Simulations
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
A Combinatorial Approach to X-Tolerant Compaction Circuits
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Upper bounds on the size of covering arrays
SIAM Journal on Discrete Mathematics | 2017-06-23 | Paper |
Disjoint spread systems and fault location
SIAM Journal on Discrete Mathematics | 2016-10-28 | Paper |
Partial covering arrays: algorithms and asymptotics
Lecture Notes in Computer Science | 2016-09-29 | Paper |
| Steiner loops satisfying the statement of Moufang's theorem. | 2016-07-06 | Paper |
Steiner loops satisfying the statement of Moufang's theorem.
(available as arXiv preprint) | 2016-07-06 | Paper |
Quorums from difference covers
Information Processing Letters | 2016-06-16 | Paper |
The existence of well-balanced triple systems
Journal of Combinatorial Designs | 2016-05-24 | Paper |
Suitable permutations, binary covering arrays, and Paley matrices
Springer Proceedings in Mathematics & Statistics | 2016-01-25 | Paper |
Augmentation of covering arrays of strength two
Graphs and Combinatorics | 2015-12-17 | Paper |
| Steiner loops satisfying Moufang's theorem | 2015-11-16 | Paper |
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
Designs, Codes and Cryptography | 2015-10-26 | Paper |
| Covering arrays and hash families | 2015-10-21 | Paper |
Sequence Covering Arrays and Linear Extensions
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Covering and packing for pairs
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Conditional expectation algorithms for covering arrays
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2014-11-04 | Paper |
Covering arrays, augmentation, and quilting arrays
Discrete Mathematics, Algorithms and Applications | 2014-09-29 | Paper |
Sequence covering arrays
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
| Hierarchical Recovery in Compressive Sensing | 2014-03-04 | Paper |
f-vectors of pure complexes and pure multicomplexes of rank three
Discrete Mathematics | 2014-01-27 | Paper |
Expected time to detection of interaction faults
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2013-12-13 | Paper |
The existence of \((K_2\times K_6)\)-designs
Graphs and Combinatorics | 2013-09-26 | Paper |
Doubly resolvable nearly Kirkman triple systems
Journal of Combinatorial Designs | 2013-08-13 | Paper |
| Distributing hash families and covering arrays | 2013-08-01 | Paper |
Randomized Post-optimization for t-Restrictions
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Strengthening hash families and compressive sensing
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Trails of triples in partial triple systems
Designs, Codes and Cryptography | 2012-11-28 | Paper |
Randomized post-optimization of covering arrays
European Journal of Combinatorics | 2012-11-15 | Paper |
Variable weight sequences for adaptive scheduled access in MANETs
Lecture Notes in Computer Science | 2012-09-07 | Paper |
Constructing heterogeneous hash families by puncturing linear transversal designs
Journal of Geometry | 2012-04-12 | Paper |
Cover starters for covering arrays of strength two
Discrete Mathematics | 2012-03-16 | Paper |
Efficient conditional expectation algorithms for constructing hash families
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Grooming traffic to minimize load
Discrete Mathematics | 2012-01-11 | Paper |
Mixed covering arrays of strength three with few factors
Journal of Statistical Planning and Inference | 2011-08-01 | Paper |
| Heterogeneous hash families and covering arrays | 2011-05-31 | Paper |
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
Discrete Mathematics | 2011-05-10 | Paper |
D-optimal designs with interaction coverage
Journal of Statistical Theory and Practice | 2011-04-18 | Paper |
Drop cost and wavelength optimal two-period grooming with ratio 4
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
| Boolean aspects of network reliability | 2011-03-09 | Paper |
Optical grooming with grooming ratio nine
Discrete Mathematics | 2011-01-07 | Paper |
Covering and radius-covering arrays: constructions and classification
Discrete Applied Mathematics | 2010-10-11 | Paper |
Properties of the Steiner triple systems of order 19
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Properties of the Steiner triple systems of order 19
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Covering arrays from cyclotomy
Designs, Codes and Cryptography | 2010-05-19 | Paper |
A recursive construction for perfect hash families
Journal of Mathematical Cryptology | 2010-05-06 | Paper |
Optical grooming with grooming ratio eight
Discrete Applied Mathematics | 2010-04-28 | Paper |
Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Graph designs for the eight-edge five-vertex graphs
Discrete Mathematics | 2009-12-15 | Paper |
Randomized postoptimization of covering arrays
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Chip firing and all-terminal network reliability bounds
Discrete Optimization | 2009-11-23 | Paper |
Small stopping sets in Steiner triple systems
Cryptography and Communications | 2009-10-26 | Paper |
MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
Discrete Mathematics, Algorithms and Applications | 2009-09-22 | Paper |
Truncated D-Optimal Designs for Screening Experiments
American Journal of Mathematical and Management Sciences | 2009-08-03 | Paper |
Binary Covering Arrays and Existentially Closed Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Merging covering arrays and compressing multiple sequence alignments
Discrete Applied Mathematics | 2009-06-24 | Paper |
Linear hash families and forbidden configurations
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Constructing Perfect Hash Families Using a Greedy Algorithm
Coding and Cryptology | 2009-03-09 | Paper |
Scalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects
Coding and Cryptology | 2009-03-09 | Paper |
The configuration polytope of ℓ-line configurations in Steiner triple systems
Mathematica Slovaca | 2009-02-09 | Paper |
Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II
Discrete Mathematics | 2009-01-28 | Paper |
Minimum embedding of Steiner triple systems into \((K4-e)\)-designs. I
Discrete Mathematics | 2009-01-27 | Paper |
Fully gated graphs: Recognition and convex operations
Discrete Mathematics | 2009-01-27 | Paper |
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Optimal Frequency-Hopping Sequences Via Cyclotomy
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Sequence Designs for Ultra-Wideband Impulse Radio With Optimal Correlation Properties
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Ternary Schedules for Energy-Limited Sensor Networks
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Grooming for two-period optical networks
Networks | 2008-12-17 | Paper |
Lower bounds for two-period grooming via linear programming duality
Networks | 2008-12-17 | Paper |
Tabu search for covering arrays using permutation vectors
Journal of Statistical Planning and Inference | 2008-11-06 | Paper |
Constructing strength three covering arrays with augmented annealing
Discrete Mathematics | 2008-05-29 | Paper |
Failed disk recovery in double erasure RAID arrays
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Locating and detecting arrays for interaction faults
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Transport schemes for topology-transparent scheduling
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
Strength two covering arrays: existence tables and projection
Discrete Mathematics | 2008-02-14 | Paper |
Directed complete bipartite graph decompositions: indirect constructions
Discrete Mathematics | 2008-01-30 | Paper |
Multiterminal resilience for series‐parallel networks
Networks | 2007-09-21 | Paper |
| scientific article; zbMATH DE number 5177325 (Why is no real title available?) | 2007-08-07 | Paper |
Perfect Hash Families: Constructions and Existence
Journal of Mathematical Cryptology | 2007-07-27 | Paper |
Detecting and Locating Interaction Faults
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 5130668 (Why is no real title available?) | 2007-03-05 | Paper |
| scientific article; zbMATH DE number 5130682 (Why is no real title available?) | 2007-03-05 | Paper |
| Opening the door | 2007-03-05 | Paper |
| scientific article; zbMATH DE number 5130670 (Why is no real title available?) | 2007-03-05 | Paper |
| scientific article; zbMATH DE number 5130675 (Why is no real title available?) | 2007-03-05 | Paper |
Renewal Networks: Connectivity and Reachability on a Time Interval
Probability in the Engineering and Informational Sciences | 2007-01-19 | Paper |
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography | 2006-11-22 | Paper |
| Cover-free families and topology-transparent communication | 2006-09-14 | Paper |
| Recursive constructions of covering arrays | 2006-09-14 | Paper |
On constant composition codes
Discrete Applied Mathematics | 2006-06-09 | Paper |
Covering arrays of higher strength from permutation vectors
Journal of Combinatorial Designs | 2006-06-06 | Paper |
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio<i>C</i>= 6
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Products of mixed covering arrays of strength two
Journal of Combinatorial Designs | 2006-05-16 | Paper |
| scientific article; zbMATH DE number 2235051 (Why is no real title available?) | 2005-12-02 | Paper |
Embedding path designs into kite systems
Discrete Mathematics | 2005-09-22 | Paper |
A Recursive Construction For Regular Difference Triangle Sets
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
| scientific article; zbMATH DE number 2188379 (Why is no real title available?) | 2005-07-26 | Paper |
Ovals and hyperovals in nets
Discrete Mathematics | 2005-06-23 | Paper |
| scientific article; zbMATH DE number 2170489 (Why is no real title available?) | 2005-05-23 | Paper |
Recursive constructions for optimal (n,4,2)-OOCs
Journal of Combinatorial Designs | 2005-01-12 | Paper |
Grooming in unidirectional rings: \(K_{4}-e\) designs
Discrete Mathematics | 2004-08-20 | Paper |
Constructions for permutation codes in powerline communications
Designs, Codes and Cryptography | 2004-08-16 | Paper |
Cover-free families and topology-transparent scheduling for MANETs
Designs, Codes and Cryptography | 2004-08-16 | Paper |
| scientific article; zbMATH DE number 2086424 (Why is no real title available?) | 2004-08-11 | Paper |
Ladder orderings of pairs and RAID performance.
Discrete Applied Mathematics | 2004-03-29 | Paper |
Optimal \((n,4,2)\)-OOC of small orders.
Discrete Mathematics | 2004-03-29 | Paper |
Preface (to the special issue in honor of Zhu Lie's 60th birthday)
Discrete Mathematics | 2004-03-29 | Paper |
Concerning seven and eight mutually orthogonal Latin squares
Journal of Combinatorial Designs | 2004-03-15 | Paper |
| scientific article; zbMATH DE number 1885933 (Why is no real title available?) | 2004-02-03 | Paper |
Minimum embedding of P3-designs into (K4?e)-designs
Journal of Combinatorial Designs | 2003-11-10 | Paper |
Specialized block-colourings of Steiner triple systems and the upper chromatic index
Graphs and Combinatorics | 2003-10-16 | Paper |
Optimal and pessimal orderings of Steiner triple systems in disk arrays.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1933062 (Why is no real title available?) | 2003-06-23 | Paper |
Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
Discrete Mathematics | 2003-03-16 | Paper |
Quorum systems constructed from combinatorial designs
Information and Computation | 2003-01-14 | Paper |
Transversal designs in classical planes and spaces
Journal of Combinatorial Theory. Series A | 2002-10-13 | Paper |
Dominated error correcting codes with distance two
Journal of Combinatorial Designs | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1796986 (Why is no real title available?) | 2002-09-05 | Paper |
Projective planes and congestion-free networks
Discrete Applied Mathematics | 2002-08-29 | Paper |
Orthogonal arrays of strength three from regular 3-wise balanced designs
Journal of Statistical Planning and Inference | 2002-05-20 | Paper |
Triangulations and a generalization of Bose's method
Discrete Mathematics | 2002-05-02 | Paper |
Kirkman triple systems of order 21 with nontrivial automorphism group
Mathematics of Computation | 2002-03-19 | Paper |
Generating sets in Steiner triple systems
Mathematica Slovaca | 2002-03-07 | Paper |
Minimum weights of point codes of Steiner triple systems
Journal of Statistical Planning and Inference | 2002-01-21 | Paper |
Mutually orthogonal Latin squares: A brief survey of constructions
Journal of Statistical Planning and Inference | 2002-01-02 | Paper |
| scientific article; zbMATH DE number 1342086 (Why is no real title available?) | 2001-11-22 | Paper |
Equireplicate balanced binary codes for oligo arrays
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1512679 (Why is no real title available?) | 2001-11-08 | Paper |
(M,S)-optimal designs with block size three
The Australasian Journal of Combinatorics | 2001-09-02 | Paper |
Maximum Kirkman signal sets for synchronous uni-polar multi-user communication systems
Designs, Codes and Cryptography | 2001-08-20 | Paper |
Sharper bounds in adpative group testing
Taiwanese Journal of Mathematics | 2001-07-19 | Paper |
Minimizing drop cost for SONET/WDM networks with \(\frac 18\) wavelength requirements
Networks | 2001-06-20 | Paper |
On directed incomplete transversal designs with block size five
Ars Combinatoria | 2001-06-10 | Paper |
Deleting lines in projective planes
Ars Combinatoria | 2001-06-10 | Paper |
An application of permutatation arrays to block ciphers
Congressus Numerantium | 2001-05-16 | Paper |
Quintessential pairwise balanced designs
Journal of Statistical Planning and Inference | 2001-01-03 | Paper |
Construction Techniques for Anti-Pasch Steiner Triple Systems
Journal of the London Mathematical Society | 2000-12-13 | Paper |
Tight \(4\)-factor orthogonal main effect plans
Discrete Mathematics | 2000-11-02 | Paper |
| scientific article; zbMATH DE number 1511207 (Why is no real title available?) | 2000-09-26 | Paper |
Modified group divisible designs with block size four
Discrete Mathematics | 2000-08-28 | Paper |
| scientific article; zbMATH DE number 1488316 (Why is no real title available?) | 2000-08-10 | Paper |
| Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs | 2000-07-24 | Paper |
| scientific article; zbMATH DE number 1394639 (Why is no real title available?) | 2000-07-19 | Paper |
| scientific article; zbMATH DE number 1341369 (Why is no real title available?) | 2000-06-09 | Paper |
A golf design of order 11
Journal of Statistical Planning and Inference | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1355275 (Why is no real title available?) | 2000-05-18 | Paper |
| scientific article; zbMATH DE number 1424550 (Why is no real title available?) | 2000-03-23 | Paper |
Weakly union-free maximum packings
Annals of Combinatorics | 2000-03-13 | Paper |
Group testing for consecutive positives
Annals of Combinatorics | 2000-02-16 | Paper |
Kirkman school project designs
Discrete Mathematics | 2000-01-11 | Paper |
Asymptotically optimal erasure-resilient codes for large disk arrays.
Discrete Applied Mathematics | 2000-01-01 | Paper |
Covering arrays of strength three
Designs, Codes and Cryptography | 1999-11-22 | Paper |
Pooling, lattice square, and union jack designs
Annals of Combinatorics | 1999-11-11 | Paper |
| scientific article; zbMATH DE number 1314686 (Why is no real title available?) | 1999-07-11 | Paper |
| scientific article; zbMATH DE number 1248181 (Why is no real title available?) | 1999-06-30 | Paper |
Bicoloring Steiner triple systems
The Electronic Journal of Combinatorics | 1999-06-20 | Paper |
| scientific article; zbMATH DE number 1295362 (Why is no real title available?) | 1999-06-03 | Paper |
| The existence of uniform 5-GDDs | 1999-05-16 | Paper |
Weakly union-free twofold triple systems
Annals of Combinatorics | 1999-01-14 | Paper |
Point code minimum Steiner triple systems
Designs, Codes and Cryptography | 1999-01-14 | Paper |
A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
Theoretical Computer Science | 1999-01-12 | Paper |
| The spectrum for rotational Steiner triple systems | 1998-12-02 | Paper |
A class of partial triple systems with applications in survey sampling
Communications in Statistics: Theory and Methods | 1998-11-25 | Paper |
| scientific article; zbMATH DE number 1222085 (Why is no real title available?) | 1998-11-11 | Paper |
Completing the spectrum of rotational Mendelsohn triple systems
Discrete Mathematics | 1998-10-28 | Paper |
Asymptotic Existence of Tight Orthogonal Main Effect Plans
Canadian Mathematical Bulletin | 1998-10-25 | Paper |
| scientific article; zbMATH DE number 1161257 (Why is no real title available?) | 1998-06-08 | Paper |
More thwarts in transversal designs
Finite Fields and their Applications | 1998-04-26 | Paper |
Complete arcs in Steiner triple systems
Journal of Combinatorial Theory. Series A | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1066164 (Why is no real title available?) | 1998-03-02 | Paper |
Wang tilings and distributed verification on anonymous torus networks
Theory of Computing Systems | 1997-09-07 | Paper |
Existence of incomplete transversal designs with block size five and any index
Designs, Codes and Cryptography | 1997-08-27 | Paper |
Pairwise balanced designs with block sizes 8, 9, and 10
Journal of Combinatorial Theory. Series A | 1997-08-27 | Paper |
Some direct constructions for incomplete transversal designs
Journal of Statistical Planning and Inference | 1997-07-28 | Paper |
| scientific article; zbMATH DE number 874492 (Why is no real title available?) | 1997-06-29 | Paper |
| scientific article; zbMATH DE number 874564 (Why is no real title available?) | 1997-06-22 | Paper |
| scientific article; zbMATH DE number 874548 (Why is no real title available?) | 1997-06-09 | Paper |
Balanced Steiner triple systems
Journal of Combinatorial Theory. Series A | 1997-06-04 | Paper |
| scientific article; zbMATH DE number 825140 (Why is no real title available?) | 1997-05-28 | Paper |
Pairwise balanced designs with consecutive block sizes
Designs, Codes and Cryptography | 1997-05-20 | Paper |
| scientific article; zbMATH DE number 1011073 (Why is no real title available?) | 1997-05-19 | Paper |
Concerning difference matrices
Designs, Codes and Cryptography | 1997-03-23 | Paper |
Cohen–Macaulay Rings in Network Reliability
SIAM Journal on Discrete Mathematics | 1997-03-11 | Paper |
| scientific article; zbMATH DE number 898422 (Why is no real title available?) | 1997-02-17 | Paper |
Constructions for difference triangle sets
IEEE Transactions on Information Theory | 1997-01-01 | Paper |
Constructions for difference triangle sets
IEEE Transactions on Information Theory | 1997-01-01 | Paper |
| scientific article; zbMATH DE number 874513 (Why is no real title available?) | 1996-11-25 | Paper |
| scientific article; zbMATH DE number 874486 (Why is no real title available?) | 1996-11-21 | Paper |
| scientific article; zbMATH DE number 874491 (Why is no real title available?) | 1996-11-05 | Paper |
| scientific article; zbMATH DE number 874562 (Why is no real title available?) | 1996-11-03 | Paper |
| scientific article; zbMATH DE number 874555 (Why is no real title available?) | 1996-11-03 | Paper |
| scientific article; zbMATH DE number 874510 (Why is no real title available?) | 1996-08-29 | Paper |
| scientific article; zbMATH DE number 919112 (Why is no real title available?) | 1996-08-25 | Paper |
| scientific article; zbMATH DE number 874558 (Why is no real title available?) | 1996-07-17 | Paper |
Transversal designs of block size eight and nine
European Journal of Combinatorics | 1996-07-04 | Paper |
Two Algorithms for Unranking Arborescences
Journal of Algorithms | 1996-06-04 | Paper |
Equitable embeddings of Steiner triple systems
Journal of Combinatorial Theory. Series A | 1996-05-13 | Paper |
| scientific article; zbMATH DE number 874493 (Why is no real title available?) | 1996-05-06 | Paper |
| scientific article; zbMATH DE number 874490 (Why is no real title available?) | 1996-05-06 | Paper |
| scientific article; zbMATH DE number 874489 (Why is no real title available?) | 1996-05-06 | Paper |
| scientific article; zbMATH DE number 827993 (Why is no real title available?) | 1996-04-29 | Paper |
Non-Stanley bounds for network reliability
Journal of Algebraic Combinatorics | 1996-03-17 | Paper |
A new approach to solving three combinatorial enumeration problems on planar graphs
Discrete Applied Mathematics | 1996-03-11 | Paper |
| scientific article; zbMATH DE number 827994 (Why is no real title available?) | 1996-02-25 | Paper |
| scientific article; zbMATH DE number 795224 (Why is no real title available?) | 1996-02-18 | Paper |
| scientific article; zbMATH DE number 825146 (Why is no real title available?) | 1995-12-12 | Paper |
| scientific article; zbMATH DE number 812092 (Why is no real title available?) | 1995-11-01 | Paper |
Consecutive cuts and paths, and bounds on <i>k</i>‐terminal reliability
Networks | 1995-07-20 | Paper |
Thwarts in transversal designs
Designs, Codes and Cryptography | 1995-05-04 | Paper |
The complexity of computing the Tutte polynomial on transversal matroids
Combinatorica | 1995-05-04 | Paper |
Anti-mitre Steiner triple systems
Graphs and Combinatorics | 1995-05-03 | Paper |
Concerning difference families with block size four
Discrete Mathematics | 1995-05-03 | Paper |
| scientific article; zbMATH DE number 749268 (Why is no real title available?) | 1995-05-01 | Paper |
| scientific article; zbMATH DE number 742896 (Why is no real title available?) | 1995-04-11 | Paper |
Partial Steiner triple systems with equal-sized holes
Journal of Combinatorial Theory. Series A | 1995-04-04 | Paper |
The Spectrum of Orthogonal Steiner Triple Systems
Canadian Journal of Mathematics | 1995-03-20 | Paper |
Reliability polynomials can cross twice
Journal of the Franklin Institute | 1995-01-08 | Paper |
Analysis and synthesis problems for network resilience
Mathematical and Computer Modelling | 1994-12-04 | Paper |
Network reliability and the probabilistic estimation of damage from fire spread
Annals of Operations Research | 1994-12-01 | Paper |
| scientific article; zbMATH DE number 617592 (Why is no real title available?) | 1994-11-27 | Paper |
| scientific article; zbMATH DE number 434884 (Why is no real title available?) | 1994-10-31 | Paper |
On the log concavity of reliability and matroidal sequences
Advances in Applied Mathematics | 1994-07-03 | Paper |
Threshold Channel Graphs
Combinatorics, Probability and Computing | 1994-04-28 | Paper |
| scientific article; zbMATH DE number 553911 (Why is no real title available?) | 1994-04-21 | Paper |
Transformations on channel graphs
IEEE Transactions on Communications | 1994-01-16 | Paper |
Computing residual connectedness reliability for restricted networks
Discrete Applied Mathematics | 1993-11-28 | Paper |
| scientific article; zbMATH DE number 426154 (Why is no real title available?) | 1993-11-01 | Paper |
Reliable assignments of processors to tasks and factoring on matroids
Discrete Mathematics | 1993-10-24 | Paper |
The spectrum of maximal partial Steiner triple systems
Designs, Codes and Cryptography | 1993-08-29 | Paper |
Renormalization of two—terminal reliability
Networks | 1993-08-23 | Paper |
Network transformations and bounding network reliability
Networks | 1993-06-29 | Paper |
Support sizes of sixfold triple systems
Discrete Mathematics | 1993-06-20 | Paper |
| scientific article; zbMATH DE number 176253 (Why is no real title available?) | 1993-05-18 | Paper |
Roots of the Reliability Polynomials
SIAM Journal on Discrete Mathematics | 1993-04-01 | Paper |
| scientific article; zbMATH DE number 124516 (Why is no real title available?) | 1993-02-21 | Paper |
| scientific article; zbMATH DE number 124522 (Why is no real title available?) | 1993-02-21 | Paper |
Series-Parallel Bounds for the Two-Terminal Reliability Problem
ORSA Journal on Computing | 1993-01-17 | Paper |
Series-parallel subgraphs of planar graphs
Networks | 1993-01-17 | Paper |
Directed star decompositions of the complete directed graph
Journal of Graph Theory | 1993-01-17 | Paper |
Support sizes of triple systems
Journal of Combinatorial Theory. Series A | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 91034 (Why is no real title available?) | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 91048 (Why is no real title available?) | 1993-01-16 | Paper |
A parallelization of Miller's \(n^{\log n}\) isomorphism technique
Information Processing Letters | 1993-01-16 | Paper |
Concerning multiplier automorphisms of cyclic Steiner triple systems
Designs, Codes and Cryptography | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 68916 (Why is no real title available?) | 1992-10-18 | Paper |
| scientific article; zbMATH DE number 68342 (Why is no real title available?) | 1992-10-06 | Paper |
Pairwise Balanced Designs with Block Sizes Three and Four
Canadian Journal of Mathematics | 1992-09-27 | Paper |
Steiner triple systems of order 19 with nontrivial automorphism group
Mathematics of Computation | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 31907 (Why is no real title available?) | 1992-06-28 | Paper |
Transitive Steiner and Kirkman Triple Systems of Order 27
Mathematics of Computation | 1992-06-28 | Paper |
A note on bounding \(k\)-terminal reliability
Algorithmica | 1992-06-28 | Paper |
A new class of group divisible designs with block size three
Journal of Combinatorial Theory. Series A | 1992-06-28 | Paper |
The fine structure of threefold triple systems: \(v\equiv 1 \text{ or }3\pmod 6\)
Discrete Mathematics | 1992-06-28 | Paper |
Intersections and supports of quadruple systems
Discrete Mathematics | 1992-06-28 | Paper |
Directed star decompositions of directed multigraphs
Discrete Mathematics | 1992-06-28 | Paper |
Combinatorial aspects of network reliability
Annals of Operations Research | 1992-06-27 | Paper |
The number of t-wise balanced designs
Combinatorica | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 11989 (Why is no real title available?) | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 11141 (Why is no real title available?) | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 11141 (Why is no real title available?) | 1992-06-25 | Paper |
Unit disk graphs
Discrete Mathematics | 1992-06-25 | Paper |
Permutation graphs: Connected domination and Steiner trees
Discrete Mathematics | 1992-06-25 | Paper |
Spanning sets and scattering sets in Steiner triple systems
Journal of Combinatorial Theory. Series A | 1992-06-25 | Paper |
Partitioning Steiner triple systems into complete arcs
Discrete Mathematics | 1992-06-25 | Paper |
Neighbor designs and m-wheel systems
Journal of Statistical Planning and Inference | 1991-01-01 | Paper |
Network reliability: Numbers or insight? (A discussion paper)
Annals of Operations Research | 1991-01-01 | Paper |
Automorphisms of directed triple systems
Bulletin of the Australian Mathematical Society | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4172985 (Why is no real title available?) | 1990-01-01 | Paper |
Efficient algorithms for computing the reliability of permutation and interval graphs
Networks | 1990-01-01 | Paper |
Locating A Broadcast Facility In An Unreliable Network
INFOR: Information Systems and Operational Research | 1990-01-01 | Paper |
Combining monte carlo estimates and bounds for network reliability
Networks | 1990-01-01 | Paper |
Repeated edges in 2-factorizations
Journal of Graph Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4214005 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4185614 (Why is no real title available?) | 1990-01-01 | Paper |
Probabilistic single processor scheduling
Discrete Applied Mathematics | 1990-01-01 | Paper |
On two dual classes of planar graphs
Discrete Mathematics | 1990-01-01 | Paper |
The spectrum of support sizes for threefold triple systems
Discrete Mathematics | 1990-01-01 | Paper |
Unranking and ranking spanning trees of a graph
Journal of Algorithms | 1989-01-01 | Paper |
Computing 2-terminal reliability for radio-broadcast networks
IEEE Transactions on Reliability | 1989-01-01 | Paper |
Multiplicative improvements in network reliability bounds
Networks | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4162890 (Why is no real title available?) | 1989-01-01 | Paper |
Hybrid triple systems and cubic feedback sets
Graphs and Combinatorics | 1989-01-01 | Paper |
Matroid Steiner problems, the Tutte polynomial and network reliability
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
Simple neighbourhoods in triple systems
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Percentages in pairwise balanced designs
Discrete Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4110737 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4089594 (Why is no real title available?) | 1988-01-01 | Paper |
The complexity of some edge deletion problems
IEEE Transactions on Circuits and Systems | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4083346 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4108779 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4079439 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4094838 (Why is no real title available?) | 1988-01-01 | Paper |
Lower bounds on two-terminal network reliability
Discrete Applied Mathematics | 1988-01-01 | Paper |
The strong chromatic number of partial triple systems
Discrete Applied Mathematics | 1988-01-01 | Paper |
Edge-packings of graphs and network reliability
Discrete Mathematics | 1988-01-01 | Paper |
Edge-coloured designs with block size four
Aequationes Mathematicae | 1988-01-01 | Paper |
Problem 94
Discrete Mathematics | 1988-01-01 | Paper |
A Set System Polynomial with Colouring and Reliability Applications
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4041928 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4041929 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4019092 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4053628 (Why is no real title available?) | 1987-01-01 | Paper |
Network Resilience
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4053685 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4029580 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4053686 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049658 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4045783 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4053627 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4037877 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4037875 (Why is no real title available?) | 1987-01-01 | Paper |
Counting almost minimum cutsets with reliability applications
Mathematical Programming | 1987-01-01 | Paper |
Element neighbourhoods in twofold triple systems
Journal of Geometry | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4045097 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3993599 (Why is no real title available?) | 1986-01-01 | Paper |
Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
Canadian Mathematical Bulletin | 1986-01-01 | Paper |
Improving reliability bounds in computer networks
Networks | 1986-01-01 | Paper |
Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
IEEE Transactions on Reliability | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4014739 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3947973 (Why is no real title available?) | 1986-01-01 | Paper |
Some NP-complete problems for hypergraph degree sequences
Discrete Applied Mathematics | 1986-01-01 | Paper |
Quadratic leaves of maximal partial triple systems
Graphs and Combinatorics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3924815 (Why is no real title available?) | 1985-01-01 | Paper |
Cataloguing the graphs on 10 vertices
Journal of Graph Theory | 1985-01-01 | Paper |
The Leggett bounds for network reliability
IEEE Transactions on Circuits and Systems | 1985-01-01 | Paper |
The most reliable series-parallel networks
Networks | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3981181 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3961623 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917708 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3954940 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3836049 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3906530 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4008435 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4014417 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4057524 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3931027 (Why is no real title available?) | 1985-01-01 | Paper |
Finding minimum dominating cycles in permutation graphs
Operations Research Letters | 1985-01-01 | Paper |
Optimum Communication Spanning Trees in Series-Parallel Networks
SIAM Journal on Computing | 1985-01-01 | Paper |
Minimizing setups in ordered sets of fixed width
Order | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3873343 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3896955 (Why is no real title available?) | 1984-01-01 | Paper |
Block Sizes in Pairwise Balanced Designs
Canadian Mathematical Bulletin | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3884101 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3880716 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3878976 (Why is no real title available?) | 1984-01-01 | Paper |
Recursive constructions for cyclic block designs
Journal of Statistical Planning and Inference | 1984-01-01 | Paper |
The complexity of completing partial Latin squares
Discrete Applied Mathematics | 1984-01-01 | Paper |
A census of regular 3-polystroma arising from honeycombs
Discrete Mathematics | 1984-01-01 | Paper |
Small embeddings of partial directed triple systems and partial triple systems with even
Journal of Combinatorial Theory. Series A | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3843756 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3853137 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3861177 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3827885 (Why is no real title available?) | 1983-01-01 | Paper |
Steiner trees, partial 2–trees, and minimum IFI networks
Networks | 1983-01-01 | Paper |
Greedy Colourings of Steiner Triple Systems
Combinatorics '81 in honour of Beniamino Segre, Proceedings of the International Conference on Combinatorial Geometrics and their Applications | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3855116 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3815653 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3875292 (Why is no real title available?) | 1983-01-01 | Paper |
Completing small partial triple systems
Discrete Mathematics | 1983-01-01 | Paper |
Embedding partial Steiner triple systems is NP-complete
Journal of Combinatorial Theory. Series A | 1983-01-01 | Paper |
Every twofold triple system can be directed
Journal of Combinatorial Theory. Series A | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3792207 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3811587 (Why is no real title available?) | 1982-01-01 | Paper |
Kotzig Factorizations: Existence and Computational Results
Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday | 1982-01-01 | Paper |
Farey Series and Maximal Outerplanar Graphs
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
Coloring Block Designs is NP-Complete
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
The Analysis of Directed Triple Systems by Refinement
North-Holland Mathematics Studies | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3815666 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3882438 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3797763 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3805557 (Why is no real title available?) | 1982-01-01 | Paper |
The chromatic index of cyclic Steiner 2-designs
International Journal of Mathematics and Mathematical Sciences | 1982-01-01 | Paper |
Colouring Steiner quadruple systems
Discrete Applied Mathematics | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3803465 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3779387 (Why is no real title available?) | 1981-01-01 | Paper |
On testing isomorphism of permutation graphs
Networks | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3777509 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3734646 (Why is no real title available?) | 1981-01-01 | Paper |
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
SIAM Journal on Computing | 1981-01-01 | Paper |
Concerning the complexity of deciding isomorphism of block designs
Discrete Applied Mathematics | 1981-01-01 | Paper |
Cyclic block designs with block size 3
European Journal of Combinatorics | 1981-01-01 | Paper |
Deciding Hadamard equivalence of Hadamard matrices
BIT | 1981-01-01 | Paper |
The Complexity of Combinatorial Isomorphism Problems
Combinatorics 79 Part I | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3711979 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3664966 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3711981 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3719155 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3690686 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3708421 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3728314 (Why is no real title available?) | 1980-01-01 | Paper |
A correction to Colbourn's paper on the complexity of matrix symmetrizability
Information Processing Letters | 1980-01-01 | Paper |
On deciding switching equivalence of graphs
Discrete Applied Mathematics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3737729 (Why is no real title available?) | 1979-01-01 | Paper |
Orderly algorithms for graph generation
International Journal of Computer Mathematics | 1979-01-01 | Paper |
Orderly algorithms for generating restricted classes of graphs
Journal of Graph Theory | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3623616 (Why is no real title available?) | 1979-01-01 | Paper |
The complexity of symmetrizing matrices
Information Processing Letters | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3604941 (Why is no real title available?) | 1978-01-01 | Paper |
