April 7-9, 2009
At Poincaré Institute in Paris (Institut Henri Poincaré (IHP) of Université Pierre et Marie Curie)
11 rue Pierre et Marie Curie 75231 Paris CEDEX 05
Amphitheâtre Hermitte
Pretty Structure, Existential Polytime and
(Celebrating Jack Edmonds 75th birthday)
8h45-9h00 |
Welcome |
9h00-9h30 | Martin Loebl --- Matchings and Algorithm Complexity |
9h30-10h00 | Claudio Lucchesi --- Edmonds Graphs |
10h00-10h30 | Winfried Hochstadter --- Mixed Matching Markets |
10h30-11h00 |
Coffee Break |
11h00-11h30 | Tamás Király --- Good Characterizations for Connectivity Augmentation |
11h30-12h00 | Sándor Fekete --- Geometric Connectivity Problems |
12h00-12h30 | Stephan Thomassé --- Submodularity of Partition Functions |
12h30-14h00 |
Lunch |
14h00-14h30 | Nicolas Trotignon --- Even Pairs and Perfect Graphs |
14h30-15h00 | Jan van den Heuvel --- Degress of Perfectness |
15h00-15h30 | Bernhard von Stengel --- Lemke Pivoting |
15h30-16h00 |
Coffee Break |
16h00-16h30 | Franz Rendl --- Semidefinite Optimization – Why Bother ? |
16h30-17h00 | Laurence Wolsey --- Polyhedral Results for Mixing Sets |
17h00-17h30 | Jack Edmonds --- Optimum Branching Systems |
9h00-9h30 | Bjarne Toft --- The Theorem of Turán |
9h30-10h00 | Adrian Bondy --- Vines |
10h00-10h30 | Patrice Ossona de Mendez --- Indegree-bounded Orientations of Graphs |
10h30-11h00 |
Coffee Break |
11h00-11h30 | Andreas Brandstädt --- Variants of Induced Matchings |
11h30-12h00 | Derek Corneil --- Simple Algorithms Based on Graph Searches |
12h00-12h30 | Edoardo Amaldi --- Minimum Cycle Bases in Undirected Graphs |
12h30-14h00 |
Lunch |
14h00-14h30 | András Sebõ --- Making Long Stories Short … From the Last 24 Years |
14h30-15h00 | Myriam Preissmann --- Lovász and Lehman Theorems on Clutters |
15h00-15h30 | Zoltán Szigeti --- Edge-Connectivity Augmentation of graphs over symmetric parity families |
15h30-16h00 |
Coffee Break |
16h00-16h30 | Henry Crapo --- Ineffable Cacaphony |
16h30-17h00 | András Recski --- Is This Matrix Singular ? |
17h00-17h30 | Michel Las Vergnas --- LP in Oriented Matroids, and the Active Bijection |
Program of Thursday April 9
9h00-9h30 | Michel Deza --- Cones of Partial Metrics |
9h30-10h00 | Vincent Duquenne --- Lattices and Concept Systems |
10h00-10h30 | Jan Kratochvil --- Exact Exponential-time Algorithm for Frequency Assignment |
10h30-11h00 |
Coffee Break |
11h00-11h30 | Hubert de Frayssiex --- Geometric Representations of Graphs |
11h30-12h00 | Mike Jünger --- Crossing Number and Geometric Duality |
12h00-12h30 | Volker Kaibel --- Simplifying with Extended Formulations |
12h30-14h00 |
Lunch |
14h00-14h30 | Michel Habib --- A Decomposition for Chordal Graphs and Applications |
14h30-15h00 | Jean Fonlupt --- Graph Decompositions |
15h00-15h30 | Jaroslav Nešetřil --- Dualities and Good Characterizations |
15h30-16h00 |
Coffee Break |
16h00-16h30 | Denis Cornaz --- The Sandwich Line-Graph |
16h30-17h00 | Jean François Maurras --- On the Connectivity of k-Clique Polyhedra |
17h00-17h30 | Kathie Cameron --- Coflow Polyhedra |