 | 2005 |
|---|
| 12 |       | John Ginsburg,
Bill Sands:
On the number of elements dominated by a subgroup.
Ars Comb. 74: (2005) |
| 11 |  | Dwight Duffus,
Bill Sands:
Splitting Numbers of Grids.
Electr. J. Comb. 12: (2005) |
| 2000 |
|---|
| 10 | | John Ginsburg,
Bill Sands:
An optimal algorithm for a parallel cutting problem.
Ars Comb. 57: (2000) |
| 9 | | John Ginsburg,
Bill Sands:
Completely Disconnecting the Complete Graph.
SIAM J. Discrete Math. 13(1): 33-47 (2000) |
| 1999 |
|---|
| 8 | | Dwight Duffus,
Bill Sands:
An inequality for the sizes of prime filters of finite distributive lattices.
Discrete Mathematics 201(1-3): 89-99 (1999) |
| 1996 |
|---|
| 7 | | V. Linek,
Bill Sands:
A note on paths in edge-coloured tournaments.
Ars Comb. 44: (1996) |
| 1991 |
|---|
| 6 | | Dwight Duffus,
Bill Sands,
Norbert Sauer,
Robert E. Woodrow:
Two-colouring all two-element maximal antichains.
J. Comb. Theory, Ser. A 57(1): 109-116 (1991) |
| 1990 |
|---|
| 5 | | Dwight Duffus,
Bill Sands,
Peter Winkler:
Maximal Chains and Antichains in Boolean Lattices.
SIAM J. Discrete Math. 3(2): 197-205 (1990) |
| 1989 |
|---|
| 4 | | John Ginsburg,
Bill Sands,
Douglas B. West:
A length-width inequality for partially ordered sets with two-element cutsets.
J. Comb. Theory, Ser. B 46(2): 232-239 (1989) |
| 1986 |
|---|
| 3 | | Ulrich Faigle,
Bill Sands:
A size-width inequality for distributive lattices.
Combinatorica 6(1): 29-33 (1986) |
| 1982 |
|---|
| 2 | | Bill Sands,
Norbert Sauer,
Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory, Ser. B 33(3): 271-275 (1982) |
| 1981 |
|---|
| 1 | | Bill Sands:
Counting antichains in finite partially ordered sets.
Discrete Mathematics 35(1-3): 213-228 (1981) |
