construction.bib

@comment{{This file has been generated by bib2bib 1.97}}

@comment{{Command line: /usr/bin/bib2bib --expand -ob construction.bib -oc construction-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "construction heuristics"'}}

@article{Chait04,
  title = {Register allocation and spilling via graph coloring},
  author = {Gregory Chaitin},
  journal = {SIGPLAN Not.},
  year = {2004},
  number = {4},
  pages = {66--74},
  volume = {39},
  address = {New York, NY, USA},
  doi = {http://doi.acm.org/10.1145/989393.989403},
  issn = {0362-1340},
  keywords = {graph coloring problem, construction heuristics},
  publisher = {ACM Press}
}

@inproceedings{Chiarandini2011a,
  title = {Efficiency issues in the {RLF} heuristic for graph coloring},
  author = {Marco Chiarandini and Giulia Galbiati and Stefano Gualandi},
  booktitle = {Proceedings of the 9th Metaheuristics International Conference, MIC 2011},
  year = {2011},
  address = {Udine, Italy},
  editor = {Luca Di Gaspero and Andrea Schaerf and Thomas St\"utzle},
  note = {source code available at \url{http://www.imada.sdu.dk/~marco/gcp/rlf}},
  pages = {461--469},
  publisher = {Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Universit\`a di Udine},
  isbn = {978-88-90084-3-7},
  keywords = {graph coloring problem, construction heuristics},
  owner = {marco},
  timestamp = {2011.07.15},
  url = {Files/MIC2011-ChiGalGua.pdf}
}

@inproceedings{Chiarandini2010f,
  title = {An Analysis of Heuristics for Vertex Colouring},
  author = {Chiarandini, Marco and St{\"u}tzle, Thomas},
  booktitle = {Experimental Algorithms, Proceedings of the 9th International Symposium, (SEA 2010)},
  year = {2010},
  editor = {Paola Festa},
  month = {May},
  note = {Supplementary material and source code available at \url{http://www.imada.sdu.dk/~marco/gcp-study/}},
  pages = {326--337},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {6049},
  abstract = {Several heuristics have been presented in the literature for finding a proper colouring of the vertices of a graph using the least number of colours. These heuristics are commonly compared on a set of graphs that served two DIMACS competitions. This set does not permit the statistical study of relations between algorithm performance and structural features of graphs. We generate a new set of random graphs controlling their structural features and advance the knowledge of heuristics for graph colouring. We maintain and make all algorithms described here publically available in order to facilitate future comparisons.},
  doi = {10.1007/978-3-642-13193-6_28},
  keywords = {Chiarandini, graph coloring problem, simple metaheuristics, construction heuristics},
  location = {Ischia Island, Naples, Italy, May 2010},
  owner = {marco},
  timestamp = {2010.07.06}
}

@techreport{Klo02,
  title = {Graph coloring algorithms},
  author = {W. Klotz},
  institution = {Clausthal University of Technology},
  year = {2002},
  address = {Clausthal, Germany},
  number = {Mathematik-Bericht 5},
  keywords = {graph coloring problem, construction heuristics}
}

@article{Lei79,
  title = {A Graph Coloring Algorithm for Large Scheduling Problems},
  author = {F. T. Leighton},
  journal = {Journal of Research of the National Bureau of Standards},
  year = {1979},
  number = {6},
  pages = {489--506},
  volume = {84},
  keywords = {graph coloring problem, construction heuristics, applications}
}

@inproceedings{Pee01,
  title = {Graph coloring in {J}: an introduction},
  author = {Howard A. Peelle},
  booktitle = {Proceedings of the 2001 International Conference on APL: An Arrays Odyssey},
  year = {2001},
  address = {Yale University, New Haven, Connecticut, USA},
  pages = {77-82},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi = {http://doi.acm.org/10.1145/570407.570416},
  keywords = {graph coloring problem, construction heuristics}
}

@inproceedings{Veg99,
  title = {Using node merging to enhance graph coloring},
  author = {Steven R. Vegdahl},
  booktitle = {PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation},
  year = {1999},
  address = {New York, NY, USA},
  pages = {150--154},
  publisher = {ACM Press},
  doi = {http://doi.acm.org/10.1145/301618.301657},
  isbn = {1-58113-094-5},
  keywords = {graph coloring problem, construction heuristics},
  location = {Atlanta, Georgia, United States}
}

@article{deW90,
  title = {Heuristics for Graph Coloring},
  author = {D. de Werra},
  journal = {Computing Supplement},
  year = {1990},
  pages = {191--208},
  volume = {7},
  keywords = {graph coloring problem, construction heuristics}
}

@article{Woo69,
  title = {A Technique for Coloring a Graph Applicable to Large-Scale Timetabling Problems},
  author = {D. C. Wood},
  journal = {Computer Journal},
  year = {1969},
  pages = {317--322},
  volume = {12},
  keywords = {graph coloring problem, construction heuristics, applications}
}