The greedy travelling salesman's problem. - T. A. Jenkyns (Networks, 1979)

On the Inadequacy of Tournament Algorithms for the N-SCS Problem. - James H. Bradford; T. A. Jenkyns (Inf. Process. Lett., 1991)

Generating all k-subsets of {1, ..., n} with minimal changes. - T. A. Jenkyns; D. McCarthy (Ars Comb., 1995)