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
- Dan Kral, University of Warwick
- Daniel Marx, MTA SZTAKI
- Bruce Reed, University of McGill
- Paul Seymour, Princeton University
- Stephan Thomasse, Ecole Normale Superieure de Lyon