November 8, 2011
Lichtenštejnský palác, Prague
| coffee at Department, Malostranské náměstí 25, 2nd floor | ||
| Reinhard Diestel | Connectivity and tree structure in finite graphs | |
| Zdeněk Dvořák | Coloring graphs on surfaces | |
| Jiří Matoušek | Algorithmic aspects of embedding simplicial complexes in Rd | |
| Lunch at the faculty building | ||
| Bruce Reed | Separators, Brambles, Tree Decompositions and Excluding Clique Minors | |
| Ken-ichi Kawarabayashi | Excluding topological minors | |
| Sang-il Oum | Rank width and well-quasi-ordering of skew-symmetric or symmetric matices | |
| Petr Hliněný | Where are good digraphs width measures? | |
| Martin Loebl | The curious world of Pfaffian orientations |