CanaDAM 2011

  • Start Date: 05/31/2011
  • End Date: 06/03/2011

Anne Bergeron

Sara Billey

Allan Borodin

Chandra Chekuri

Jacob Fox

Jeff Kahn

Alice Silverberg

Stephan Thomasse


University of Victoria


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


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:

Abstracts / Downloads / Reports:

Please visit this page for this list of organizers:

Other Information: 




Please help PIMS to improve the quality of its events and plan for the future by filling out this quick and painless survey.



pimsCentre de recherches mathématiquesFields InstituteCanadian Mathematical SocietyMITACSUniversity of Victoria