I.  Juhos and van Hemert, J. I., ?Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem?, in Studies in Computational Intelligence, C.  Cotta and van Hemert, J. I., Eds. Springer, 2008, p. 167--184.

J. I.  van Hemert, ?Evolving combinatorial problem instances that are difficult to solve?, Evolutionary Computation, vol. 14, p. 433--462, 2006.

M.  Gruber, van Hemert, J. I., and Raidl, G. R., ?Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO?, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), Seattle, USA, 2006, vol. 2, p. 1187--1194.

J. I.  van Hemert and la Poutré, J. A., ?Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation?, in LNCS, Birmingham, UK, 2004, vol. 3242, p. 690--699.

J. I.  van Hemert and Urquhart, N. B., ?Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation?, in LNCS, Birmingham, UK, 2004, vol. 3242, p. 150--159.

J. I.  van Hemert and Bäck, T., ?Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems?, Journal of Heuristics, vol. 10, p. 629--640, 2004.

J. I.  van Hemert and Solnon, C., ?A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems?, in Springer Lecture Notes on Computer Science, 2004, p. 114--123.