View photo of participants:   medium size  -  full

How did we do? Please take a moment to fill out the survey.

The 3rd biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) will be held on May 31-June 3, 2011, at the University of Victoria in Victoria, BC, Canada. The meeting has the same general format as the SIAM Conference on Discrete Mathematics. The first conference in this new series was held in Banff , and the second was held in Montreal.

The general topic of the conference is the theory and application of discrete structures. Its goal is to highlight the most salient trends in the field, which has close links to such diverse areas as cryptography, computer science, large-scale networks and biology. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact.

Download the Poster

Particular areas of interest are the following: 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.

Participation in the conference through attending, submitting a contributed talk, or proposing a minisymposium consisting of four or five related talks, is invited. Further details about submitting talks and minisymposia can be found on the submission forms linked above.

Invited Speakers:
Anne Bergeron (UQAM)
Sara Billey (University of Washington)
Allan Borodin (University of Toronto)
Chandra Chekuri (University of Illinois, Urbana-Champaign)
Jacob Fox (MIT)
Jeff Kahn (Rutgers University)
Alice Silverberg (University of California at Irvine)
Stéphan Thomassé (Université Montpellier 2)

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). Please send open problems to brett@math.carleton.ca; put "CanaDAM open problems" in the subject field.

Popular Lecture: Origami - Joseph O'Rourke (Smith College)      The reception before this lecture is sponsored by Elsevier.