# Staff Directory

## Prof Derek Smith known as Derek Smith (Emeritus Professor from 1/9/14)

## Qualifications

BSc PhD DSc

## About

**Career Summary, Specialist Projects and Academic Activities:**

**Education and Employment**

1968 BSc Mathematics, University of Southampton.

1971 PhD Mathematics, University of Southampton. Thesis title: Highly Symmetrical Graphs of Low

Valency.

1971 Lecturer II, Glamorgan Polytechnic.

1974 Senior Lecturer, The Polytechnic of Wales.

1982- Principal Lecturer, The Polytechnic of Wales.

1980-1991 Part Time Tutor, The Open University.

1983-1988 Part Time Consultant to Plessey Electronic Systems Ltd., CODAS Ltd.

1989-1994 Reader and Deputy Head of Department, University of Glamorgan.

1994-2014 Professor of Mathematics, University of Glamorgan/University of South Wales.

2014- Emeritus Professor of Mathematics, University of South Wales.

## Responsibilities

**Main Teaching subjects and course leadership:**

Network Flows and Reliability

Error-Correcting Codes

Algebra

**Administrative Responsibilities**

Research Co-ordinator for the Division of Mathematics and Statistics and Leader of the Data Integrity and Combinatorics Research Unit.

I was Course Leader for the BSc Mathematics and the MMath for several years from their inception.

I was Deputy Head of Department of the former Department of Mathematics and Computing.

**Management:**

Research Unit leader.

Research:

Coding Theory, Graph Theory, Radio Frequency Assignment

Supervision of Research Fellows and Students

## Publications

**Selected Publications:**

^{1} N.L.Biggs and D.H. Smith, On Trivalent Graphs, Bull. London Math. Soc., 3, (1971), pp. 155-158.

^{2} D.H. Smith, Primitive and Imprimitive Graphs, Quart. J. Math. (Oxford), 22, (1971), pp. 551-557.

^{3} D.H. Smith, On Tetravalent Graphs, J. London Math. Soc, (2), 6, (1973), pp. 659-662.

^{4} D.H. Smith, Distance-Transitive Graphs of Valency Four, J. London Math. Soc. (2), 8, (1974), pp. 377-384.

^{5} D.H. Smith, Bounding the Diameter of a Distance-Transitive Graph, J. Combinatorial Theory (B), 16, (1974), pp. 139-144.

^{6} D.H. Smith, On Bipartite Tetravalent Graphs, Discrete Mathematics, 10, (1974), pp. 167-172.

^{7} D.H. Smith, Distance-Transitive Graphs, Proceedings of the British Combinatorial Conference, Aberystwyth, 1973, Cambridge University Press, 1974, pp. 145-153.

^{8} P. Hammond and D.H. Smith, Perfect Codes in the Graphs Ok, J. Combinatorial Theory (B), 19, (1975), pp. 239-255 .

^{9} D.H. Smith, An Improved Version of Lloyd’s Theorem, Discrete Mathematics, 15, (1976), pp. 175-184.

^{10} P. Hammond and D.H. Smith, An Analogue of Lloyd’s Theorem for Completely Regular Codes, Proceedings of the British Combinatorial Conference, Aberdeen, 1975, Utilitas Mathematica, 1976, pp. 261-267 .

^{11} D.H. Smith, Hamiltonian Circuits on the n-Cube, Canadian Math. Bull. 17, (1975), 5, pp. 759-761.

^{12} D.H. Smith, Perfect Codes in the Graphs Ok and L(Ok), Glasgow Math. Journal, 21, (1980), pp. 169-172.

^{13} D.H. Smith, Binary Perfect Codes (Correspondence), IMA Bulletin, 16, (1980), 10, p. 214.

^{14} D.H. Smith, Reliable Networks and (k,2k-2)-connected Graphs, Proceedings of the Ninth British Combinatorial Conference, Ars Combinatoria, 16B, (1983), pp. 171-176.

^{15} D.H. Smith, Graphs with the Smallest Number of Minimum Cut Sets, Networks, 14, (1984), pp. 47-61.

^{16} T. Evans and D.H. Smith, Optimally Reliable Graphs for Both Edge and Vertex Failures, Networks, 16, (1986), pp. 199-204.

