Canadian Discrete and Algorithmic Mathematics Conference 2009

The general topic of the conference was the theory and application of discrete structures and its goal was to highlight the most salient trends in the field, which has close links to such diverse areas as cryptography, computer science, large-scale networks and biology. The conference brought together researchers from the various disciplines with which discrete and algorithmic mathematics interact.

Particular areas of interest were the following: 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.