construction.bib

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

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

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

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

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

@inproceedings{Veg99,
  author = {Steven R. Vegdahl},
  title = {Using node merging to enhance graph coloring},
  booktitle = {PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming
	language design and implementation},
  year = {1999},
  pages = {150--154},
  address = {New York, NY, USA},
  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,
  author = {D. de Werra},
  title = {Heuristics for Graph Coloring},
  journal = {Computing Supplement},
  year = {1990},
  volume = {7},
  pages = {191--208},
  keywords = {graph coloring problem, construction heuristics}
}

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