[WH12]	Q. Wu, J.-K. Hao (2012). Coloring large graphs based on independent set extraction. Computers & Operations Research, vol. 39, no. 2, pp. 283 - 290. [ bib | DOI ]
[GHZ08]	P. Galinier, A. Hertz, N. Zufferey (2008). An adaptive memory algorithm for the k-coloring problem. Discrete Applied Mathematics, vol. 156, no. 2, pp. 267-279. [ bib | DOI ]
[DS03]	L. Di Gaspero, A. Schaerf (2003). EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software - Practice & Experience, vol. 33, no. 8, pp. 733-765. [ bib ]
[BZ03]	I. Blöchliger, N. Zufferey (2003). A Reactive Tabu Search Using Partial Solutions for the Graph Coloring Problem. In D. Kral, J. Sgall (eds.), Coloring graphs from lists with bounded size of their union: result from Dagstuhl Seminar 03391, vol. 156 of ITI-Series. Department of Applied Mathematics and Institute for Theoretical Computer Science, Prague. [ bib ]
[CDS03]	M. Chiarandini, I. Dumitrescu, T. Stützle (2003). Local Search for the Graph Colouring Problem. A Computational Study. Tech. Rep. AIDA-03-01, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]
[CS02]	M. Chiarandini, T. Stützle (2002). An application of Iterated Local Search to Graph Coloring. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 112-125. Ithaca, New York, USA. [ bib | .pdf ]
[PS02]	L. Paquete, T. Stützle (2002). An Experimental Investigation of Iterated Local Search for Coloring Graphs. In S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G. Raidl (eds.), Applications of Evolutionary Computing, vol. 2279 of Lecture Notes in Computer Science, pp. 122-131. Springer Verlag, Berlin, Germany. [ bib ]
[Wal01]	C. Walshaw (2001). A Multilevel Approach to the Graph Colouring Problem. Tech. Rep. 01/IM/69, School of Computing and Mathematical Science, Univeristy of Greenwich, London, UK. [ bib ]
[FH00]	N. Funabiki, T. Higashino (2000). A minimal-state processing search algorithm for graph coloring problems. IEICE Transactions on Fundamentals, vol. E83-A, no. 7, pp. 1420-1430. [ bib ]
[KP98]	D. Kirovski, M. Potkonjak (1998). Efficient coloring of a large spectrum of graphs. In DAC '98: Proceedings of the 35th annual conference on Design automation, pp. 427-432. ACM Press, New York, NY, USA. ISBN 0-89791-964-5. [ bib | DOI ]
[FF96]	C. Fleurent, J. Ferland (1996). Object-oriented implementation of heuristics search methods for Graph Coloring, Maximum Clique, and Satisfiability. vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 619-652. American Mathematical Society, Providence, RI, USA. [ bib ]
[LC96]	G. Lewandowski, A. Condon (1996). Experiments with parallel graph coloring heuristics and applications of graph coloring. vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 309-334. American Mathematical Society, Providence, RI, USA. [ bib ]
[Jag96]	A. Jagota (1996). An adaptive, multiple restarts neural network algorithm for graph coloring. European Journal of Operational Research, vol. 93, no. 2, pp. 257-270. [ bib ]
[Cul92]	J. Culberson (1992). Iterated Greedy Graph Coloring and the Difficulty Landscape. Tech. Rep. 92-07, Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada. [ bib ]