Canadian Discrete and Algorithmic Mathematics conference

The Canadian Discrete and Algorithmic Mathematics (CanaDAM) is the pre-eminent conference in its area in Canada. It has been
held every two years since its founding in 2009. The general topic of the conference is the theory and application of
discrete structures; the goal is to highlight the most salient trends in the field. CanaDAM will bring together researchers
from the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest include
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, such as web graphs, computational
biology, telecommunication networks, and information processing. CanaDAM strongly encourages participation from students and
postdocs. We hope to see you there!