On bipartite tetravalent graphs. - D. H. Smith (Discret. Math., 1974)

An improved version of Lloyd's theorem. - D. H. Smith (Discret. Math., 1976)

On the construction of optimally reliable graphs. - Derek H. Smith; Lynne L. Doty (Networks, 1990)

Optimally reliable networks. - D. H. Smith (Ann. Oper. Res., 1991)

Optimally Reliable Graphs for Both Vertex and Edge Failures. - D. H. Smith (Comb. Probab. Comput., 1993)

A comparison of local search algorithms for radio link frequency assignment problems. - Steve Hurley; S. U. Thiel; D. H. Smith (SAC, 1996)

Bounds for the frequency assignment problem. - D. H. Smith; Steve Hurley (Discret. Math., 1997)

A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment. - Christine L. Valenzuela; Steve Hurley; Derek H. Smith (PPSN, 1998)

Improving heuristics for the frequency assignment problem. - Derek H. Smith; Steve Hurley; S. U. Thiel (Eur. J. Oper. Res., 1998)

Lower bounding techniques for frequency assignment. - Stuart M. Allen; D. H. Smith; Steve Hurley (Discret. Math., 1999)

A scheme for the synchronization of variable length codes. - Stephanie Perkins; Derek H. Smith (Discret. Appl. Math., 2000)

A new lower bound for the channel assignment problem. - Derek H. Smith; Stephen Hurley; Stuart M. Allen (IEEE Trans. Veh. Technol., 2000)

Channel Loading in Private Mobile Radio Networks. - Steve Hurley; Roger M. Whitaker; Derek H. Smith (Ann. Oper. Res., 2001)

Lower Bounds for Fixed Spectrum Frequency Assignment. - Roberto Montemanni; D. H. Smith; Stuart M. Allen (Ann. Oper. Res., 2001)

Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem. - D. H. Smith; Stuart M. Allen; Steve Hurley (Ann. Oper. Res., 2001)

Generation of lower bounds for minimum span frequency assignment. - Stuart M. Allen; Derek H. Smith; Steve Hurley (Discret. Appl. Math., 2002)

An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. - Roberto Montemanni; Derek H. Smith; Stuart M. Allen (IEEE Trans. Veh. Technol., 2002)

An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem. - Roberto Montemanni; Jim N. J. Moon; Derek H. Smith (IEEE Trans. Veh. Technol., 2003)

Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes. - Stephanie Perkins; Derek H. Smith; Alan Ryley (Comput. J., 2004)

An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. - Roberto Montemanni; D. H. Smith; Stuart M. Allen (Eur. J. Oper. Res., 2004)

Robust Data Compression: Variable Length Codes and Burst Errors. - Stephanie Perkins; Derek H. Smith (Comput. J., 2005)

Assignment of frequency lists in frequency hopping networks. - Jim N. J. Moon; Lesley A. Hughes; Derek H. Smith (IEEE Trans. Veh. Technol., 2005)

A New Table of Constant Weight Codes of Length Greater than 28. - Derek H. Smith; Lesley A. Hughes; Stephanie Perkins (Electron. J. Comb., 2006)

On an upper bound for mixed error-correcting codes. - Stephanie Perkins; Alexander L. Sakhnovich; Derek H. Smith (IEEE Trans. Inf. Theory, 2006)

Ant Colony Systems for Large Sequential Ordering Problems. - Roberto Montemanni; Derek H. Smith; Luca Maria Gambardella (SIS, 2007)

Measuring the Effectiveness of Frequency Assignment Algorithms. - Derek H. Smith; Lesley A. Hughes; Jim N. J. Moon; Roberto Montemanni (IEEE Trans. Veh. Technol., 2007)

A heuristic manipulation technique for the sequential ordering problem. - Roberto Montemanni; D. H. Smith; Luca Maria Gambardella (Comput. Oper. Res., 2008)

Cyclically permutable representations of cyclic codes. - Derek H. Smith; Stephanie Perkins (Discret. Appl. Math., 2008)

Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. - Roberto Montemanni; Derek H. Smith (J. Math. Model. Algorithms, 2008)

Frequency assignment, multiple interference and binary constraints. - J. S. Graham; Roberto Montemanni; Jim N. J. Moon; D. H. Smith (Wirel. Networks, 2008)

