empirical.bib
@comment{{This file has been generated by bib2bib 1.97}}
@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,
title = {Exploring the $k$-colorable Landscape with Iterated Greedy},
author = {J.C.~Culberson and F.~Luo},
pages = {245--284},
crossref = {dimacs96},
keywords = {graph coloring problem, empirical analyses},
opturl = {citeseer.nj.nec.com/75655.html}
}
@inproceedings{Wal02,
title = {2+p-COL},
author = {T. Walsh},
pages = {17--22},
crossref = {symposium02},
keywords = {graph coloring problem, empirical analyses}
}
@article{BarFer04,
title = {On the phase transitions of graph coloring and independent sets},
author = {Valmir C. Barbosa and Rubens G. Ferreira},
journal = {Physica A: Statistical Mechanics and its Applications},
year = {2004},
month = {November},
number = {1--2},
volume = {343},
keywords = {graph coloring problem, empirical analyses}
}
@inproceedings{CheKanTay91,
title = {Where the Really Hard Problems Are},
author = {P. Cheeseman and B. Kanefsky and W. M. Taylor},
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,
title = {Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems},
author = {M. Chiarandini},
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,
title = {Exact coloring of real-life graphs is easy},
author = {Olivier Coudert},
booktitle = {DAC '97: Proceedings of the 34th annual conference on Design automation},
year = {1997},
address = {New York, NY, USA},
pages = {121--126},
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,
title = {Hidden Solutions, Tell-tales, Heuristics and Anti-heuristics},
author = {Joseph Culberson},
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,
title = {Iterated Greedy Graph Coloring and the Difficulty Landscape},
author = {J.C. Culberson},
institution = {Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada},
year = {1992},
month = jun,
number = {92-07},
keywords = {graph coloring problem, local search methods, hybrid metaheuristics, empirical analyses}
}
@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{CulGen01,
title = {Frozen Development in Graph Coloring},
author = {Joseph Culberson and Ian P. Gent},
journal = {Theoretical Computer Science},
year = {2001},
month = {August},
number = {1-2},
volume = {265},
keywords = {graph coloring problem, empirical analyses}
}
@techreport{CulGen99,
title = {Well out of reach: Why hard problems are hard.},
author = {Joseph Culberson and Ian P. Gent},
institution = {APES (Algorithms, Problems, and Empirical Studies) Group},
year = {1999},
number = {APES--13--1999},
keywords = {graph coloring problem, empirical analyses}
}
@article{Gom05,
title = {Can Get Satisfaction},
author = {Carla Gomes and Bart Selman},
journal = {Nature},
year = {2005},
pages = {751--752},
volume = {435},
keywords = {graph coloring problem, empirical analyses}
}
@incollection{HamHao04:b,
title = {An analysis of solution properties of the graph coloring problem},
author = {Jean-Philippe Hamiez and Jin-Kao Hao},
booktitle = {Metaheuristics: computer decision-making},
publisher = {Kluwer Academic Publishers},
year = {2004},
address = {Norwell, MA, USA},
editor = {Mauricio G. C. Resende and Jorge Pinho de Sousa and Ana Viana},
pages = {325--345},
isbn = {1-4020-7653-3},
keywords = {graph coloring problem, empirical analyses}
}
@inproceedings{HamHao04:a,
title = {An analysis of solution properties of the graph coloring problem},
author = {Jean-Philippe Hamiez and Jin-Kao Hao},
booktitle = {Proceedings of the Metaheuristics International Conference},
year = {2001},
address = {Porto, Portugal},
pages = {193--198},
keywords = {graph coloring problem, empirical analyses}
}
@article{HerJauAra94,
title = {Local optima topology for the $k$-coloring problem},
author = {Alain Hertz and Brigitte Jaumard and Marcus Poggi de Arag\~ao},
journal = {Discrete Applied Mathematics},
year = {1994},
number = {1-3},
pages = {257--280},
volume = {49},
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,
title = {Refining the Phase Transition in Combinatorial Search},
author = {T. Hogg},
journal = {Artificial Intelligence},
year = {1996},
number = {1--2},
pages = {127--154},
volume = {81},
keywords = {graph coloring problem, empirical analyses}
}
@article{Lewis2012,
title = {A wide-ranging computational comparison of high-performance graph colouring algorithms},
author = {R. Lewis and J. Thompson and C. Mumford and J. Gillard},
journal = {Computers \& Operations Research},
year = {2012},
number = {9},
pages = {1933 - 1950},
volume = {39},
abstract = {This paper reviews the current state of the literature surrounding methods for the general graph colouring problem and presents a broad comparison of six high-performance algorithms, each belonging to one of the main algorithmic schemes identified. Unlike many previous computational studies in graph colouring, a large range of both artificially generated and real-world graphs are considered, culminating in over 40,000 individual trials that have consumed more than a decade of computation time in total. The picture painted by the comparison is complex, with each method outperforming all others on at least one occasion; however, general patterns are also observed, particularly with regards to the advantages of hybridising local-search techniques with global-based operators.},
doi = {10.1016/j.cor.2011.08.010},
issn = {0305-0548},
keywords = {graph coloring problem, empirical analyses, metaheuristics},
url = {http://www.sciencedirect.com/science/article/pii/S0305054811002425}
}
@article{MulPagWeiZec02,
title = {Coloring random graphs},
author = {R. Mulet and A. Pagnani and M. Weigt and R. Zecchina},
journal = {Physical Review Letters},
year = {2002},
number = {26},
volume = {89},
keywords = {graph coloring problem, empirical analyses}
}
@article{Porumbel2010a,
title = {A search space "cartography" for guiding graph coloring heuristics},
author = {Daniel Cosmin Porumbel and Jin-Kao Hao and Pascale Kuntz},
journal = {Computers \& Operations Research},
year = {2010},
number = {4},
pages = {769 - 778},
volume = {37},
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,
title = {From {N}eel to {NPC}: Colouring Small Worlds},
author = {Pontus Svenson},
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,
title = {Relaxation in graph coloring and satisfiability problems},
author = {Pontus Svenson and Mats G. Nordahl},
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,
title = {Search in a Small World},
author = {T. Walsh},
booktitle = {Proceedings of the 16th International Joint Conference on Artificial Intelligence},
year = {1999},
address = {Stockholm, Sweden},
editor = {Thomas Dean},
pages = {1172--1177},
publisher = {Morgan Kaufmann},
keywords = {graph coloring problem, empirical analyses},
opturl = {citeseer.nj.nec.com/walsh99search.html}
}
@inproceedings{Wal01b,
title = {Search on High Degree Graphs},
author = {Toby Walsh},
booktitle = {Proceedings of the 1st International Joint Conference on Artificial Intelligence},
year = {2001},
address = {Seattle, Washington, USA},
editor = {Bernhard Nebel},
pages = {266--274},
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},
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}
}