10:00 Penny Haxell (University of Waterloo)
A Version of Hall's Theorem for Hypergraphs

11:10 Tim Chow (Tellabs Research Center)
Towards a Robinson-Schensted algorithm for (3+1)-free posetsabstract available

12:10 Lunch

2:00 Kathi Cameron (Wilfrid Laurier University)
Some graphic uses of an even number of odd nodes abstract available
and paper available

3:10 Doug West (University of Illinois)
Bandwidth of Graphs: A Tour of Combinatorial Techniques