J.  Rius, Cores, F., Solsona, F., van Hemert, J. I., Koetsier, J., and Notredame, C., ?A user-friendly web portal for T-Coffee on supercomputers?, BMC Bioinformatics, vol. 12, 2011.

R. R.  Kitchen, Sabine, V. S., Sims, A. H., Macaskill, E. J., Renshaw, L., Thomas, J. S., van Hemert, J. I., Dixon, J. M., and Bartlett, J. M. S., ?Correcting for intra-experiment variation in Illumina BeadChip data is necessary to generate robust gene-expression profiles?, BMC Genomics, vol. 11, no. 134, 2010.

A.  Barker, Weissman, J., and van Hemert, J. I., ?The Circulate Architecture: Avoiding Workflow Bottlenecks Caused By Centralised Orchestration?, Cluster Computing, vol. 12, p. 221--235, 2009.

J. I.  van Hemert and la Poutré, J. A., ?Exploiting Fruitful Regions in Dynamic Routing using Evolutionary Computation?, in Studies in Computational Intelligence , vol. 161, F.  Pereira Babtista and Tavares, J., Eds. Springer, 2009, p. 131--149.

J. I.  van Hemert and Koetsier, J., ?Giving Computational Science a Friendly Face?, Zero-In, vol. 1, no. 3, p. 12--13, 2009.

S.  Gesing, Kohlbacher, O., and van Hemert, J. I., ?Portals for Life Sciences?a Brief Introduction?, in Proceedings of the IWPLS09 International Workshop on Portals for Life Sciences, 2009.

J.  Koetsier, Turner, A., Richardson, P., and van Hemert, J. I., ?Rapid chemistry portals through engaging researchers?, in Fifth IEEE International Conference on e-Science, Oxford, UK, 2009, pp. 284-291.

J.  Koetsier and van Hemert, J. I., ?Rapid development of computational science portals?, in Proceedings of the IWPLS09 International Workshop on Portals for Life Sciences, Edinburgh, 2009.

J. D.  Armstrong and van Hemert, J. I., ?Towards a Virtual Fly Brain?, Philosophical Transactions A, vol. 367, p. 2387--2397, 2009.

J.  O?Donoghue and van Hemert, J. I., ?Using the DCC Lifecycle Model to Curate a Gene Expression Database: A Case Study?, International Journal of Digital Curation, vol. 4, no. 3, 2009.

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 and Baldock, R. A., ?Matching Spatial Regions with Combinations of Interacting Gene Expression Patterns?, in Communications in Computer and Information Science, 2008, p. 347--361.

J. I.  van Hemert and Baldock, R. A., ?Mining spatial gene expression data for association rules?, in Lecture Notes in Bioinformatics, 2007, p. 66--76.

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

I.  Juhos and van Hemert, J. I., ?Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation?, in Springer Lecture Notes on Computer Science, 2006, p. 123--134.

I.  Juhos and van Hemert, J. I., ?Increasing the efficiency of graph colouring algorithms with a representation based on vector operations?, Journal of Software, vol. 1, p. 24--33, 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.

A.  Defaweux, Lenaerts, T., van Hemert, J. I., and Parent, J., ?Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population?, in Proceedings of the Congress on Evolutionary Computation, 2005, p. 196--203.

A.  Defaweux, Lenaerts, T., and van Hemert, J. I., ?Evolutionary Transitions as a Metaphor for Evolutionary Optimization?, in LNAI 3630, 2005, p. 342--352.

I.  Juhos, Tóth, A., and van Hemert, J. I., ?Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring?, in Springer Lecture Notes on Computer Science, 2005, p. 132--143.

J. I.  van Hemert, ?Property analysis of symmetric travelling salesman problem instances acquired through evolution?, in Springer Lecture Notes on Computer Science, 2005, p. 122--131.

A.  Defaweux, Lenaerts, T., van Hemert, J. I., and Parent, J., ?Transition Models as an incremental approach for problem solving in Evolutionary Algorithms?, in Proceedings of the Genetic and Evolutionary Computation Conference, 2005, p. 599--606.

I.  Juhos, Tóth, A., and van Hemert, J. I., ?Binary Merge Model Representation of the Graph Colouring Problem?, in Springer Lecture Notes on Computer Science, 2004, p. 124--134.

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.

