instances.bib

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

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

@inproceedings{GomShm02,
  title = {Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem},
  author = {C. Gomes and D. Shmoys},
  pages = {22--39},
  crossref = {symposium02},
  keywords = {graph coloring problem, exact methods, applications, instances}
}

@inproceedings{Hos02,
  title = {Graph coloring in the estimation of mathematical derivatives},
  author = {S. Hossain and T. Steihaug},
  pages = {9--16},
  crossref = {symposium02},
  keywords = {graph coloring problem, applications, instances}
}

@incollection{Lew96,
  title = {Experiments with parallel graph coloring heuristics and applications of graph coloring},
  author = {G. Lewandowski and A. Condon},
  pages = {309--334},
  crossref = {dimacs96},
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics, applications, instances},
  opturl = {citeseer.nj.nec.com/75655.html}
}

@inproceedings{MizNis02,
  title = {Toward Ordered Generation of Exceptionally Hard Instances for Graph 3-Colorability},
  author = {K. Mizuno and S. Nishihara},
  pages = {1--8},
  crossref = {symposium02},
  keywords = {graph coloring problem, instances}
}

@unpublished{CarOlm02a,
  title = {$K$-Insertions graphs: a proposal of a new class of benchmarks},
  author = {M. Caramia and P. Dell'Olmo},
  note = {Manuscript},
  year = {2002},
  keywords = {graph coloring problem, instances}
}

@unpublished{CarOlm02b,
  title = {$K$-FullIns graphs: a proposal of a new class of benchmarks},
  author = {M. Caramia and P. Dell'Olmo},
  note = {Manuscript},
  year = {2002},
  keywords = {graph coloring problem, instances}
}

@misc{Chv04,
  title = {Coloring the queen graphs},
  author = {V. Chv\'atal},
  note = {Web repository (last visited July 2005)},
  year = {2004},
  keywords = {graph coloring problem, theoretical analyses, instances},
  url = {http://www.cs.concordia.ca/~chvatal/queengraphs.html}
}

@inproceedings{CulBeaPap95,
  title = {Hiding our Colors},
  author = {J. Culberson and A. Beacham and D. Papp},
  booktitle = {Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems},
  year = {1995},
  address = {Cassis, France},
  month = sep,
  pages = {31--42},
  extauthor = {J. Jaam and P. Jegou},
  keywords = {graph coloring problem, empirical analyses, instances},
  url = {http://webdocs.cs.ualberta.ca/~joe/Abstracts/ssrhp.html}
}

@article{JohAraMcGSch91:or,
  title = {Optimization by Simulated Annealing: An Experimental Evaluation; Part {II}, Graph Coloring and Number Partitioning},
  author = {D. S. Johnson and C. R. Aragon and L. A. McGeoch and C.~Schevon},
  journal = {Operations Research},
  year = {1991},
  number = {3},
  pages = {378--406},
  volume = {39},
  file = {:home/marco/Literature/Applications/Coloring/johnson91.pdf:PDF},
  keywords = {graph coloring problem, local search methods, simple metaheuristics, instances}
}

@article{MehTri96,
  title = {A Column Generation Approach for Graph Coloring},
  author = {A. Mehrotra and M. Trick},
  journal = {INFORMS Journal On Computing},
  year = {1996},
  number = {4},
  pages = {344--354},
  volume = {8},
  keywords = {graph coloring problem, exact methods, instances}
}

@article{DBLP:journals/dam/MizunoN08,
  title = {Constructive generation of very hard 3-colorability instances},
  author = {Kazunori Mizuno and Seiichi Nishihara},
  journal = {Discrete Applied Mathematics},
  year = {2008},
  number = {2},
  pages = {218-229},
  volume = {156},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi = {10.1016/j.dam.2006.07.015},
  keywords = {graph coloring problem, instances}
}

@inproceedings{ZyKoWe03,
  title = {Transparent optical network design with sparse wavelength conversion},
  author = {A. Zymolka and A. M. C. A. Koster and R. {Wess\"aly}},
  booktitle = {Proceedings of the 7th IFIP Working Conference on Optical Network Design \& Modelling},
  year = {2003},
  address = {Budapest, Hungary},
  pages = {61--80},
  keywords = {graph coloring problem, applications, instances}
}

@proceedings{symposium02,
  title = {Proceedings of the Computational Symposium on Graph Coloring and its Generalizations},
  year = {2002},
  address = {Ithaca, New York, USA},
  editor = {D. S. Johnson and A. Mehrotra and M. Trick},
  booktitle = {Proceedings of the Computational Symposium on Graph Coloring and its Generalizations}
}

@book{dimacs96,
  title = {Cliques, Coloring, and Satisfiability: Second {DIMACS} Implementation Challenge, 1993},
  editor = {David S. Johnson and Michael Trick},
  publisher = {American Mathematical Society, Providence, RI, USA},
  year = {1996},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  volume = {26},
  keywords = {graph coloring problem, surveys}
}