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. The conference 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, including (but not limited to) web graphs, computational biology, telecommunication networks, and information processing.

The meeting will be held 100% online. Many thanks to the Canadian Mathematical Society for helping to make that possible. Previous CanaDAM Conferences were held at Banff in 2007, Montréal in 2009, Victoria in 2011,  St. Johns in 2013, Saskatoon in 2015,  Toronto in 2017, and Vancouver in 2019.