| 2005 |
| 19 | EE | Dwight Duffus,
Norbert W. Sauer:
Chromatic numbers and products.
Discrete Mathematics 300(1-3): 91-99 (2005) |
| 18 | EE | Dwight Duffus,
Bill Sands:
Splitting Numbers of Grids.
Electr. J. Comb. 12: (2005) |
| 2003 |
| 17 | EE | Dwight Duffus:
Obituary: Ivan Rival.
Order 20(3): 173-183 (2003) |
| 2002 |
| 16 | EE | Dwight Duffus,
Ted Goddard:
Some progress on the Aharoni-Korman conjecture.
Discrete Mathematics 250(1-3): 79-91 (2002) |
| 2000 |
| 15 | EE | Dwight Duffus,
Ted Goddard:
An Ordered Set of Size aleph1 with Monochromatic Maximal Chains.
Order 17(3): 227-238 (2000) |
| 1999 |
| 14 | EE | Dwight Duffus,
Bill Sands:
An inequality for the sizes of prime filters of finite distributive lattices.
Discrete Mathematics 201(1-3): 89-99 (1999) |
| 1998 |
| 13 | | Dwight Duffus,
Tomasz Luczak,
Vojtech Rödl,
Andrzej Rucinski:
Endomorphisms of Partially Ordered Sets.
Combinatorics, Probability & Computing 7(1): 33-46 (1998) |
| 1996 |
| 12 | EE | Dwight Duffus,
Norbert Sauer:
Lattices arising in categorial investigations of Hedetniemi's conjecture.
Discrete Mathematics 152(1-3): 125-139 (1996) |
| 1995 |
| 11 | EE | Dwight Duffus,
Hanno Lefmann,
Vojtech Rödl:
Shift graphs and lower bounds on Ramsey numbers rk(l; r).
Discrete Mathematics 137(1-3): 177-187 (1995) |
| 10 | | Dwight Duffus,
Mark Ginn,
Vojtech Rödl:
On the Computational Complexity of Ordered Subgraph Recognition.
Random Struct. Algorithms 7(3): 223-268 (1995) |
| 1991 |
| 9 | EE | Martin Aigner,
Dwight Duffus,
Daniel J. Kleitman:
Partitioning a power set into union-free classes.
Discrete Mathematics 88(2-3): 113-119 (1991) |
| 8 | EE | 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) |
| 7 | EE | Dwight Duffus,
Hal A. Kierstead,
William T. Trotter:
Fibres and ordered set coloring.
J. Comb. Theory, Ser. A 58(1): 158-164 (1991) |
| 1990 |
| 6 | | Dwight Duffus,
Bill Sands,
Peter Winkler:
Maximal Chains and Antichains in Boolean Lattices.
SIAM J. Discrete Math. 3(2): 197-205 (1990) |
| 1982 |
| 5 | | Dwight Duffus:
Matching in Modular Lattices.
J. Comb. Theory, Ser. A 32(3): 303-314 (1982) |
| 1981 |
| 4 | EE | Dwight Duffus,
Maurice Pouzet,
Ivan Rival:
Complete ordered sets with no infinite antichains.
Discrete Mathematics 35(1-3): 39-52 (1981) |
| 3 | EE | Dwight Duffus,
Ivan Rival:
A structure theory for ordered sets.
Discrete Mathematics 35(1-3): 53-118 (1981) |
| 1980 |
| 2 | EE | Dwight Duffus,
Ivan Rival,
Miklós Simonovits:
Spanning retracts of a partially ordered set.
Discrete Mathematics 32(1): 1-7 (1980) |
| 1978 |
| 1 | | Dwight Duffus,
Ivan Rival:
Separable Subsets of a Finite Lattice.
J. Comb. Theory, Ser. A 25(2): 188-192 (1978) |