CanaDAM is the pre-eminent Canadian conference in discrete and algorithmic mathematics. It has been held every two years since 2007, and has established itself as one of the main international conferences in discrete mathematics. The general topic 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 diverse areas such as cryptography, computer science, large-scale networks and biology. 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, including (but not limited to) web graphs, computational biology, telecommunication networks, and information processing.