empirical.bib

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

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

@incollection{CulLuo96,
  author = {J.C.~Culberson and F.~Luo},
  title = {Exploring the $k$-colorable Landscape with Iterated Greedy},
  pages = {245--284},
  crossref = {dimacs96},
  keywords = {graph coloring problem, empirical analyses},
  opturl = {citeseer.nj.nec.com/75655.html}
}

@inproceedings{Wal02,
  author = {T. Walsh},
  title = {2+p-COL},
  pages = {17--22},
  crossref = {symposium02},
  keywords = {graph coloring problem, empirical analyses}
}

@article{BarFer04,
  author = {Valmir C. Barbosa and Rubens G. Ferreira},
  title = {On the phase transitions of graph coloring and independent sets},
  journal = {Physica A: Statistical Mechanics and its Applications},
  year = {2004},
  volume = {343},
  number = {1--2},
  month = {November},
  keywords = {graph coloring problem, empirical analyses}
}

@inproceedings{CheKanTay91,
  author = {P. Cheeseman and B. Kanefsky and W. M. Taylor},
  title = {Where the Really Hard Problems Are},
  booktitle = {Proceedings of the 12th International Joint Conference on Artificial
	Intelligence},
  year = {1991},
  editor = {J. Mylopoulos and R. Reiter},
  pages = {331--337},
  publisher = {Morgan Kaufmann Publishers, San Francisco, CA, USA},
  keywords = {graph coloring problem, empirical analyses, experimental, modelling},
  opturl = {citeseer.ist.psu.edu/cheeseman91where.html}
}