^{17} D.H. Smith, Connectivity Preserving Transformations of Graphs and the Reliability of Mobile Communication Networks, Proceedings of the Tenth British Combinatorial Conference, Ars Combinatoria, 20-A, (1985), pp. 135-139.

^{18} D.H. Smith, Graph Colouring and Frequency Assignment, Proceedings of the Eleventh British Combinatorial Conference, Ars Combinatoria, 25-C(1988), pp. 205-212.

^{19} D.H. Smith and L.L. Doty, On the Construction of Optimally Reliable Graphs, Networks, 20, (1990), pp. 723-729.

^{20} D.B.Kidner, C.B.Jones, D.G.Knight and D.H. Smith, Digital Terrain Models for Radio Path Profiles, Proceedings of the 4th International Symposium on Spatial Data Handling, Zurich 1990.

^{21} D.H. Smith, Optimally Reliable Networks, Annals of Operations Research, 33, (1991), pp. 107-112.

^{22} D.B.Kidner and D.H. Smith, Compression of Digital Elevation Models by Huffman Coding, Computers and Geosciences, 18, (1992), pp. 1013-1034.

^{23} D.H. Smith, Optimally Reliable Graphs for Both Vertex and Edge Failures, Combinatorics, Probability and Computing, 2, (1993), pp. 93-100.

^{24} M. Lewis and D.H. Smith, Optimal Predictors for the Data Compression of Digital Elevation Models Using the Method of Lagrange Multipliers, Proceedings of Auto-Carto 11, Minnesota, 30 October – 1 November 1993, pp. 246-256.

^{25} D.B.Kidner and D.H. Smith, Data Structures for Terrain Modelling and Ground Cover Data, Proceedings of IEE Colloquium on Terrain Modelling and Ground Cover Data for Propagation Studies, 11 November 1993, Institution of Electrical Engineers 1993/212, pp. 7/1-7/9.

^{26} D.H. Smith and M. Lewis, Optimal Predictors for Compression of Digital Elevation Models, Computers and Geosciences, 20, (1994), pp. 1137-1141.

^{27} S. Hurley and D.H. Smith, Fixed Spectrum Frequency Assignment using Natural Algorithms, Genetic Algorithms in Engineering Systems: Innovations and Applications, 12-14 September 1995, Conference Publication No. 414, IEE, 1995.

^{28} O.D.J. Thomas, A. Ryley and D.H. Smith, Synchronized Lossless Data Compression for DDS Tape Storage, Proceedings 1995 International Symposium on Synchronization, Saalbau, Essen, Germany, December 14-15, 1995, pp. 12-15.

^{29} S.Hurley, S.U. Thiel and D.H. Smith, A Comparison of Local Search Algorithms for Radio Link Frequency Assignment Problems, ACM Symposium on Applied Computing, Philadelphia, pp. 251-257, 1996.

^{30} D.B.Kidner and D.H. Smith, Storage Efficient Techniques for Representing Digital Terrain Models, Proceedings of GIS Research UK, Canterbury, Kent, pp. 109-115, April 10-12, 1996.

^{31} D.H. Smith and S.Hurley, Bounds for the Frequency Assignment Problem, Discrete Mathematics, 167/168, (1997), pp. 571-582.

^{32} D.H. Smith, Uniformly Optimally Reliable Networks for Vertex Failures, Applications of Combinatorial Mathematics (ed. C.Mitchell), Oxford University Press, 1997.

^{33} D.H. Smith, Graphs – and How to Make Networks Reliable, Professorial Inaugural Lectures 1995-96, University of Glamorgan, 1996.

^{34} D.B.Kidner and D.H. Smith, Storage-Efficient Techniques for Representing Digital Terrain Models, Innovations in GIS 4, (Ed. Z. Kemp), Taylor & Francis, pp. 25-41, 1997.

^{35} D.B.Kidner and D.H. Smith, Data Compression for Digital Elevation Models, Proceedings of the 3rd Joint European Conference on Geographical Information, Vienna, April 16-18, 1997.

^{36} O.D.J. Thomas, A. Ryley and D.H. Smith, An Adaptive, Error-Tolerant and Lossless Data Compressor for DDS, Journal of Information Recording, vol.23, No. 6, pp. 547-557, 1997.

^{37} D.H. Smith, S. Hurley and S.U. Thiel, Improving Heuristics for the Frequency Assignment Problem, European Journal of Operational Research, vol. 107/1, (1998), pp. 76-86. (ISSN: 0377-2217).

