| |
| 2007 | ||
|---|---|---|
| 4 | EE | Tim Paulden, David K. Smith: Some novel locality results for the blob code spanning tree representation. GECCO 2007: 1320-1327 |
| 3 | EE | Tim Paulden, David K. Smith: Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm. Electr. J. Comb. 14(1): (2007) |
| 2 | EE | Evan Thompson, Tim Paulden, David K. Smith: The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms. IEEE Trans. Evolutionary Computation 11(1): 91-100 (2007) |
| 2006 | ||
| 1 | EE | Tim Paulden, David K. Smith: From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality. IEEE Trans. Evolutionary Computation 10(2): 108-123 (2006) |
| 1 | David K. Smith | [1] [2] [3] [4] |
| 2 | Evan Thompson | [2] |