CanaDAM 2011
Speakers
Details
The conference is on the theory and application of discrete structures. The following are some of the topics which will be discussed: graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, telecommunication networks, and information processing.
Invited Minisymposia:
Algebraic Combinatorics - Mike Zabrocki (York University)
Combinatorial Optimization - Mohit Singh (McGill)
Bioinformatics - Miklos Csuros (University of Montreal)
Computational Complexity - Venkatesh Srinivasan (University of Victoria)
Cryptography - Bruce Kapron (University of Victoria)
Discrete and Computational Geometry - Binay Bhattacharya (Simon Fraser)
Extremal Graph Theory - Penny Haxell (University of Waterloo)
Probabilistic Combinatorics - Tom Bohman and Po-Shen Loh (Carnegie
Mellon University)
Problem Session:
Moderated by Brett Stevens (Carleton)
Popular Lecture:
Origami - Joseph O'Rourke (Smith College)
Please see the official event webpage for further information:
