9:30-10:00		Registration
Morning session
10:00-10:15	Zoltán Szigeti	Introduction
10:15-10:45	András Frank	On parity and submodularity
10:45-11:15	Beth Novick	Location Functions on Finite Metric Spaces
Coffee Break
11:45-12:15	Michael Tarsi	The hunting of the snark
12:15-12:35	Jean Fonlupt	Quelques souvenirs personnels
Buffet
Afternoon session
2:30-3:00	Joseph Cheriyan	Nash-Williams' Orientation Theorem and Extensions
3:00-3:30	Judith Keijsper	The 'ring of life'
3:30-4:00	Kazuo Murota	Auction Theory and Discrete Convex Analysis
Coffee Break
4:30-5:00	Antoine Deza	Combinatorial approaches to the colourful simplicial depth
5:00-5:30	Nicola Apollonio	A characterization of minimally unbalanced diamond-free graphs by forbidden subgraphs
5:30-6:00	László Végh	The cutting plane method is polynomial for perfect matchings

Morning session
9:00-9:30	Jens Vygen	Approximation algorithms for the traveling salesman: recent advances and future directions
9:30-10:00	Nicolas Trotignon	Isolating highly connected induced subgraphs
10:00-10:30	Gábor Bacsó	Old and young – perfect graphs and their cliques
Coffee Break
11:00-11:30	Henning Bruhn	Structural parametrisations for boxicity
11:30-12:00	András Sebő	Overripe Problem Session
Buffet
Afternoon session
2:00-2:30	Stéphan Thomassé	Separating Cliques from Stable Sets
2:30-3:00	Attila Bernáth	The Generalized Terminal Backup Problem
3:00-3:30	Eric Tannier	The binary matroid of genome arrangements
Coffee Break	Birthday Cake
4:00-4:30	Guyslain Naves	A fresh view on Okamura-Seymour's theorem
4:30-5:00	Mouna Sadli	On the Node Demand Problem