CANADAM 2011 - The 3rd biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)

Website canadam.math.ca/2011/ | Edit Freely

Category CANADAM 2011

Deadline: January 31, 2011 | Date: May 31, 2011-June 03, 2011

Venue/Country: Victoria, Canada

Updated: 2010-12-12 18:28:52 (GMT+9)

Call For Papers - CFP

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 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 minisymposuim consisting of four or five related talks, is invited. Further details about submitting talks and minisymposia can be found on the submission forms linked above.

Invited Speakers:

Anne Bergeron (UQAM)

Sara Billey (University of Washington)

Allan Borodin (University of Toronto)

Chandra Chekuri (University of Illinois, Urbana-Champaign)

Jacob Fox (MIT)

Jeff Kahn (Rutgers University)

Alice Silverberg (University of California at Irvine)

Stephan Thomasse (Université Montpellier 2)

Invited Minisymposia:

Algebraic Combinatorics - Mike Zabrocki (York University)

Combinatorial Optimization - Mohit Singh (McGill)

Combinatorics/Discrete Mathematics in Genomics - Miklos Csuros (University of Montreal)

Recent Advances in Computational Complexity - Venkatesh Srinivasan (University of Victoria)

Cryptography - Bruce Kapron (University of Victoria)

Discrete and Computational Geometry - Binay Bhattacharya (Simon Fraser)

Extremal Graph Theory - Penny Haxell (University of Waterloo)

Probabilistic Combinatorics - Tom Bohman and Po-Shen Loh (Carnegie Mellon University)

Problem Session:

Moderated by Brett Stevens (Carleton). Please send open problems to brettmath.carleton.ca; put "CanaDAM open problems" in the subject field.