Conference Photograph
small (2MB) - large (7MB) - orig (10MB)

Conference delegates, please complete this evaluation survey.

The 5th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) will be held on June 1-4 2015 on the Saskatoon campus of the University of Saskatchewan. Previous CanaDAM Conferences were held at Banff in 2007, Montréal in 2009, Victoria in 2011 and St. Johns in 2013

The general theme 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.

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.

Invited Speakers:
Irit Dinur (Weizmann Institute, Israel)
Daniela Kühn (Birmingham University, UK)
Brendan McKay (Australian National University, Australia)
Karen Meagher (University of Regina, Canada)
Dhruv Mubayi (University of Illinois at Chicago, USA)
Yann Ponty (Polytechnique, CNRS, France)
Angelika Steger (ETH Zurich, Switzerland)
William Martin (Worcester Polytechnic Institute, USA)