^{38} S. Hurley, D.H. Smith and S.U. Thiel, FASoft: A System for Discrete Channel Frequency Assignment, Radio Science, vol. 32 no. 5, (1997), pp. 1921-1939. (ISSN 0048-6604).

^{39} O.D.J. Thomas, A. Ryley and D.H. Smith, Robust Data Compression Applied to Rotary Head DDS-3 Tapes, Electronics Letters, vol. 33, no.16, (31st July 1997), pp. 1372-1373. (ISSN 0013-5194)

^{40} S.M.Allen, D.H. Smith, S.Hurley, S.U.Thiel, Using Lower Bounds in Minimum Span Frequency Assignment, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (ed. A. Voss, S. Martello, I.H. Osman and C. Roucairol), Kluwer, 1999, pp. 191-204, (ISBN 0-7923-8369-9)

^{41} S.M. Allen, D.H. Smith and S.Hurley, Lower Bounding Techniques for Frequency Assignment, Discrete Mathematics, 197/198, (1999), pp. 41-52, (ISSN 0012-365X).

^{42} D.H. Smith, S.M. Allen and S. Hurley Lower Bounds for Channel Assignment, in Methods and Algorithms for Radio Channel Assignment, (ed. S. Hurley and R. Leese), Oxford University Press, pp. 45-62, 2002. ( ISBN 0 19 850314 8)

^{43} S. Hurley and D.H. Smith, Meta-heuristics and Channel Assignment, in Methods and Algorithms for Radio Channel Assignment, (ed. S. Hurley and R. Leese), Oxford University Press, pp. 22-44, 2002. ( ISBN 0 19 850314 8)

^{44} S.M. Allen, S. Hurley, D.H. Smith and W.J. Watkins, Solving Frequency Assignment Problems, Fourteenth International Wroclaw Symposium and Exhibition on Electromagnetic Compatibility, June 23-25, 1998, pp. 703-704 (ISBN 83-901999-6-3).

^{45} D.B. Kidner and D.H. Smith, Storage-Efficient Techniques for Handling Terrain Data, Proceedings 8th International Conference on Spatial Data Handling (ed. T.K. Poiker and N. Chrisman), pp. 373-384, July 1998.

^{46} C. Valenzuela, S. Hurley, and D.H. Smith, A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment, Proceedings 5th International Conference on Problem Solving from Nature, Lecture Notes in Computer Science 1498 (ed. A.E. Eiben, T. Bäck, M. Schoenauer, H.-P. Schwefel), pp. 907-916, Springer Verlag, 1998). (ISBN 3-540-65078-4).

^{47} D.H. Smith, S.M. Allen, S. Hurley and W.J. Watkins, Frequency Assignment: Methods and Algorithms, Proceedings of NATO IST Symposium on Frequency Assignment, Sharing and Conservation in Systems (Aerospace), Aalborg, Denmark, 5-7 October 1998, NATO RTO-MP-13, pp. K1-K18, January. (ISBN 92-837-003-1).

^{48} S. Perkins and D.H. Smith, A Scheme for the Synchronization of Variable Length Codes, Discrete Applied Mathematics, 101, (2000), pp. 231-245. (ISSN 0166-218X).

^{49} D.H. Smith, S.M. Allen, S. Hurley and W.J. Watkins, Frequency Assignment: Methods and Algorithms, Global Communications, PCS99 issue, Hanson Cooke Ltd., (Sept 1999), pp. 110-127. (ISBN: 1-902221-27-3)

^{50} D.H.Smith, S.Hurley and S.M.Allen, A New Lower Bound for the Channel Assignment Problem, IEEE Transactions on Vehicular Technology, Vol. 49, No. 4, (July 2000), pp. 1265-1272. (ISSN 0018-9545).

^{51} D.B.Kidner, D.H. Smith and M. Dorey, What’s the Point? Interpolation and Extrapolation with a Regular Grid DEM, Proceedings of the 4th International Conference on GeoComputation, Mary Washington College, Fredericksburg, Virginia, USA, 25th-28th July 1999 (ed. J. Diaz, R. Tynes, D. Caldwell and J. Ehlen), 17pp, published on CD- ROM, (ISBN 0-9533477-1-0).

^{52} B.E. Turhan, S. Hurley, J.D. Last and D.H. Smith, Algorithms for Interference Limited Radiobeacon Frequency Assignment, Proceedings of Second International Conference on Information, Communications and Signal Processing (ICICS’ 99), 7-10 December 1999, Singapore, 2A1.5, pp. 1-5 . (ISBN 981-04-2108-7).

^{53} S.M. Allen, D.H. Smith and S. Hurley, Generation of Lower Bounds for Minimum Span Frequency Assignment, Discrete Applied Mathematics, Vol. 119, Nos. 1-2, (June 2002), pp. 59-78. (ISSN 0166-218X).

^{54} S.Hurley, R.M. Whitaker and D.H. Smith, Channel Assignment in Cellular Networks without Channel Separation Constraints, Proceedings of IEEE Vehicular Technology Conference Fall 2000, pp. 1714-1718. (ISBN 0-7803-6508-9).

^{55} R.K. Taplin, G. Wyman, R. Bradbeer, S. Hurley and D.H. Smith, New Frequency Assignment Techniques, 8th Int. Conf. on Software Telecommunications & Computer Networks (SoftCOM 2000), pp. 465-474, CD ROM Proceedings, Oct 10-14, 2000. (ISBN 953-6114-42-9)

^{56} D.H. Smith, R.K. Taplin and S. Hurley, Frequency Assignment with Complex Co-Site Constraints, IEEE Transaction on Electromagnetic Compatibility,Vol. 43, No. 2, (May 2001), pp. 210-218. (ISSN 0018-9375).

^{57} D.B. Kidner, C. Eynon and D.H. Smith, Multiscale Terrain Databases, (Extended Abstract), Proceedings of the GIS Research UK 9th Annual Conference (GISRUK 2001), 18-20 April 2001, (Ed. D.B. Kidner and G. Higgs) , pp. 151-153. (ISBN 1-840540-26-5).

^{58} L.A. Hughes, D.H. Smith and A. Ryley, Robust Data Compression for Digital Elevation Models, (Extended Abstract), Proceedings of the GIS Research UK 9th Annual Conference (GISRUK 2001), 18-20 April 2001, (Ed. D.B. Kidner and G. Higgs) , pp. 462-467. (ISBN 1-840540-26-5).

^{59} S. Hurley, R. M. Whitaker and D.H. Smith, Analysing Multiple Interference in Radio Networks, 9th International Conference on Telecommunications Systems, Modelling and Analysis, March 15-18, 2001, Dallas, Texas, U.S.A., pp. 623-628.

^{60} D.H. Smith and S. Perkins, Applications of Coding Theory in Mobile Radio Communications, Mathematics Today, Vol. 37, No. 3, (June 2001), pp. 84-87. (ISSN 1361-2042).

^{61} D.B. Kidner, D.H. Smith, Advances in the Data Compression of Digital Elevation Models, Computers & Geosciences, 29, (October 2003), pp. 985-1002. (ISSN: 0098-3004)

^{62} S. Hurley, R.M. Whitaker and D.H. Smith, Channel Loading in Private Mobile Radio Networks, Annals of Operations Research, 107, (October 2001), pp. 211-224. (ISSN 0254-5330).

^{63} R. Montemanni, D.H. Smith and S.M. Allen, Lower Bounds for Fixed Spectrum Frequency Assignment, Annals of Operations Research, 107, (October 2001), pp. 237-250. (ISSN 0254-5330).

^{64} D.H. Smith, S.M. Allen and S. Hurley, Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem , Annals of Operations Research, 107, (October 2001), pp. 285-301, (ISSN 0254-5330).

^{65} R. Bradbeer, S. Hurley, D.H. Smith and G.Wyman, Improving Efficiency in Frequency Assignment Engines, IEEE MILCOM 2001: Communications for Network Centric Operations, CD-ROM Proceedings, October 2001. (CD-ROM Proceedings, ISBN 0-7803-7227-1, Softbound Proceedings ISBN 0-7803-7225-5).

^{66} R. Montemanni, D.H. Smith and S.M. Allen, An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference, IEEE Transaction on Vehicular Technology, Vol. 51, No. 5, (Sept 2002), pp. 949-953. (ISSN 0018-9545).

^{67} R. Montemanni, J.N.J. Moon and D.H. Smith, An improved tabu search algorithm for the fixed spectrum frequency assignment problem, IEEE Transactions on Vehicular Technology, Vol. 52, No. 4, (July 2003), pp. 891-901. (ISSN 0018-9545).

^{68} R.A. Jones, D.H. Smith and S. Perkins, Assignment of spreading codes in DS-CDMA UWB systems, Proceedings of IEEE Conference on Ultra Wideband Systems and Technologies, Reston, Virginia, C4, November 2003. (ISBN 0-7803-8818-2)

^{69} R. Montemanni, D.H. Smith and S.M. Allen, An Improved Algorithm to Determine Lower Bounds for the Fixed Spectrum Frequency Assignment Problem, European Journal of Operational Research, 156, (August 2004), pp. 736-751, (ISSN: 0377-2217).

^{70} S. Perkins, D.H. Smith and A. Ryley, Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes, The Computer Journal, Vol. 47, No. 3, (May 2004), pp. 309-319. (ISSN: 0010-4620).

^{71} S. Perkins and D.H. Smith, Robust Data Compression: Variable Length Codes and Burst Errors, The Computer Journal, Vol. 48, No. 3, (May 2005), pp. 315-322. (ISSN: 0010-4620).

^{72} J.N.J. Moon, L.A. Hughes and D.H. Smith, Assignment of Frequency Lists in Frequency Hopping Networks, IEEE Transaction on Vehicular Technology, Vol. 54, No. 3, (May 2005), pp. 1147-1159. (ISSN 0018-9545).

^{73} S. Perkins, A.L. Sakhnovich and D.H. Smith, On an Upper Bound for Mixed Error-Correcting Codes, IEEE Transaction on Information Theory, Vol. 52, No. 2, (February 2006), pp. 708—712. (ISSN: 0018-9448).

^{74} D.H. Smith, L.A. Hughes and S. Perkins, A New Table of Constant Weight Codes of Length Greater than 28, The Electronic Journal of Combinatorics, Vol. 13, No. 1, (May 2006), #A2. (ISSN: 1077-8926).

^{75} D.H. Smith, L.A. Hughes, J.N.J. Moon and R. Montemanni, Measuring the Effectiveness of Frequency Assignment Algorithms, IEEE Transaction on Vehicular Technology, Vol. 56, No. 1, (Jan. 2007), pp. 331-341. (ISSN 0018-9545).

^{76} R. Montemanni, D.H. Smith and L.M. Gambardella, Ant Colony Systems for Large Sequential Ordering Problems, CDROM: “Proceedings of the 2007 IEEE Swarm Intelligence Symposium (SIS 2007)”. (ISBN: 1-4244-0708-7).

^{77} D.H. Smith, S. Perkins, Cyclically permutable representations of cyclic codes,

Discrete Applied Mathematics, Vol. 156, (2008), pp. 76-81. (ISSN 0166-218X).

doi: 10.1016/j.dam.2007.08.038.

^{78} R. Montemanni, D.H. Smith and L.M. Gambardella, A heuristic manipulation technique for the sequential ordering problem, Computers & Operations Research , Vol. 35 (2008) pp. 3931 – 3944 (ISSN: 0305-0548) doi:10.1016/j.cor.2007.05.003

^{79} J. S. Graham, R. Montemanni, J.N.J. Moon and D.H. Smith, Frequency assignment, multiple interference and binary constraints," Wireless Networks 14:4 August 2008 (ISSN: 1022-0038) doi: 10.1007/s11276-006-0730-x

^{80} R. Montemanni, A.E. Rizzoli, D.H. Smith, L.M. Gambardella, Sequential Ordering Problems for Crane Scheduling in Port Terminals, Proceeding of the 11th Intermodal Workshop on Harbor, Maritime & Multimodal Logistic Modeling & Simulation (HMS), International Mediterranean and Latin American Modeling Multiconference (I3M), Bruzzone et al. eds., pages 180-189, September 17-19 2008, Campora San Giovanni, Italy. (ISBN 978-88-903724-2-1).

^{81} R. Montemanni and D.H. Smith, Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm, J. Math. Modelling and Algorithms, Vol. 7 (2008) pp. 311-326 (ISSN: 1570-1166)

doi 10.1007/s10852-008-9087-8

^{82} D.H. Smith, R.P. Ward and S. Perkins, Gold codes, Hadamard partitions and the security of CDMA systems, Designs, Codes and Cryptography, Vol. 51 (2009), pp. 231-243 (ISSN 0925-1022) doi: 10.1007/s10623-008-9257-8

^{83} M.B.J. Higgs, S. Perkins, D.H. Smith, The construction of variable length codes with good synchronization properties, IEEE Transactions on Information Theory, Vol. 55, No. 4, (April 2009), pp. 1696-1700 (ISSN: 0018-9448)

doi: 10.1109/TIT.2009.2013050

^{84} R. Montemanni and D.H. Smith, Heuristic manipulation, tabu search and frequency assignment, Computers & Operations Research, Vol. 37 (2010), pp. 543-551 (ISSN: 0305 0548) doi: 10.1016/j.cor.2008.08.006

^{85} R. Montemanni and D.H. Smith, Heuristic algorithms for constructing binary constant weight codes, IEEE Transactions on Information Theory, Vol. 55, No. 10, (October 2009), pp. 4651 -4656 (ISSN: 0018-9448)

doi: 10.1109/TIT.2009.2027491

^{86} R. Montemanni, D.H. Smith, A.E. Rizzoli and L.M. Gambardella, Sequential ordering problems for crane scheduling in port terminals, International Journal of Simulation and Process Modelling, Vol. 5, No. 4, (2009), pp. 348-361

(ISSN 1740-2123) doi:10.1504/IJSPM.2009.032597

^{87} S.O. Sanusi, D.H. Smith, R.A. Jones and S. Perkins, The application of frequency assignment techniques in spreading code assignment, Wireless Personal Communications, Vol. 54, No. 3, (2010), pp. 397-415 (ISSN 0929-6212)

doi: 10.1007/s11277-009-9732-1

^{88} D.H. Smith, F.H. Hunt and S. Perkins, Exploiting spatial separations in CDMA systems with correlation constrained sets of Hadamard matrices, IEEE Transactions on Information Theory, Vol. 56, No. 11, (November 2010), pp. 5757-5761 (ISSN: 0018-9448) doi: 10.1109/TIT.2010.2070310

^{89} D.H. Smith, N. Aboluion, R. Montemanni and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content, Discrete Mathematics, Vol. 311, (2011), pp. 1207-1219 (ISSN: 0012-365X) doi: 10.1016/j.disc.2010.03.005

^{90} L.A. Phillips, S. Perkins, P.A. Roach and D.H. Smith, Sudoku puzzles as erasure correcting codes, Journal of Recreational Mathematics, Vol. 36, No. 2 (volume date 2007), (published 2011) pp. 83-88. (ISSN 0022-412X).

^{91} D.H. Smith and R. Montemanni, A new table of permutation codes, Designs, Codes and Cryptography, Vol. 63, No. 2, (May 2012), pp. 241-253, (ISSN 0925-1022) doi: 10.1007/s10623-011-9551-8

^{92} N. Aboluion, D.H. Smith and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint, Discrete Mathematics, Vol. 312, (2012), pp. 1062-1075 (ISSN: 0012-365X) doi:10.1016/j.disc.2011.11.021

^{93} D.H. Smith and R. Montemanni, Permutation codes with specified packing radius, Designs, Codes and Cryptography, October 2013, Volume 69, Issue 1, pp 95-106, ISSN 0925-1022 doi: 10.1007/s10623-012-9623-4

^{94} R. Montemanni, D.H. Smith, and N. Koul, Three metaheuristics for the construction of constant GC-content DNA codes, in: Proceedings of the 6th International Conference on Applied Operational Research, Vancouver, Canada, July 2014, Lecture Notes in Management Science (2014) Vol. 6: 167–175 ISSN 2008-0050 (Print), ISSN 1927-0097 (Online) http://www.tadbir.ca/lnms/archive/v6.htm

^{95} R. Montemanni, M. Salani, D.H. Smith, and F. Hunt. A variable neighbourhood search heuristic for the design of codes, Proceedings of the 8th International Conference on Computing and Information Technology (IC2IT 2012), 9-10 May 2012, Pattaya City, Thailand , pp 127-132. ISBN 978-616-7701-01-1

^{96} F.H. Hunt and D.H. Smith, The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions, IEEE Transactions on Wireless Communications, Vol. 11,No. 8, (2012) pp. 2970-2975 (ISSN 1536-1276 )

doi: 10.1109/TWC.2012.062012.111928

