Abstracts of the talks and conference photo
The booklet handed out in the conference containing the list of speakers as well as the abstracts of talks is available  here in PDF form.

The photo taken in the last day of the conference can be downloaded. There are three different resolutions (sizes) of it:

• small (700kB)
• medium (2MB)
• Large (7MB)

---

The first Canadian Discrete and Algorithmic Mathematics Conference will be held on May 28-31, 2007 in Banff Conference Center, Alberta, Canada. This is a new conference on Discrete Mathematics that will follow the format of the SIAM Conference on Discrete Mathematics and will be held every two years (in the odd years).

Aims and Scope

This conference focuses on research related to discrete and algorithmic mathematics. The scope includes the theory and application of discrete structures and the conference aims to highlight the most salient trends in the field. Indeed research in discrete mathematics can be viewed as a living, growing network involving links within discrete mathematics and to such diverse areas as cryptography, computer science, large-scale networks and biology; this conference brings together researchers from the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest include: graphs and digraphs, hypergraphs, ordered sets, designs, coding theory, enumeration, discrete optimization, combinatorial algorithms and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, telecommunication networks, and information processing.

Call for submissions:  in .pdf and .ps format

Sponsors

The Fields Institute for Research in Mathematical Sciences