Canadian Discrete and Algorithmic Mathematics

  • Start Date: 06/01/2015
  • End Date: 06/04/2015

University of Saskatchewan


The CanaDAM conference focuses on research related to discrete and algorithmic mathematics. The scope includes the theory and application of discrete structures, and the conference aims to highlight the most salient trends in the field. This conference brings together researchers from various disciplines that interact with discrete and algorithmic mathematics. Particular areas of interest include graphs and digraphs, hypergraphs, ordered sets, designs, enumeration, discrete optimization, combinatorial algorithms, coding theory and cryptography, and applications of discrete and algorithmic mathematics, including (but not limited to) large-scale networks such as web graphs or telecommunication networks, computational biology, and information processing. We emphasize that CanaDAM is not a meeting with a narrow scope including only a few topics from within discrete mathematics. It is a very broad conference including many dynamic communities with both pure and applied interests.

Abstracts / Downloads / Reports: 
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.