@phdthesis{Chi05,
  author = {M. Chiarandini},
  title = {Stochastic Local Search Methods for Highly Constrained Combinatorial
	Optimisation Problems},
  school = {Computer Science Department, Darmstadt University of Technology},
  year = {2005},
  address = {Darmstadt, Germany},
  month = {August},
  file = {ChiarandiniPhD.pdf:Files/ChiarandiniPhD.pdf:PDF},
  keywords = {Chiarandini, graph coloring problem, empirical analyses},
  optnote = {337 pages.},
  optschool = {Fachbereich Informatik, Technische Universit\"at Darmstadt},
  pages = {1--337},
  url = {Files/Chiarandini-PhDThesis.pdf}
}

@inproceedings{Cou97,
  author = {Olivier Coudert},
  title = {Exact coloring of real-life graphs is easy},
  booktitle = {DAC '97: Proceedings of the 34th annual conference on Design automation},
  year = {1997},
  pages = {121--126},
  address = {New York, NY, USA},
  publisher = {ACM Press, New York, NY, USA},
  doi = {http://doi.acm.org/10.1145/266021.266047},
  isbn = {0-89791-920-3},
  keywords = {graph coloring problem, empirical analyses},
  location = {Anaheim, California, United States}
}

@inproceedings{Cul01,
  author = {Joseph Culberson},
  title = {Hidden Solutions, Tell-tales, Heuristics and Anti-heuristics},
  booktitle = {The IJCAI-01 Workshop on Empirical Methods in Artificial Intelligence},
  year = {2001},
  editor = {H.H. Hoos and T. Stu\"etzle},
  pages = {9--14},
  keywords = {graph coloring problem, empirical analyses}
}

@techreport{Cul92,
  author = {J.C. Culberson},
  title = {Iterated Greedy Graph Coloring and the Difficulty Landscape},
  institution = {Department of Computing Science, The University of Alberta, Edmonton,
	Alberta, Canada},
  year = {1992},
  number = {92-07},
  month = jun,
  keywords = {graph coloring problem, local search methods, hybrid metaheuristics,
	empirical analyses}
}

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

@article{CulGen01,
  author = {Joseph Culberson and Ian P. Gent},
  title = {Frozen Development in Graph Coloring},
  journal = {Theoretical Computer Science},
  year = {2001},
  volume = {265},
  number = {1-2},
  month = {August},
  keywords = {graph coloring problem, empirical analyses}
}

@techreport{CulGen99,
  author = {Joseph Culberson and Ian P. Gent},
  title = {Well out of reach: Why hard problems are hard.},
  institution = {APES (Algorithms, Problems, and Empirical Studies) Group},
  year = {1999},
  number = {APES--13--1999},
  keywords = {graph coloring problem, empirical analyses}
}

@article{Gom05,
  author = {Carla Gomes and Bart Selman},
  title = {Can Get Satisfaction},
  journal = {Nature},
  year = {2005},
  volume = {435},
  pages = {751--752},
  keywords = {graph coloring problem, empirical analyses}
}

@incollection{HamHao04:b,
  author = {Jean-Philippe Hamiez and Jin-Kao Hao},
  title = {An analysis of solution properties of the graph coloring problem},
  booktitle = {Metaheuristics: computer decision-making},
  publisher = {Kluwer Academic Publishers},
  year = {2004},
  editor = {Mauricio G. C. Resende and Jorge Pinho de Sousa and Ana Viana},
  pages = {325--345},
  address = {Norwell, MA, USA},
  isbn = {1-4020-7653-3},
  keywords = {graph coloring problem, empirical analyses}
}

@inproceedings{HamHao04:a,
  author = {Jean-Philippe Hamiez and Jin-Kao Hao},
  title = {An analysis of solution properties of the graph coloring problem},
  booktitle = {Proceedings of the Metaheuristics International Conference},
  year = {2001},
  pages = {193--198},
  address = {Porto, Portugal},
  keywords = {graph coloring problem, empirical analyses}
}

@article{HerJauAra94,
  author = {Alain Hertz and Brigitte Jaumard and Marcus Poggi de Arag\~ao},
  title = {Local optima topology for the $k$-coloring problem},
  journal = {Discrete Applied Mathematics},
  year = {1994},
  volume = {49},
  pages = {257--280},
  number = {1-3},
  doi = {10.1016/0166-218X(94)90212-7},
  issn = {0166-218X},
  keywords = {graph coloring problem, empirical analyses},
  publisher = {Elsevier Science Publishers B. V.}
}

@article{Hog96:aij,
  author = {T. Hogg},
  title = {Refining the Phase Transition in Combinatorial Search},
  journal = {Artificial Intelligence},
  year = {1996},
  volume = {81},
  pages = {127--154},
  number = {1--2},
  keywords = {graph coloring problem, empirical analyses}
}

@article{MulPagWeiZec02,
  author = {R. Mulet and A. Pagnani and M. Weigt and R. Zecchina},
  title = {Coloring random graphs},
  journal = {Physical Review Letters},
  year = {2002},
  volume = {89},
  number = {26},
  keywords = {graph coloring problem, empirical analyses}
}

@article{Porumbel2010a,
  author = {Daniel Cosmin Porumbel and Jin-Kao Hao and Pascale Kuntz},
  title = {A search space "cartography" for guiding graph coloring heuristics},
  journal = {Computers \& Operations Research},
  year = {2010},
  volume = {37},
  pages = {769 - 778},
  number = {4},
  doi = {10.1016/j.cor.2009.06.024},
  issn = {0305-0548},
  keywords = {graph coloring problem, empirical analyses, metaheuristics},
  opturl = {http://www.sciencedirect.com/science/article/B6VC5-4WPTXV8-2/2/af710abb2eed5db326c03a7ad251b1f3}
}

@article{Sve01,
  author = {Pontus Svenson},
  title = {From {N}eel to {NPC}: Colouring Small Worlds},
  journal = {Computing Research Repository},
  year = {2001},
  volume = {cs.CC/0107015},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://arxiv.org/abs/cs.CC/0107015},
  keywords = {graph coloring problem, empirical analyses}
}

@article{SveNor98,
  author = {Pontus Svenson and Mats G. Nordahl},
  title = {Relaxation in graph coloring and satisfiability problems},
  journal = {Computing Research Repository},
  year = {1998},
  volume = {cond-mat/9810144},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  ee = {http://arxiv.org/abs/cond-mat/9810144},
  keywords = {graph coloring problem, empirical analyses}
}

@inproceedings{Wal99,
  author = {T. Walsh},
  title = {Search in a Small World},
  booktitle = {Proceedings of the 16th International Joint Conference on Artificial
	Intelligence},
  year = {1999},
  editor = {Thomas Dean},
  pages = {1172--1177},
  address = {Stockholm, Sweden},
  publisher = {Morgan Kaufmann},
  keywords = {graph coloring problem, empirical analyses},
  opturl = {citeseer.nj.nec.com/walsh99search.html}
}

@inproceedings{Wal01b,
  author = {Toby Walsh},
  title = {Search on High Degree Graphs},
  booktitle = {Proceedings of the 1st International Joint Conference on Artificial
	Intelligence},
  year = {2001},
  editor = {Bernhard Nebel},
  pages = {266--274},
  address = {Seattle, Washington, USA},
  publisher = {Morgan Kaufmann},
  keywords = {graph coloring problem, empirical analyses}
}

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

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