Elusive Codes in Hamming Graphs - Daniel R. Hawtin; Neil I. Gillespie; Cheryl E. Praeger (CoRR, 2012)

Entry-faithful 2-neighbour transitive codes. - Neil I. Gillespie; Michael Giudici; Daniel R. Hawtin; Cheryl E. Praeger (Des. Codes Cryptogr., 2016)

Alphabet-almost-simple 2-neighbour-transitive codes. - Neil I. Gillespie; Daniel R. Hawtin (Ars Math. Contemp., 2018)

On the 486-Vertex Distance-Regular Graphs of Koolen-Riebeek and Soicher. - Robert F. Bailey; Daniel R. Hawtin (Electron. J. Comb., 2020)

2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity. - Neil I. Gillespie; Daniel R. Hawtin; Cheryl E. Praeger (Electron. J. Comb., 2020)

Minimal binary 2-neighbour-transitive codes. - Daniel R. Hawtin; Cheryl E. Praeger (J. Comb. Theory A, 2020)

s-Elusive codes in Hamming graphs. - Daniel R. Hawtin (Des. Codes Cryptogr., 2021)

The non-existence of block-transitive subspace designs. - Daniel R. Hawtin; Jesse Lansdown (Comb. Theory, 2022)

Neighbour-transitive codes and partial spreads in generalised quadrangles. - Dean Crnkovic; Daniel R. Hawtin; Andrea Svob (Des. Codes Cryptogr., 2022)

On the classification of binary completely transitive codes with almost-simple top-group. - Robert F. Bailey; Daniel R. Hawtin (Eur. J. Comb., 2023)

Group actions on codes in graphs. - Daniel R. Hawtin; Cheryl E. Praeger (CoRR, 2024)

Neighbour-transitive codes in Kneser graphs. - Dean Crnkovic; Daniel R. Hawtin; Nina Mostarac; Andrea Svob (J. Comb. Theory, Ser. A, 2024)

A characterisation of edge-affine 2-arc-transitive covers of K2n,2n. - Daniel R. Hawtin; Cheryl E. Praeger; Jin-Xin Zhou (J. Comb. Theory, Ser. A, 2024)

Transitive (q - 1)-fold packings of PG (q). - Daniel R. Hawtin (Discret. Math., 2025)