May 1213, 2006

Friday May 12 

9:009:20 
Registration and coffee 

9:20 
Opening remarks 

9:3010:30  Pierre Leroux, Université
du Québec a Montréal Characterizations and enumeration of toroidal K3,3subdivisionfree graphs 

10:3011:00 
Coffee Break 

11:0011:25 11:3011:55 
Timothy Walsh,
Université
du Québec a Montréal Counting Unlabeled Planar Twopole Networks Craig Sloss, University of Waterloo Enumeration of Walks on the Induced Subgraph Order 

12:002:00  LUNCH  
2:002:25 2:302:55 
Robert F. Bailey, Queen Mary, University of London Errorcorrecting codes from permutation groups Karel Casteels, University of Waterloo The Cycle Spaces of an Infinite Graph 

3:003:30  Coffee Break  
3:304:30  Jonathan Jedwab, Simon Fraser University Written on a torus or on a cylinder? An elementary proof of the Barker array conjecture 

Saturday May 13 

9:3010:30  Kieka Mynhardt, University of Victoria A conjecture on domination in prisms of graphs 

10:3011:00  Coffee Break  
11:0012:00  Anthony B. Evans, Wright State University Latin squares, orthogonal mates, and groups 

12:002:00  LUNCH  
2:002:25 2:302:55 
Gabriel Verret, University of Ottawa Shifts in Cayley Graphs David Loker , University of Waterloo Graph isomorphism and recognition of selfcomplementary graphs 

3:004:00 
William Cook, Georgia Tech Exact Solution of Linear and Integer Programming Problems 

4:004:15 
Coffee Break 

4:154:40 4:455:15 
Conrado Martinez,
Universitat Politècnica de Catalunya Chunksort: a generalized partial sorting algorithm Christina Boucher, University of Waterloo Using Graph Clustering to Find Weak Motifs 