Derek H. Smith

Orcid: 0000-0002-8128-2067

According to our database1, Derek H. Smith authored at least 55 papers between 1974 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Solving the Set Orienteering Problem.
Symmetry, March, 2024

2023
The missing Moore graph as an optimization problem.
EURO J. Comput. Optim., January, 2023

2022
Upper and lower bounds based on linear programming for the b-coloring problem.
EURO J. Comput. Optim., 2022

2020
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm.
Algorithms, 2020

2019
Solving the maximum clique problem with a hybrid algorithm.
Int. J. Metaheuristics, 2019

2018
Wavelet spectra and filtering of tropical cyclone forecast errors.
Int. J. Wavelets Multiresolution Inf. Process., 2018

2016
Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms.
Proceedings of the New Advances in Information Systems and Technologies, 2016

2015
Channel models and error correction codes for DNA information storage.
Int. J. Inf. Coding Theory, 2015

Decoding mixed errors and erasures in permutation codes.
Des. Codes Cryptogr., 2015

IIS you is my digital baby: an intimate interface system for persons with disabilities.
Proceedings of the 41st Graphics Interface Conference, Halifax, NS, Canada, June 3-5, 2015, 2015

2014
Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

2013
The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions.
Wirel. Pers. Commun., 2013

Permutation codes with specified packing radius.
Des. Codes Cryptogr., 2013

2012
The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions.
IEEE Trans. Wirel. Commun., 2012

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., 2012

A new table of permutation codes.
Des. Codes Cryptogr., 2012

Some Constant Weight Codes from Primitive Permutation Groups.
Electron. J. Comb., 2012

2011
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content.
Discret. Math., 2011

2010
The Application of Frequency Assignment Techniques in Spreading Code Assignment.
Wirel. Pers. Commun., 2010

Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices.
IEEE Trans. Inf. Theory, 2010

Heuristic manipulation, tabu search and frequency assignment.
Comput. Oper. Res., 2010

2009
Heuristic algorithms for constructing binary constant weight codes.
IEEE Trans. Inf. Theory, 2009

The Construction of Variable Length Codes With Good Synchronization Properties.
IEEE Trans. Inf. Theory, 2009

Sequential ordering problems for crane scheduling in port terminals.
Int. J. Simul. Process. Model., 2009

Gold codes, Hadamard partitions and the security of CDMA systems.
Des. Codes Cryptogr., 2009

2008
Frequency assignment, multiple interference and binary constraints.
Wirel. Networks, 2008

Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm.
J. Math. Model. Algorithms, 2008

Cyclically permutable representations of cyclic codes.
Discret. Appl. Math., 2008

A heuristic manipulation technique for the sequential ordering problem.
Comput. Oper. Res., 2008

2007
Measuring the Effectiveness of Frequency Assignment Algorithms.
IEEE Trans. Veh. Technol., 2007

Ant Colony Systems for Large Sequential Ordering Problems.
Proceedings of the 2007 IEEE Swarm Intelligence Symposium, 2007

2006
On an upper bound for mixed error-correcting codes.
IEEE Trans. Inf. Theory, 2006

A New Table of Constant Weight Codes of Length Greater than 28.
Electron. J. Comb., 2006

2005
Assignment of frequency lists in frequency hopping networks.
IEEE Trans. Veh. Technol., 2005

Robust Data Compression: Variable Length Codes and Burst Errors.
Comput. J., 2005

2004
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem.
Eur. J. Oper. Res., 2004

Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes.
Comput. J., 2004

2003
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem.
IEEE Trans. Veh. Technol., 2003

2002
An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference.
IEEE Trans. Veh. Technol., 2002

Generation of lower bounds for minimum span frequency assignment.
Discret. Appl. Math., 2002

2001
Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem.
Ann. Oper. Res., 2001

Lower Bounds for Fixed Spectrum Frequency Assignment.
Ann. Oper. Res., 2001

Channel Loading in Private Mobile Radio Networks.
Ann. Oper. Res., 2001

2000
A new lower bound for the channel assignment problem.
IEEE Trans. Veh. Technol., 2000

A scheme for the synchronization of variable length codes.
Discret. Appl. Math., 2000

1999
Lower bounding techniques for frequency assignment.
Discret. Math., 1999

1998
Improving heuristics for the frequency assignment problem.
Eur. J. Oper. Res., 1998

A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment.
Proceedings of the Parallel Problem Solving from Nature, 1998

1997
Bounds for the frequency assignment problem.
Discret. Math., 1997

1996
A comparison of local search algorithms for radio link frequency assignment problems.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1993
Optimally Reliable Graphs for Both Vertex and Edge Failures.
Comb. Probab. Comput., 1993

1991
Optimally reliable networks.
Ann. Oper. Res., 1991

1990
On the construction of optimally reliable graphs.
Networks, 1990

1976
An improved version of Lloyd's theorem.
Discret. Math., 1976

1974
On bipartite tetravalent graphs.
Discret. Math., 1974


  Loading...