Derek H. Smith

1.7k total citations
85 papers, 1.1k citations indexed

About

Derek H. Smith is a scholar working on Electrical and Electronic Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Derek H. Smith has authored 85 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Electrical and Electronic Engineering, 29 papers in Computer Networks and Communications and 27 papers in Artificial Intelligence. Recurrent topics in Derek H. Smith's work include graph theory and CDMA systems (24 papers), Coding theory and cryptography (19 papers) and Vehicle Routing Optimization Methods (18 papers). Derek H. Smith is often cited by papers focused on graph theory and CDMA systems (24 papers), Coding theory and cryptography (19 papers) and Vehicle Routing Optimization Methods (18 papers). Derek H. Smith collaborates with scholars based in United Kingdom, Switzerland and Italy. Derek H. Smith's co-authors include Roberto Montemanni, S. Hurley, S. Thiel, Stuart M. Allen, Luca Maria Gambardella, N. L. Biggs, Lesley Hughes, David B. Kidner, Peter Hammond and Andrea Emilio Rizzoli and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and European Journal of Operational Research.

In The Last Decade

Derek H. Smith

77 papers receiving 1.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Derek H. Smith United Kingdom	19	516	407	364	255	252	85	1.1k
Lester R. Ford United States	5	83 0.2×	136 0.3×	79 0.2×	175 0.7×	112 0.4×	9	675
Reinhardt Euler France	13	145 0.3×	246 0.6×	93 0.3×	79 0.3×	68 0.3×	58	527
Sukhamay Kundu United States	10	71 0.1×	113 0.3×	122 0.3×	205 0.8×	18 0.1×	48	553
Gabriele Di Stefano Italy	17	127 0.2×	433 1.1×	39 0.1×	182 0.7×	147 0.6×	80	753
Hans Schumacher Netherlands	7	99 0.2×	143 0.4×	54 0.1×	241 0.9×	15 0.1×	18	1.0k
Bettina Klinz Austria	11	59 0.1×	130 0.3×	42 0.1×	177 0.7×	146 0.6×	33	516
Péter Kovács Hungary	8	77 0.1×	102 0.3×	28 0.1×	102 0.4×	68 0.3×	19	552
Luitpold Babel Germany	13	34 0.1×	136 0.3×	64 0.2×	184 0.7×	122 0.5×	27	484
Sergio Cabello Slovenia	18	35 0.1×	116 0.3×	86 0.2×	382 1.5×	44 0.2×	75	762
Yi Zhao United States	15	239 0.5×	219 0.5×	48 0.1×	252 1.0×	17 0.1×	81	702

Countries citing papers authored by Derek H. Smith

Since Specialization

Citations

This map shows the geographic impact of Derek H. Smith's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Derek H. Smith with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Derek H. Smith more than expected).

Fields of papers citing papers by Derek H. Smith

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Derek H. Smith. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Derek H. Smith. The network helps show where Derek H. Smith may publish in the future.

Co-authorship network of co-authors of Derek H. Smith

This figure shows the co-authorship network connecting the top 25 collaborators of Derek H. Smith. A scholar is included among the top collaborators of Derek H. Smith based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Derek H. Smith. Derek H. Smith is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Montemanni, Roberto & Derek H. Smith. (2025). Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem. Computers & Operations Research. 178. 107010–107010. 1 indexed citations

Montemanni, Roberto & Derek H. Smith. (2025). On Solving the Maximum Flow Problem with Conflict Constraints. IRIS UNIMORE (University of Modena and Reggio Emilia). 69–74.

Montemanni, Roberto & Derek H. Smith. (2024). A model-based algorithm for the Probabilistic Orienteering Problem. Computers & Operations Research. 176. 106947–106947. 1 indexed citations

Montemanni, Roberto & Derek H. Smith. (2024). A Compact Model for the Clustered Orienteering Problem. SHILAP Revista de lepidopterología. 8(2). 48–48.

Montemanni, Roberto & Derek H. Smith. (2024). On Solving the Set Orienteering Problem. Symmetry. 16(3). 340–340. 1 indexed citations

Smith, Derek H., et al.. (2019). Solving the maximum clique problem with a hybrid algorithm. 7(2). 152–152. 2 indexed citations

Smith, Derek H., et al.. (2011). Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint. Discrete Mathematics. 312(5). 1062–1075. 29 indexed citations

Smith, Derek H., et al.. (2010). Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. Discrete Mathematics. 311(13). 1207–1219. 14 indexed citations

Smith, Derek H., et al.. (2009). The Application of Frequency Assignment Techniques in Spreading Code Assignment. Wireless Personal Communications. 54(3). 397–415. 2 indexed citations

10.

Montemanni, Roberto & Derek H. Smith. (2008). Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. Journal of Mathematical Modelling and Algorithms. 7(3). 311–326. 15 indexed citations

11.

Hughes, Lesley, et al.. (2005). Assignment of Frequency Lists in Frequency Hopping Networks. IEEE Transactions on Vehicular Technology. 54(3). 1147–1159. 23 indexed citations

12.

Shiple, Thomas R., et al.. (2003). Area evaluation metrics for transistor placement. 1. 428–433. 2 indexed citations

13.

Allen, Stuart M., Derek H. Smith, & S. Hurley. (2002). Generation of lower bounds for minimum span frequency assignment. Discrete Applied Mathematics. 119(1-2). 59–78. 6 indexed citations

14.

Allen, Stuart M., Derek H. Smith, & S. Hurley. (1999). Lower bounding techniques for frequency assignment. Discrete Mathematics. 197-198. 41–52. 6 indexed citations

15.

Smith, Derek H. & S. Hurley. (1997). Bounds for the frequency assignment problem. Discrete Mathematics. 167-168. 571–582. 34 indexed citations

16.

Smith, Derek H. & M. H. Lewis. (1994). Optimal predictors for compression of digital elevation models. Computers & Geosciences. 20(7-8). 1137–1141. 3 indexed citations

17.

Smith, Derek H.. (1985). Bin Packing with Adaptive Search. international conference on Genetic algorithms. 202–207. 79 indexed citations

18.

Smith, Derek H.. (1976). An improved version of Lloyd's theorem. Discrete Mathematics. 15(2). 175–184. 5 indexed citations

19.

Hammond, Peter & Derek H. Smith. (1975). Perfect codes in the graphs Ok. Journal of Combinatorial Theory Series B. 19(3). 239–255. 24 indexed citations

20.

Smith, Derek H.. (1974). Bounding the diameter of a distance-transitive graph. Journal of Combinatorial Theory Series B. 16(2). 139–144. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact