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