default search action
Derek H. Smith
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j50]Roberto Montemanni
, Derek H. Smith
On Solving the Set Orienteering Problem. Symmetry 16(3): 340 (2024) - 2023
- [j49]Derek H. Smith
The missing Moore graph as an optimization problem. EURO J. Comput. Optim. 11: 100060 (2023) - 2022
- [j48]Roberto Montemanni
Upper and lower bounds based on linear programming for the b-coloring problem. EURO J. Comput. Optim. 10: 100049 (2022) - 2020
- [j47]Derek H. Smith
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm. Algorithms 13(10): 253 (2020)
2010 – 2019
- 2019
- [j46]Derek H. Smith
Solving the maximum clique problem with a hybrid algorithm. Int. J. Metaheuristics 7(2): 152-175 (2019) - 2018
- [j45]D. H. Smith:
Wavelet spectra and filtering of tropical cyclone forecast errors. Int. J. Wavelets Multiresolution Inf. Process. 16(3): 1850011:1-1850011:28 (2018) - 2016
- [c5]Roberto Montemanni
Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms. WorldCIST (1) 2016: 223-232 - 2015
- [j44]Francis H. Hunt, Stephanie Perkins
Decoding mixed errors and erasures in permutation codes. Des. Codes Cryptogr. 74(2): 481-493 (2015) - [j43]Francis H. Hunt, Stephanie Perkins
Channel models and error correction codes for DNA information storage. Int. J. Inf. Coding Theory 3(2): 120-136 (2015) - [c4]Deborah I. Fels, D. H. Smith, R. Baffa da Silva, Diana Aybar, Margot Whitfield:
IIS you is my digital baby: an intimate interface system for persons with disabilities. Graphics Interface 2015: 171-178 - 2014
- [j42]Dan Tulpan
Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 441-452 (2014) - 2013
- [j41]Derek H. Smith
Permutation codes with specified packing radius. Des. Codes Cryptogr. 69(1): 95-106 (2013) - [j40]Francis H. Hunt, Derek H. Smith
The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions. Wirel. Pers. Commun. 72(4): 2215-2227 (2013) - 2012
- [j39]Derek H. Smith
Some Constant Weight Codes from Primitive Permutation Groups. Electron. J. Comb. 19(4): 4 (2012) - [j38]Derek H. Smith
A new table of permutation codes. Des. Codes Cryptogr. 63(2): 241-253 (2012) - [j37]Niema Aboluion, Derek H. Smith
Linear and nonlinear constructions of DNA codes with Hamming distance 1-s2.0-S0012365X11005280-si18, constant GC-content and a reverse-complement constraint. Discret. Math. 312(5): 1062-1075 (2012) - [j36]Francis H. Hunt, Derek H. Smith
The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions. IEEE Trans. Wirel. Commun. 11(8): 2970-2975 (2012) - 2011
- [j35]Derek H. Smith
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. Discret. Math. 311(13): 1207-1219 (2011) - 2010
- [j34]Roberto Montemanni
Heuristic manipulation, tabu search and frequency assignment. Comput. Oper. Res. 37(3): 543-551 (2010) - [j33]Derek H. Smith
Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices. IEEE Trans. Inf. Theory 56(11): 5757-5761 (2010) - [j32]S. O. Sanusi, Derek H. Smith
The Application of Frequency Assignment Techniques in Spreading Code Assignment. Wirel. Pers. Commun. 54(3): 397-415 (2010)
2000 – 2009
- 2009
- [j31]Derek H. Smith
Gold codes, Hadamard partitions and the security of CDMA systems. Des. Codes Cryptogr. 51(3): 231-243 (2009) - [j30]Roberto Montemanni
Sequential ordering problems for crane scheduling in port terminals. Int. J. Simul. Process. Model. 5(4): 348-361 (2009) - [j29]M. B. J. Higgs, Stephanie Perkins
The Construction of Variable Length Codes With Good Synchronization Properties. IEEE Trans. Inf. Theory 55(4): 1696-1700 (2009) - [j28]Roberto Montemanni
Heuristic algorithms for constructing binary constant weight codes. IEEE Trans. Inf. Theory 55(10): 4651-4656 (2009) - 2008
- [j27]Roberto Montemanni
A heuristic manipulation technique for the sequential ordering problem. Comput. Oper. Res. 35(12): 3931-3944 (2008) - [j26]Derek H. Smith
Cyclically permutable representations of cyclic codes. Discret. Appl. Math. 156(1): 76-81 (2008) - [j25]Roberto Montemanni
Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. J. Math. Model. Algorithms 7(3): 311-326 (2008) - [j24]J. S. Graham, Roberto Montemanni
Frequency assignment, multiple interference and binary constraints. Wirel. Networks 14(4): 449-464 (2008) - 2007
- [j23]Derek H. Smith, Lesley A. Hughes
Measuring the Effectiveness of Frequency Assignment Algorithms. IEEE Trans. Veh. Technol. 56(1): 331-341 (2007) - [c3]Roberto Montemanni
Ant Colony Systems for Large Sequential Ordering Problems. SIS 2007: 60-67 - 2006
- [j22]Derek H. Smith, Lesley A. Hughes, Stephanie Perkins:
A New Table of Constant Weight Codes of Length Greater than 28. Electron. J. Comb. 13(1) (2006) - [j21]Stephanie Perkins
On an upper bound for mixed error-correcting codes. IEEE Trans. Inf. Theory 52(2): 708-712 (2006) - 2005
- [j20]Stephanie Perkins
Robust Data Compression: Variable Length Codes and Burst Errors. Comput. J. 48(3): 315-322 (2005) - [j19]Jim N. J. Moon, Lesley A. Hughes
Assignment of frequency lists in frequency hopping networks. IEEE Trans. Veh. Technol. 54(3): 1147-1159 (2005) - 2004
- [j18]Stephanie Perkins, Derek H. Smith, Alan Ryley:
Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes. Comput. J. 47(3): 309-319 (2004) - [j17]Roberto Montemanni
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. Eur. J. Oper. Res. 156(3): 736-751 (2004) - 2003
- [j16]Roberto Montemanni
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem. IEEE Trans. Veh. Technol. 52(4): 891-901 (2003) - 2002
- [j15]Stuart M. Allen
Generation of lower bounds for minimum span frequency assignment. Discret. Appl. Math. 119(1-2): 59-78 (2002) - [j14]Roberto Montemanni
An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. IEEE Trans. Veh. Technol. 51(5): 949-953 (2002) - 2001
- [j13]Steve Hurley, Roger M. Whitaker, Derek H. Smith:
Channel Loading in Private Mobile Radio Networks. Ann. Oper. Res. 107(1-4): 211-224 (2001) - [j12]Roberto Montemanni
Lower Bounds for Fixed Spectrum Frequency Assignment. Ann. Oper. Res. 107(1-4): 237-250 (2001) - [j11]D. H. Smith, Stuart M. Allen
Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem. Ann. Oper. Res. 107(1-4): 285-301 (2001) - 2000
- [j10]Stephanie Perkins
A scheme for the synchronization of variable length codes. Discret. Appl. Math. 101(1-3): 231-245 (2000) - [j9]Derek H. Smith, Stephen Hurley, Stuart M. Allen
A new lower bound for the channel assignment problem. IEEE Trans. Veh. Technol. 49(4): 1265-1272 (2000)
1990 – 1999
- 1999
- [j8]Stuart M. Allen, D. H. Smith, Steve Hurley:
Lower bounding techniques for frequency assignment. Discret. Math. 197-198: 41-52 (1999) - 1998
- [j7]Derek H. Smith, Steve Hurley, S. U. Thiel:
Improving heuristics for the frequency assignment problem. Eur. J. Oper. Res. 107(1): 76-86 (1998) - [c2]Christine L. Valenzuela, Steve Hurley, Derek H. Smith:
A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment. PPSN 1998: 907-916 - 1997
- [j6]D. H. Smith, Steve Hurley:
Bounds for the frequency assignment problem. Discret. Math. 167-168: 571-582 (1997) - 1996
- [c1]Steve Hurley, S. U. Thiel, D. H. Smith:
A comparison of local search algorithms for radio link frequency assignment problems. SAC 1996: 251-257 - 1993
- [j5]D. H. Smith:
Optimally Reliable Graphs for Both Vertex and Edge Failures. Comb. Probab. Comput. 2: 93-100 (1993) - 1991
- [j4]D. H. Smith:
Optimally reliable networks. Ann. Oper. Res. 33(2): 107-112 (1991) - 1990
- [j3]Derek H. Smith, Lynne L. Doty:
On the construction of optimally reliable graphs. Networks 20(6): 723-729 (1990)
1970 – 1979
- 1976
- [j2]D. H. Smith:
An improved version of Lloyd's theorem. Discret. Math. 15(2): 175-184 (1976) - 1974
- [j1]D. H. Smith:
On bipartite tetravalent graphs. Discret. Math. 10(1): 167-172 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: