The Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) is a biennial meeting, held in odd numbered years, that brings together researchers from the various disciplines with which discrete and algorithmic mathematics interact. The general topic of the conference is the theory and application of discrete structures and algorithms. Its goal is to highlight the most salient trends in the field. Particular areas of interest include additive combinatorics, algebraic combinatorics, analytic combinatorics, coding theory, combinatorial algorithms, combinatorial games, combinatorial matrix theory, combinatorial optimization, computational complexity, computational geometry, design theory, directed graphs, enumeration, extremal combinatorics, graph theory, hypergraphs, matroid theory and probabilistic combinatorics with applications to diverse areas including artificial intelligence, biology, chemistry, computer science, cryptography, information processing, large networks, physics and quantum information theory.