Program
Each morning will begin with a plenary lecture, followed by both morning and afternoon sessions consisting of 25 minute talks on a range of topics in graph theory and graph algorithms. We hope that all participants will be able to speak.- Plenary Speakers
- Reinhard Diestel, University of Hamburg
- Jim Geelen, University of Waterloo
- Stephan Kreutzer, University of Oxford
- Paul Seymour, Princeton University