Monday, February 8, 2010 |
|
10:00-11:00 |
Michel Habib |
Robust Algorithms and EP Theorems 1 |
11:30-12:30 |
Jack Edmonds |
Marriage and Flow |
|
14:00-15:00 |
Kathie Cameron |
CoFlow and Wheels within Wheels |
15:30-16:30 |
Frédéric Meunier |
Sperner and Tucker Lemmas |
|
Tuesday, February 9, 2010 |
|
10:00-11:00 |
Michel Habib |
Robust Algorithms and EP Theorems 2 |
11:30-12:30 |
Jack Edmonds |
Branching Systems |
|
14:00-15:00 |
Nicolas Trotignon |
Perfect Graphs 1: Minimally imperfect Graphs |
15:30-16:30 |
Stéphane Gaubert |
MaxPlus and Mean Payoff Games |
|
Wednesday, February 10, 2010 |
|
10:00-11:00 |
Jack Edmonds |
Polymatroids, Part 1 |
11:30-12:30 |
Pierre Duchet |
Pretty Permutations |
|
14:00-15:00 |
Nicolas Trotignon |
Perfect Graphs 2: Structure |
15:30-16:30 |
Mekkia Kouider |
Covering Vertices with Cycles |
16:30-17:30 |
Odile Favaron |
k-Dominating k-Independent Sets |
|
Thursday, February 11, 2010 |
|
10:00-11:00 |
Jack Edmonds |
Lehman's Game |
11:30-12:30 |
Frédéric Meunier |
The Splitting Necklace Theorem |
|
14:00-15:00 |
Nicolas Trotignon |
Perfect Graphs 3: Meyniel and Weakly Triangulated Graphs |
15:30-16:30 |
Kathie Cameron |
Finding Another by Exchange Graphs |
|
Friday, February 12, 2010 |
|
10:00-11:00 |
Jack Edmonds |
Solving Linear Systems |
11:30-12:30 |
Jack Edmonds |
Integrality and Non-negativity |
|
14:00-16:30 |
Adrian Bondy |
Pretty Applications of the Probabilistic Method |
|