Thursday, April 20, 2017

CanaDAM 2017

The 6th biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) will be held on June 12-15, 2017 on the Toronto campus of Ryerson University. Previous CanaDAM Conferences were held at Banff in 2007, Montréal in 2009, Victoria in 2011 St. Johns in 2013 and Saskatchewan in 2015
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.
Invited Speakers:
Tanya Berger-Wolf (U. Illinois at Chicago)
Peter Keevash (Oxford)
Robert Kleinberg (Cornell)
Bojan Mohar (Simon Fraser)
Shubhangi Saraf (Rutgers)
Andrew Suk (U Illinois at Chicago)
Lauren Williams (Berkeley)
Julia Wolf (Bristol) 
Public Interest Lecture:
Jordan Ellenberg (Wisconsin)

Invited Minisymposia:
Algebraic Combinatorics 
Org: Mike Zabrocki (York, Canada)
Algorithmic Game Theory 
Org: Brendan Lucier (Microsoft Research)
Arithmetic Combinatorics 
Org: Pablo Candela (Universidad Autónoma de Madrid)
Biological Networks 
Org: Elena Dimitrova (Clemson)
Convex Geometry 
Org: Sinai Robins (University of São Paulo, Brazil)
Extremal Combinatorics 
Org: Sergey Norine (McGill)
Locality in Coding Theory 
Org: Parikshit Gopalan (VMWare)
Chair: Peter Nelson (Waterloo)
Structural Graph Theory 
Org: Luke Postle (Waterloo)
The Cap Set Problem 
Org: Dion Gijswijt (TU Delft)

No comments:

Post a Comment