^{97} Derek H. Smith and Roberto Montemanni, Some constant weight codes from primitive permutation groups, The Electronic Journal of Combinatorics, 19(4), (2012), #P4 (ISSN: 1077-8926)

^{98} F. H. Hunt and D. H. Smith, The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions, Wireless Personal Communications, Vol. 72(4) (October 2013), pp. 2215-2227

doi: 10.1007/s11277-013-1144-6 Print ISSN 0929-6212 Online ISSN 1572-834X

^{99} F. H. Hunt, S. Perkins and D. H. Smith, Decoding mixed errors and erasures in permutation codes, Designs, Codes and Cryptography, Vol. 74(2) (January 2015) pp. 481-493. doi: 10.1007/s10623-013-9872-x ISSN: 0925-1022 (Print) 1573-7586 (Online)

^{100} D. Tulpan, D.H. Smith and R. Montemanni, Thermodynamic post-processing versus GC-content pre-processing for DNA codes satisfying the Hamming distance and reverse-complement constraints, IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 11, No. 2, March/April 2014, pp. 441-452.

doi:10.1109/TCBB.2014.2299815 ISSN: 1545-5963

^{101} J. Barta, R. Montemanni and D.H. Smith, A branch and bound approach to permutation codes, 2nd International Conference on Information and Communication Technology (ICoICT), 2014, Bandung, Indonesia, pp 187-192.

IEEE catalog number: CFP14ICZ-DVD, ISBN: 978-1-4799-3580-2

^{102} R. Montemanni, J. Barta, and D.H. Smith, Permutation codes: a branch and bound approach, ADVANCES in APPLIED and PURE MATHEMATICS, Proceedings of the 2014 International Conference on Pure Mathematics, Applied Mathematics, Computational Methods (PMAMCM 2014), Santorini Island, Greece,

July 17-21, 2014, pp.86-90. ISSN: 2227-4588 ISBN: 978-1-61804-240-8

^{103} R. Montemanni, J. Barta, and D.H. Smith, Permutation codes: a new upper bound for M(7,5), Proceedings of the 2014 International Conference on Informatics and Advanced Computing (ICIAC), T. Yingthawornsuk and O. Adiguzel eds., International Academy of Engineers (IA-E), pages 1-3, 2014

ISBN: 978-93-84468-12-5.

^{104} J. Barta, R. Montemanni and D.H. Smith, Permutation Codes via Fragmentation of Group Orbits, 3rd International Conference on Information and Communication Technology (ICoICT), 2015, Bali, Indonesia, pp. 38-43.

IEEE catalog number: CFP15ICZ-DVD, ISBN: 978-1-4799-7751-2

^{105} Francis H. Hunt, Stephanie Perkins and Derek H. Smith, Channel models and error correction codes for DNA information storage, Int. J. Information and Coding Theory, Vol. 3, No. 2, 2015, pp. 120-136. DOI: 10.1504/IJICOT.2015.072619

ISSN 1753-7703(print), 1753-7711 (online).

http://www.inderscience.com/offer.php?id=72619

^{106} Derek H. Smith, Developing frequency assignment techniques for British military communication systems, in: UK Success Stories in Industrial Mathematics (eds. P.J. Aston. A.J. Mulholland, K.M.M. Tant) pp. 171-177, Springer International Publishing Switzerland 2016 ISBN 978-3-319-25452-4, ISBN 978-3-319-25454-8 (eBook), DOI 10.1007/978-3-319-25454-8

^{107} Roberto Montemanni, Janos Barta, Derek H. Smith, Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms, in: New Advances in Information Systems and Technologies, Part I, pp 223-232, Springer International Publishing Switzerland 2016, ISBN 978-3-319-31231-6 (print), ISBN 978-3-319-31232-3 (online), DOI 10.1007/978-3-319-31232-3_21

^{108} Janos Barta, Roberto Montemanni and Derek H. Smith, Packing regularity of permutation codes, Proc. ICAOR 2016, Rotterdam, The Netherlands, Lecture Notes in Management Science (2016) Vol. 8, 86–92, ISSN 2008-0050 (Print), ISSN 1927-0097 (Online)

^{109} Dan Tulpan, Roberto Montemanni, Derek H. Smith, Correlations Between Experimentally-determined Melting Temperatures and GC-content for Short DNA Strands, Current Bioinformatics, Vol. 12, Issue 4, 2017 pp. 296-302.

