 |
CanaDAM 2007
1st Canadian Discrete and Algorithmic Mathematics Conference May 28-31, 2007 Banff Conference Center, Alberta, Canada |
 |
Invited Minisymposium
Organizers and Titles:
Contributed Minisymposium
Organizers and Titles:- Petra Berenbrink (Simon Fraser):
Randomized algorithms
- Gabor Tardos (Simon Fraser):
Combinatorial geometry and graph drawing - Tamas Terlaky (McMaster):
Linear, polyhedral optimization and their relatives - Anne Bergeron (Université
du Québec à Montréal):
Combinatorial problems in genomics - Bertrand Guenin (Waterloo):
Graphs, matroids, colourings and flows - Penny Haxell (Waterloo):
Extremal combinatorics - David Galvin (UPenn):
Problems at the interface of discrete math and statistical physics - Doug West (U of Illinois):
Graph Colouring
- Richard Brewster(Thompson Rivers Univ):
Graph Homomorphisms
- Sebastian Cioaba (Univ. California San Diego) and Steve
Kirkland (Univ. of Regina):
Spectral Graph Theory - Gary MacGillivray (Univ. of Victoria):
Discrete-time, deterministic graph processes and games
- Karen Meagher (Univ. of Waterloo):
Applications of Association Schemes to Combinatorial Problems
- Reinhard Laubenbacher and Henning Mortveit (Virginia
Bioinformatics Inst.):
Discrete Dynamical Systems over Graphs - Lucia Moura (Univ. of Ottawa) and Brett Stevens (Carleton
Univ):
Covering arrays: New generalizations for software testing application - Conrado Martinez (U. Politecnica Catalunya) and Daniel
Panario (Carleton Univ.):
Applications of Discrete Mathematics to the Analysis of Algorithms - Stefan Pickl (Uni Bw Munchen):
Games on Graphs - John Van Rees and Clement Lam (Concordia Univ):
Combinatorial Designs - Ken-ichi Kawarabayashi (Tohoku Univ.):
Graph Minors - Mike Albertson (Smith College) and Bojan Mohar (Simon
Fraser):
Topological Graph Theory