Gold codes, Hadamard partitions and the security of CDMA systems. - Derek H. Smith; Richard P. Ward; Stephanie Perkins (Des. Codes Cryptogr., 2009)

Sequential ordering problems for crane scheduling in port terminals. - Roberto Montemanni; Derek H. Smith; Andrea Emilio Rizzoli; Luca Maria Gambardella (Int. J. Simul. Process. Model., 2009)

The Construction of Variable Length Codes With Good Synchronization Properties. - M. B. J. Higgs; Stephanie Perkins; Derek H. Smith (IEEE Trans. Inf. Theory, 2009)

Heuristic algorithms for constructing binary constant weight codes. - Roberto Montemanni; Derek H. Smith (IEEE Trans. Inf. Theory, 2009)

Heuristic manipulation, tabu search and frequency assignment. - Roberto Montemanni; Derek H. Smith (Comput. Oper. Res., 2010)

Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices. - Derek H. Smith; Francis H. Hunt; Stephanie Perkins (IEEE Trans. Inf. Theory, 2010)

The Application of Frequency Assignment Techniques in Spreading Code Assignment. - S. O. Sanusi; Derek H. Smith; R. A. Jones; Stephanie Perkins (Wirel. Pers. Commun., 2010)

Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. - Derek H. Smith; Niema Aboluion; Roberto Montemanni; Stephanie Perkins (Discret. Math., 2011)

Some Constant Weight Codes from Primitive Permutation Groups. - Derek H. Smith; Roberto Montemanni (Electron. J. Comb., 2012)

A new table of permutation codes. - Derek H. Smith; Roberto Montemanni (Des. Codes Cryptogr., 2012)

Linear and nonlinear constructions of DNA codes with Hamming distance 1-s2.0-S0012365X11005280-si18, constant GC-content and a reverse-complement constraint. - Niema Aboluion; Derek H. Smith; Stephanie Perkins (Discret. Math., 2012)

The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions. - Francis H. Hunt; Derek H. Smith (IEEE Trans. Wirel. Commun., 2012)

Permutation codes with specified packing radius. - Derek H. Smith; Roberto Montemanni (Des. Codes Cryptogr., 2013)

The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions. - Francis H. Hunt; Derek H. Smith (Wirel. Pers. Commun., 2013)

Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints. - Dan Tulpan; Derek H. Smith; Roberto Montemanni (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

IIS you is my digital baby: an intimate interface system for persons with disabilities. - Deborah I. Fels; D. H. Smith; R. Baffa da Silva; Diana Aybar; Margot Whitfield (Graphics Interface, 2015)

Decoding mixed errors and erasures in permutation codes. - Francis H. Hunt; Stephanie Perkins; Derek H. Smith (Des. Codes Cryptogr., 2015)

Channel models and error correction codes for DNA information storage. - Francis H. Hunt; Stephanie Perkins; Derek H. Smith (Int. J. Inf. Coding Theory, 2015)

Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms. - Roberto Montemanni; János Barta; Derek H. Smith (WorldCIST (1), 2016)

Wavelet spectra and filtering of tropical cyclone forecast errors. - D. H. Smith (Int. J. Wavelets Multiresolution Inf. Process., 2018)

Solving the maximum clique problem with a hybrid algorithm. - Derek H. Smith; Stephanie Perkins; Roberto Montemanni (Int. J. Metaheuristics, 2019)

The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm. - Derek H. Smith; Roberto Montemanni; Stephanie Perkins (Algorithms, 2020)

Upper and lower bounds based on linear programming for the b-coloring problem. - Roberto Montemanni; Xiaochen Chou; Derek H. Smith (EURO J. Comput. Optim., 2022)

The missing Moore graph as an optimization problem. - Derek H. Smith; Roberto Montemanni (EURO J. Comput. Optim., 2023)

On Solving the Set Orienteering Problem. - Roberto Montemanni; Derek H. Smith (Symmetry, 2024)

A model-based algorithm for the Probabilistic Orienteering Problem. - Roberto Montemanni; Derek H. Smith (Comput. Oper. Res., 2025)

Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. - Roberto Montemanni; Derek H. Smith (Comput. Oper. Res., 2025)