| Revisiting the intersection problem for minimum coverings of complete graphs with triples. | 0 | 0.34 | 2017 |
| Almost \(2\) -perfect \(6\) -cycle systems | 0 | 0.34 | 2015 |
| Triple metamorphosis of twofold triple systems. | 0 | 0.34 | 2013 |
| Palettes In Block Colourings Of Designs | 0 | 0.34 | 2013 |
| Extra two-fold Steiner pentagon systems | 1 | 0.36 | 2012 |
| Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles | 1 | 1.14 | 2011 |
| The Triangle Intersection Problem For Nested Steiner Triple Systems | 1 | 0.43 | 2011 |
| The generalized almost resolvable cycle system problem | 1 | 0.36 | 2010 |
| ON (K-4, K-4 - e)-DESIGNS | 0 | 0.34 | 2009 |
| The Metamorphosis of K4\e Designs Into Maximum Packings Of Kn With 4-Cycles | 4 | 0.86 | 2005 |
| Lambda-Fold Complete Graph Decompositions Into Perfect Four-Triple Configurations | 1 | 0.41 | 2005 |
| The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles | 0 | 0.34 | 2004 |
| Perfect hexagon triple systems | 8 | 1.39 | 2004 |
| Completing the spectrum of 2-chromatic S(2,4,v) | 7 | 0.94 | 2002 |
| The number of 4-cycles in 2-factorizations of K2n minus a 1-factor | 1 | 0.35 | 2000 |
| The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles | 1 | 0.45 | 1998 |
| Two Doyen-Wilson theorems for maximum packings with triples | 5 | 0.65 | 1998 |
| On equationally defining extended cycle systems | 1 | 0.41 | 1997 |
| The spectrum for 2-perfect bowtie systems | 1 | 0.38 | 1994 |
| A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m | 4 | 0.68 | 1993 |
| The spectrum for lambda-fold 2-perfect 6-cycle systems. | 5 | 1.34 | 1992 |
| 2-Perfect m-cycle systems | 10 | 1.15 | 1992 |
| Support Sizes of Triple Systems. | 0 | 0.34 | 1992 |
| Support sizes of triple systems | 2 | 0.44 | 1992 |
| The spectrum for 2-perfect 6-cycle systems | 12 | 2.44 | 1991 |
| Blocking sets in designs with block size 4 | 7 | 1.23 | 1990 |
| On the Number of Mendelsohn and Transitive Triple Systems | 4 | 0.52 | 1984 |
| Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common | 2 | 0.44 | 1982 |
| Orthogonal latin square graphs. | 9 | 1.35 | 1979 |
| Steiner Quadruple Systems - Survey | 47 | 12.39 | 1978 |
| A partial room square can be embedded in a room square | 0 | 0.34 | 1977 |
| Conjugates Of An N2x4 Orthogonal Array | 4 | 1.21 | 1977 |
| Steiner quadruple systems all of whose derived Steiner triple systems are nonisomorphic | 4 | 2.39 | 1976 |
| A finite partial idempotent latin cube can be embedded in a finite idempotent latin cube | 4 | 0.80 | 1976 |
| 2 Finite Embedding Theorems For Partial 3-Quasigroups | 1 | 0.38 | 1976 |
| Finite embedding theorems for partial Steiner triple systems | 1 | 1.00 | 1975 |
| Disjoint finite partial steiner triple systems can be embedded in disjoint finite steiner triple systems | 2 | 0.69 | 1975 |
| A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3 | 23 | 5.67 | 1975 |
| A simple construction of disjoint and almost disjoint Steiner triple systems | 2 | 0.68 | 1974 |
| Construction of nonisomorphic reverse steiner quasigroups | 0 | 0.34 | 1974 |
| On the construction of cyclic quasigroups | 4 | 2.30 | 1973 |
| Construction of doubly diagonalized orthogonal latin squares | 6 | 2.49 | 1973 |
| Finite embedding theorems for partial Latin squares, quasi-groups, and loops | 1 | 6.28 | 1972 |
