| [9] | Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem (I Juhos, J van Hemert), Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C Cotta, J van Hemert, eds.), Springer, 2008.
[bib] |
| [8] | Graph Colouring Heuristics Guided by Higher Order Graph Properties (I Juhos, J van Hemert), In Evol Comput in Comb Optim (J van Hemert, C Cotta, eds.), Springer, volume 4972, 2008.
[bib] |
| [7] | Increasing the efficiency of graph colouring algorithms with a representation based on vector operations (I Juhos, J van Hemert), In Journal of Software, volume 1, 2006.
[bib] |
| [6] | Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation (I Juhos, J van Hemert), In Evol Comput in Comb Optim (J Gottlieb, G Raidl, eds.), Springer, volume 3906, 2006.
[bib] |
| [5] | Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring (I Juhos, A Tóth, J van Hemert), In Evol Comput in Comb Optim (G Raidl, J Gottlieb, eds.), Springer, volume 3448, 2005.
[bib] |
| [4] | Binary Merge Model Representation of the Graph Colouring Problem (I Juhos, A Tóth, J van Hemert), In Evol Comput in Comb Optim (J Gottlieb, G Raidl, eds.), Springer, 2004.
[bib] |
| [3] | A new permutation model for solving the graph k-coloring problem (I Juhos, A Tóth, M Tezuka, P Tann, J van Hemert), In Kalmàr Workshop on Logic and Computer Science, 2003.
[bib] |
| [2] | Graph Coloring with Adaptive Evolutionary Algorithms (AE Eiben, JK van der Hauw, J van Hemert), In Journal of Heuristics, Kluwer Academic Publishers, volume 4, 1998.
[bib] |
| [1] | Comparison of the SAW-ing Evolutionary Algorithm and the Grouping Genetic Algorithm for Graph Coloring (J van Hemert, AE Eiben), Technical report, Leiden University, 1997.
[bib] |