|The dual graphs drawn in the projective plane symbolize this relationship to the SIAM DM conference. The idea and artwork is due to Jacobus Swarts in 2011.|
lire en français
Canadian Discrete and Algorithmic Mathematics Conference
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. Ideally, the meeting site will alternate between the western half and eastern half of Canada. The conference was pioneered by Derek Corneil, Daniel Panario, and Pavol Hell, who solicited the help of many discrete mathematics researchers across Canada to realize it.
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.
CanaDAM uses the same general format as the SIAM Conference on Discrete Mathematics, which is a biennial conference held in even numbered years. There are typically nine plenary talks and a collection of invited minisymposia on topics consistent with conference themes. Participation in the conference is by attending, submitting a contributed talk, or by proposing or participating in a minisymposium.
For more information about CanaDAM, contact the Chair of the Executive Committee at