The 4th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) will be held on June 10-13 2013 on the St. John's campus of Memorial University of Newfoundland. Previous CanaDAM Conferences were held at Banff in 2007, Montreal in 2009 and Victoria in 2011.

The general theme 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 such diverse areas as cryptography, computer science, large-scale networks and biology. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact.

Particular areas of interest are 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.

Participation in the conference through attending, submitting a contributed talk, or proposing a minisymposium consisting of four or five related talks, is invited. Further details about submitting abstracts and minisymposia will be posted on this website in the coming months.

Invited Speakers:
Miguel Anjos (École Polytechnique, Montréal)
Anne Condon (University of British Columbia)
Reinhard Diestel (Universität Hamburg)
Cheryl Praeger (The University of Western Australia)
Victor Reiner (University of Minnesota)
Carla Savage (North Carolina State University)
Robert Sedgewick (Princeton University)
Benny Sudakov (University of California Los Angeles)