Canadian Discrete and Algorithmic Mathematics Conference 2009

  • Start Date: 05/25/2009
  • End Date: 05/28/2009

Centre de Recherches Mathématiques


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



The 2nd Canadian Discrete and Algorithmic Mathematics
Conference  was held on May 25-28, 2009, at the Centre de Recherches Mathématiques
in Montréal (Canada). This was the second conference
in a new series on discrete mathematics that is held every two years
(in the odd years) and has the same format as the SIAM Conference on
Discrete Mathematics. The first conference in this new series was held
in Banff (see 


Jason Brown (Dalhousie)
Pavol Hell (Simon Fraser)
Odile Marcotte (UQÀM, CRM)Ortrud Oellermann (Winnipeg)
Daniel Panario (Carleton, Chair)
Bruce Richter (Waterloo)

Other Information: 


For details, please visit the official website at