Schedule for Computational Symposium on Graph Coloring
Ithaca, NY
September 8, 2003


8:30 Arrival at Conference Site

8:55 Opening and introductions

9:00-10:40  Instance Generators

   Toward Ordered Generation of Exceptionally Hard Instances for Graph
   3-Colorability, Mizuno and Nishihara

   Graph Coloring in the Estimation of Mathematical Derivatives,
   Hossain and Steihaug

   2+p-COL, Walsh

   Completing Quasigroups or Latin Squares: A Structured Graph
   Coloring Problem, Gomes and Shmoys

10:40-11:00 Break

11:00-11:50  Exact Methods

   Vertex Coloring by Multistage Branch and Bound, Caramia and
   Dell'Olmo

   Another Look at Graph Coloring via Propositional Satisfiability,
   Van Gelder

   A Branch-and-Cut Algorithm for Graph Coloring, Mendez Diaz and
   Zabala (not presented)

11:50-1:15 Lunch

1:15-2:30  Genetic Algorithms and Ant Systems

   A New Genetic Graph Coloring Heuristic, Croitoru, Luchian,
   Gheorghies, and Apetrei

   Adaptive Memory Algorithms for Graph Coloring, Galinier, Hertz, and
   Zufferey 

   An Ant System for Coloring Graphs, Bui and Patel

2:30-2:45 Break

2:45-4:25 Local Search and Simulated Annealing

   Coloring Graphs with a General Heuristic Search Engine, Phan and
   Skiena

   A Combined Algoirthm for Graph Coloring in Register Allocation,
   Allen, Kumaran, and Liu

   An Application of Iterated Local Search to Graph Coloring Problem,
   Chiarandini and Stuetzle

   Constrained Bandwidth Multicoloration Neighborhoods, Prestwich


4:30-5:00 Final Session

   Summary and Future Plans, Mehrotra and Trick