On the genus and connectivity of Hamiltonian graphs. - Richard A. Duke (Discret. Math., 1972)

Graphic matroids and the multicommodity transportation problem. - James R. Evans; John J. Jarvis; Richard A. Duke (Math. Program., 1977)

On graphs with small subgraphs of large chromatic number. - Vojtech Rödl; Richard A. Duke (Graphs Comb., 1985)

The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) - Noga Alon; Richard A. Duke; Hanno Lefmann; Vojtech Rödl; Raphael Yuster (FOCS, 1992)

Cycle-connected graphs. - Richard A. Duke; Paul Erdös; Vojtech Rödl (Discret. Math., 1992)

The Algorithmic Aspects of the Regularity Lemma. - Noga Alon; Richard A. Duke; Hanno Lefmann; Vojtech Rödl; Raphael Yuster (J. Algorithms, 1994)

The Erdös-Ko-Rado Theorem for Small Families. - Richard A. Duke; Vojtech Rödl (J. Comb. Theory A, 1994)

On Uncrowded Hypergraphs. - Richard A. Duke; Hanno Lefmann; Vojtech Rödl (Random Struct. Algorithms, 1995)

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph. - Richard A. Duke; Hanno Lefmann; Vojtech Rödl (SIAM J. Comput., 1995)

On large intersecting subfamilies of uniform setfamilies. - Richard A. Duke; Paul Erdös; Vojtech Rödl (Random Struct. Algorithms, 2003)