Recent Advances in the Study of the Dandelion Code, Happy Code, and Blob Code Spanning Tree Representations. - Tim Paulden; David K. Smith 002 (IEEE Congress on Evolutionary Computation, 2006)

From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality. - Tim Paulden; David K. Smith 002 (IEEE Trans. Evol. Comput., 2006)

Some novel locality results for the blob code spanning tree representation. - Tim Paulden; David K. Smith 002 (GECCO, 2007)

Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm. - Tim Paulden; David K. Smith 002 (Electron. J. Comb., 2007)

The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms. - Evan Thompson; Tim Paulden; David K. Smith 002 (IEEE Trans. Evol. Comput., 2007)

Modeling Intransitivity in Pairwise Comparisons with Application to Baseball Data. - Harriet Spearing; Jonathan A. Tawn; David Irons; Tim Paulden (J. Comput. Graph. Stat., 2023)