application.bib

@comment{{This file has been generated by bib2bib 1.97}}
@comment{{Command line: /usr/bin/bib2bib --expand -ob application.bib -oc application-list.bib ../all-entries.bib ./bib-gualandi.bib -c 'keywords : "graph coloring problem"' -c 'keywords : "applications"'}}
@inproceedings{Allen02,
  title = {A Combined Algorithm for Graph-coloring in Register Allocation},
  author = {M. Allen and G. Kumaran and T. Liu},
  pages = {100--111},
  crossref = {symposium02},
  keywords = {graph coloring problem, local search methods, simple metaheuristics, applications}
}
@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{BarBri02,
  title = {Graph Coloring for Air Traffic Flow Management},
  author = {N. Barnier and P. Brisset},
  booktitle = {CPAIOR'02: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems},
  year = {2002},
  address = {Le Croisic, France},
  month = {March},
  pages = {133-147},
  keywords = {graph coloring problem, exact methods, applications},
  opturl = {citeseer.nj.nec.com/502256.html}
}
@techreport{Marecek2007TR,
  title = {On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling},
  author = {Edmund K. Burke and Jakub Mare{\v c}ek and Andrew J. Parkes and Hana Rudov{\' a}},
  institution = {The University of Nottingham},
  year = {2007},
  address = {Nottingham},
  number = {NOTTCS-TR-2007-10},
  keywords = {graph coloring problem, exact methods, applications},
  url = {http://arxiv.org/abs/0710.3603}
}
@article{Werra1985,
  title = {An introduction to timetabling},
  author = {{de Werra}, D.},
  journal = {European Journal of Operational Research},
  year = {1985},
  month = feb,
  number = {2},
  pages = {151--162},
  volume = {19},
  doi = {10.1016/0377-2217(85)90167-5},
  issn = {0377-2217},
  keywords = {Timetabling, education networks, graphs, heuristics, graph coloring problem, applications},
  owner = {marco},
  timestamp = {2009.04.24},
  url = {http://www.sciencedirect.com/science/article/B6VCT-48NBKHD-32Y/2/87ecd333ea5bd503f592389b1ad7218e}
}
@inproceedings{Frei00,
  title = {Generalized map coloring for use in geographical information systems},
  author = {Robert Freimer},
  booktitle = {ACM-GIS 2000, Proceedings of the Eighth ACM Symposium on Advances in Geographic Information Systems},
  year = {2000},
  editor = {Ki-Joune Li and Kia Makki and Niki Pissinou and Siva Ravada},
  pages = {167--173},
  publisher = {ACM press, New York, NY, USA},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi = {http://doi.acm.org/10.1145/355274.355299},
  isbn = {1-58113-319-7},
  keywords = {graph coloring problem, applications},
  location = {Washington D.C., USA},
  optbooktitle = {ACM-GIS}
}
@article{GamHerQue07,
  title = {A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding},
  author = {Michel Gamache and Alain Hertz and Jérôme Olivier Ouellet},
  journal = {Computers \& Operations Research},
  year = {2007},
  number = {8},
  pages = {2384--2395},
  volume = {34},
  doi = {doi:10.1016/j.cor.2005.09.010},
  keywords = {graph coloring problem, applications}
}
@article{GarJohSo76,
  title = {An Application of Graph Coloring to Printed Circuit Testing},
  author = {M. R. Garey and D. S. Johnson and H. C. So},
  journal = {IEEE Transactions on Circuits and Systems},
  year = {1976},
  pages = {591--599},
  volume = {23},
  keywords = {graph coloring problem, applications}
}
@article{DBLP:journals/dam/HossainS08,
  title = {Graph coloring in the estimation of sparse derivative matrices: Instances and applications},
  author = {Shahadat Hossain and Trond Steihaug},
  journal = {Discrete Applied Mathematics},
  year = {2008},
  number = {2},
  pages = {280-288},
  volume = {156},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi = {10.1016/j.dam.2006.07.018},
  keywords = {graph coloring problem, applications}
}
@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}
}
@article{Lewis2010,
  title = {On the application of graph colouring techniques in round-robin sports scheduling},
  author = {R. Lewis and J. Thompson},
  journal = {Computers \& Operations Research},
  year = {2010},
  pages = { - },
  volume = {In Press, Corrected Proof},
  abstract = {The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. Using this model, which can also be extended to incorporate ad ditional constraints, the difficulty of such problems is then gauged by consider ing the performance of a number of different graph colouring algorithms. Second, neighbourhood operators are then proposed that can be derived from the underlyi ng graph colouring model and, in an example application, we show how these opera tors can be used in conjunction with multi-objective optimisation techniques to produce high-quality solutions to a real-world sports league scheduling problem encountered at the Welsh Rugby Union in Cardiff, Wales.},
  doi = {DOI: 10.1016/j.cor.2010.04.012},
  issn = {0305-0548},
  keywords = {graph coloring problem, applications},
  url = {http://www.sciencedirect.com/science/article/B6VC5-4YYRMX6-3/2/9cbabd1d0d 76ea547f769782a4bf68d3}
}
@inproceedings{SmiRamHoll04,
  title = {A generalized algorithm for graph-coloring register allocation},
  author = {Michael D. Smith and Norman Ramsey and Glenn Holloway},
  booktitle = {PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation},
  year = {2004},
  address = {New York, NY, USA},
  pages = {277--288},
  publisher = {ACM Press},
  doi = {http://doi.acm.org/10.1145/996841.996875},
  isbn = {1-58113-807-5},
  keywords = {graph coloring problem, applications},
  location = {Washington DC, USA}
}
@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}
}
@article{Zufferey2008,
  title = {Graph Colouring Approaches for a Satellite Range Scheduling Problem},
  author = {N. Zufferey and P. Amstutz and P. Giaccari},
  journal = {Journal of Scheduling},
  year = {2008},
  number = {4},
  pages = {263 -- 277},
  volume = {11},
  keywords = {graph coloring problem, applications},
  owner = {marco},
  timestamp = {2010.08.06}
}
@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}
}