B. G. W.  Craenen, Eiben, A. E., and van Hemert, J. I., ?Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems?, IEEE Transactions on Evolutionary Computation, vol. 7, p. 424--444, 2003.

J. I.  van Hemert, ?Evolving binary constraint satisfaction problem instances that are difficult to solve?, in Proceedings of the IEEE 2003 Congress on Evolutionary Computation, 2003, p. 1267--1273.

I.  Juhos, Tóth, A., Tezuka, M., Tann, P., and van Hemert, J. I., ?A new permutation model for solving the graph k-coloring problem?, in Kalmàr Workshop on Logic and Computer Science, 2003, p. 189--199.

J. I.  van Hemert, ?Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation?, in Springer Lecture Notes on Computer Science, 2002, p. 81--90.

J. I.  van Hemert and Bäck, T., ?Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction?, in Springer Lecture Notes on Computer Science, 2002, p. 23--32.

R.  Grim, Jansen, M. L. M., Baan, A., van Hemert, J. I., and de Wolf, H., ?Use of Evolutionary Algorithms for Telescope Scheduling?, in Integrated Modeling of Telescopes, 2002, vol. 4757, p. 51--61.

J.  Eggermont and van Hemert, J. I., ?Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems?, in Springer Lecture Notes on Computer Science, 2001, p. 23--35.

J. I.  van Hemert and Jansen, M. L. M., ?An Engineering Approach to Evolutionary Art?, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), 2001, p. 177.

J. I.  van Hemert, ?Evolutionary Computation in Constraint Satisfaction and Machine Learning --- An abstract of my PhD.?, in Proceedings of the Brussels Evolutionary Algorithms Day (BEAD-2001), 2001.

J. I.  van Hemert, Van Hoyweghen, C., Lukschandl, E., and Verbeeck, K., ?A ``Futurist'' approach to dynamic environments?, in Proceedings of the Workshops at the Genetic and Evolutionary Computation Conference, Dynamic Optimization Problems, 2001, p. 35--38.

J. I.  van Hemert, ?Constraint Satisfaction Problems and Evolutionary Algorithms: A Reality Check?, in Proceedings of the Twelfth Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'00), 2000, p. 267--274.

J. I.  van Hemert, ?De Creatieve Computer?, AIgg Kennisgeving, vol. 13, p. 10--18, 2000.

J.  Eggermont and van Hemert, J. I., ?Stepwise Adaptation of Weights for Symbolic Regression with Genetic Programming?, in Proceedings of the Twelfth Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'00), 2000, p. 259--266.

J.  Eggermont, Eiben, A. E., and van Hemert, J. I., ?Adapting the Fitness Function in GP for Data Mining?, in Springer Lecture Notes on Computer Science, 1999, p. 195--204.

J.  Eggermont, Eiben, A. E., and van Hemert, J. I., ?Comparing genetic programming variants for data classification?, in Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99), 1999, p. 253--254.

J.  Eggermont, Eiben, A. E., and van Hemert, J. I., ?A comparison of genetic programming variants for data classification?, in Springer Lecture Notes on Computer Science, 1999, p. 281--290.

J. I.  van Hemert and Eiben, A. E., ?Mondriaan Art by Evolution?, in Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99), 1999, p. 291--292.

A. E.  Eiben, Elia, D., and van Hemert, J. I., ?Population dynamics and emerging features in AEGIS?, in Proceedings of the Genetic and Evolutionary Computation Conference, 1999, p. 1257--1264.

A. E.  Eiben and van Hemert, J. I., ?SAW-ing EAs: adapting the fitness function for solving constrained problems?, in New ideas in optimization, D.  Corne, Dorigo, M., and Glover, F., Eds. McGraw-Hill, London, 1999, p. 389--402.

A. E.  Eiben, van Hemert, J. I., Marchiori, E., and Steenbeek, A. G., ?Extended abstract: Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function?, in Proceedings of the Xth Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98), 1998, p. 299--301.

A. E.  Eiben, van der Hauw, J. K., and van Hemert, J. I., ?Graph Coloring with Adaptive Evolutionary Algorithms?, Journal of Heuristics, vol. 4, p. 25--46, 1998.

A. E.  Eiben, van Hemert, J. I., Marchiori, E., and Steenbeek, A. G., ?Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function?, in Springer Lecture Notes on Computer Science, 1998, p. 196--205.