| Time | Speaker | Title |
| 9:30 - 10:00
| Break |
| 10:00 - 11:00
| Michael O. Albertson,
Smith College |
150 Years of Coloring Graphs on Surfaces: A Drama in Several Acts |
| 11:00 - 11:30
| Break |
| 11:30 - 12:00
| Arny Rosenberg,
U Mass Amherst |
Techniques for Proving Lower Bounds on Graph Separation Width |
|
| 12:00 - 1:30
| Lunch, Room 1634, LGRT |
|
| 1:30 - 2:00
| Ileana Streinu, Smith College |
Folding Carpenter's Rules, Robot Arms, Proteins: a Combinatorial Approach |
| 2:00 - 2:30
| Matthias Beck,
Suny Binghamton | Sperner's theorem and its generalizations |
| 2:30 - 3:00
| Break |
| 3:00 - 3:30
| Rosa Orellana,
Dartmouth College | 1-2 rooted trees and the representation theory of iterated wreath
products.
|
| 3:30 - 4:00
| Dmitry Kozlov,
KTH Stockholm | Combinatorics of resonances |
| 4:00 - 4:15
| Break |
| 4:15 - 5:15
| Sara Billey,
MIT |
A Root System Description of Pattern Avoidance with Applications to G/B |