ISSN: 2212-392X (Online), 1574-8936 (Print)

DOI: 10.2174/1574893611666161008194920

http://www.eurekaselect.com/146186

^{110} Derek H. Smith, Stephanie Perkins, Roberto Montemanni, Solving the maximum clique problem with a hybrid algorithm, Int. J. Metaheuristics, Vol. 7, No. 2, 2019, pp. 152-175. ISSN online 1755-2184, ISSN print 1755-2176.

## Memberships

Member of the London Mathematical Society

## External

**External / Professional Representation:**

Member, Council for National Academic Awards Computing Board, 1984-1987. Council for National Academic Awards Specialist Advisor, 1987-1992.

Teaching Quality Assessor, HEFCW.

Member of Technical Working Party (Task Group) on Diffraction, Scatter and Other Terrain Effects, Radiocommunications Agency / Ofcom

Organiser, Wales Mathematics Colloquium, Gregynog Hall, Newtown, May 2010.

## Consultancy

**Consultancy Work**

Multivariate Analysis of Drill Core Data, Irish Base Metals Ltd.

Dynamics of Fast Audio Cassette Systems, ICD Ltd.

Applications of Constant Weight Codes, Zetters Pools Ltd.

Maintenance of Software Design Information for a large Mobile Communication System, Plessey Electronic Systems Ltd.,1983-1988.

Terrain and Clutter Databases for Radio System Planning, Radiocommunication Agency, 1992.

Application of Galois Field Theory and Coding Theory to Error Control on CDROMs, F4i, Bridgend, 2001.

Frequency Assignment Algorithms for a Satellite Communications System, DERA/QinetiQ, Defford, 2001-2004.

## Research

**Main Research Subjects & Current Projects:**

Coding theory

DNA codes http://data.research.southwales.ac.uk/projects/

Graph theory

Methods and algorithms for radio frequency assignment http://data.research.southwales.ac.uk/projects/

CDMA,

Data Compression

Synchronisation strategies for variable length codes .

**Sponsored Research and Research Funding**

Project leader of three projects for the Royal Signals and Radar Establishment, Malvern (1985-1995)

Over the period 1996-2005 some 325,000 pounds of research income was received from the Radiocommunications Agency (6 Projects), EPSRC, BAE SYSTEMS (3 projects) QinetiQ and ComOpt AB.

**Research Student Supervision**

21 PhD and 5MPhil students have been successfully supervised.

Project leader of three projects for the Royal Signals and Radar Establishment (now QinetiQ), Malvern:

Project 1: Spectral Resource Requirements of a Fielded Network, 1985-1988.

Project 2: Digital Terrain Models for Radio Path Loss Calculations, 1987-1990.

A research student was fully funded and obtained a PhD for the work.

Project 3: The Application of Information Theory to Digital Terrain Modelling, 1991-95. This project involved the partial funding of an SERC CASE student who obtained a PhD for the work.

Project Leader of a project “Terrain and Clutter Databases for Radio System Planning” for the

Radiocommunication Agency, 1992.

Joint project leader of six projects on frequency assignment with Cardiff University, 1994-2002. These were supported by the Radiocommunications Agency, who funded the appointment of several Postdoctoral Research Assistants.

Principal Investigator of an EPSRC funded research project 1997-99,

Tractability in Constraint Satisfaction Problems with Applications to Frequency Assignment.

A Postdoctoral Research Assistant was funded.

Project leader of three projects on Radio Frequency Assignment 1998-2000 funded by ComOpt AB.

New Frequency Assignment Techniques, BAe, 1998-1999.

Applications of Coding Theory to the Design of Frequency Hopping Lists, EPSRC, 2001-2002.

Frequency Assignment Methods for Frequency Hoppers and CDMA: Application of Finite Field and Coding Theory,

BAE SYSTEMS, two projects 2002-2003.

Definition of a Common Formulation for Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms, QinetiQ, Defford, Sept 01 – Sept 04. A research student was fully funded and obtained a PhD for the work.

Enumeration of Code Classes for Quasi-Synchronous CDMA , EPSRC CASE studentship in collaboration

with BAE SYSTEMS, 2004-2007.

**If you are a journalist on deadline and you need to speak with** a member of university staff with particular expertise, please contact the Press Office.