 | 2007 |
|---|
| 11 |       | R. A. Bailey,
Peter J. Cameron:
What is a design? How should we classify them?
Des. Codes Cryptography 44(1-3): 223-238 (2007) |
| 2006 |
|---|
| 10 | | R. A. Bailey,
Peter J. Cameron,
Peter Dobcsányi,
John P. Morgan,
Leonard H. Soicher:
Designs on the web.
Discrete Mathematics 306(23): 3014-3027 (2006) |
| 9 | | R. A. Bailey:
Generalized wreath products of association schemes.
Eur. J. Comb. 27(3): 428-435 (2006) |
| 2005 |
|---|
| 8 | | R. A. Bailey:
Balanced colourings of strongly regular graphs.
Discrete Mathematics 293(1-3): 73-90 (2005) |
| 2003 |
|---|
| 7 | | Priscila P. Alejandro,
R. A. Bailey,
Peter J. Cameron:
Association schemes and permutation groups.
Discrete Mathematics 266(1-3): 47-67 (2003) |
| 6 | | R. A. Bailey,
Matthew A. Ollis,
Donald A. Preece:
Round-dance neighbour designs from terraces.
Discrete Mathematics 266(1-3): 69-86 (2003) |
| 2002 |
|---|
| 5 | | R. A. Bailey:
Suprema and infima of association schemes.
Discrete Mathematics 248(1-3): 1-16 (2002) |
| 1997 |
|---|
| 4 | | R. A. Bailey:
A Howell design admitting A51.
Discrete Mathematics 167-168: 65-71 (1997) |
| 3 | | R. A. Bailey,
P. E. Chigbu:
Enumeration of semi-Latin squares.
Discrete Mathematics 167-168: 73-84 (1997) |
| 1996 |
|---|
| 2 |  | R. A. Bailey:
Orthogonal Partitions in Designed Experiments.
Des. Codes Cryptography 8(1-2): 45-77 (1996) |
| 1990 |
|---|
| 1 | | R. A. Bailey,
Dieter Jungnickel:
Translation nets and fixed-point-free group automorphisms.
J. Comb. Theory, Ser. A 55(1): 1-13 (1990) |
