2.00 pm	Welcome and Introduction Robert Leese (Oxford)
2.15 pm	Introduction to Spectrum Management Ryszard Struzak (International Telecommunications Union)
3.00 pm	Graph Colouring Problems in the Plane Colin McDiarmid (Oxford)
4.00 pm	Tea
4.30 pm	LP-methods for Combinatorial Optimization Problems Cor Hurkens (Eindhoven)
5.30 pm	Asymptotic T-Coloring Efficiency and its Applications to Other Coloring Problems Daphne Liu (California State)
5.50 pm	End of formal sessions

9.00 am	Spectrum Management: Into the 21st Century Jim Norton (Radiocommunications Agency)
10.00 am	Radio Astronomy in Telecommunication Land Titus Spoelstra (ESF Committee on Radio Astronomy Frequencies)
10.30 am	Coffee
11.00 am	Constraint Satisfaction Problems Peter Jeavons / David Cohen (Royal Holloway)
12 noon	Break for lunch
2.00 pm	Meta-Heuristics and Frequency Assignment: Part I Steve Hurley (Cardiff)
3.00 pm	Meta-heuristics and Frequency Assignment: Part II George Smith (East Anglia)
4.00 pm	Tea
4.30 pm	The Role of Cliques Derek Smith (Glamorgan)
5.30 pm	The Partial Constraint Satisfaction Problem: Facets and Lifting Theorems Antoon Kolen (Maastricht)
6.00 pm	End of formal sessions

9.00 am	Polyhedral Methods for Lower Bounds Jeannette Janssen (London School of Economics)
10.00 am	Power Assignment under Constraints Ryszard Struzak (International Telecommunications Union)
10.30 am	Coffee
11.00 am	Solving the Frequency Assignment Problem using Branch-and-Cut Karen Aardal (Utrecht)
12 noon	Break for lunch
2.00 pm	Channel Assignment in Regular Networks Jan van den Heuvel (London Scool of Economics)
3.00 pm	Recent Results in Graph Colouring Bruce Reed (Paris)
4.00 pm	Tea
4.20 pm	Strategies for Dynamic Channel Assignment Robert Leese (Oxford)
5.10 pm	Distributed Dynamic Channel Assignment for the Terrestrial Radio Environment David Grace (York)
5.30 pm	End of meeting