May 12-13, 2006
Ottawa-Carleton Discrete Math Day
held at Carleton University, Ottawa
Herzberg Building, room: 4351


Schedule (Abstracts)

Friday May 12
9:00-9:20
Registration and coffee
9:20
Opening remarks
9:30-10:30 Pierre Leroux, Université du Québec a Montréal
Characterizations and enumeration of toroidal K3,3-subdivision-free graphs
10:30-11:00
Coffee Break

11:00-11:25

11:30-11:55

Timothy Walsh, Université du Québec a Montréal
Counting Unlabeled Planar Two-pole Networks
Craig Sloss, University of Waterloo
Enumeration of Walks on the Induced Subgraph Order
12:00-2:00 LUNCH
2:00-2:25

2:30-2:55
Robert F. Bailey, Queen Mary, University of London
Error-correcting codes from permutation groups
Karel Casteels, University of Waterloo
The Cycle Spaces of an Infinite Graph
3:00-3:30 Coffee Break
3:30-4: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:30-10:30 Kieka Mynhardt, University of Victoria
A conjecture on domination in prisms of graphs
10:30-11:00 Coffee Break
11:00-12:00 Anthony B. Evans, Wright State University
Latin squares, orthogonal mates, and groups
12:00-2:00 LUNCH
2:00-2:25

2:30-2:55
Gabriel Verret, University of Ottawa
Shifts in Cayley Graphs
David Loker , University of Waterloo
Graph isomorphism and recognition of self-complementary graphs
3:00-4:00
William Cook, Georgia Tech
Exact Solution of Linear and Integer Programming Problems
4:00-4:15
Coffee Break
4:15-4:40

4:45-5: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


Back to top