Canadian Discrete and Algorithmic Mathematics Meeting (CANADAM)

  • Start Date: 06/12/2017
  • End Date: 06/15/2017
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)

Ryerson University


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.




Other Information: 

Conference will be held on the Toronto campus of Ryerson University.


For more information please visit the site here