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
    • Michele Conforti, University of Padua
    • Fedor Fomin, University of Bergen
    • Bojan Mohar, Simon Fraser University and University of Ljubljana
    • Paul Seymour, Princeton University