7th Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2019)

The CanaDAM 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

Federico Ardila (San Francisco State University, USA)

Marthe Bonamy (Laboratoire Bordelais de Recherche en Informatique, France)

Johannes Carmesin (University of Cambridge, UK)

David Conlon (University of Oxford, UK)

Anna R. Karlin (University of Washington, USA)

Mike Molloy (University of Toronto)

Peter Nelson (University of Waterloo)

Rekha Thomas (University of Washington, USA)

Public Interest Lecture

Bill Cook (University of Waterloo)

Invited Minisymposia

• Additive combinatorics (Hamed Hatami, McGill University)
• Algebraic and geometric methods in combinatorics (Christophe Hohlweg, Université du Québec à Montréal)
• Algorithmic game theory (Hu Fu, University of British Columbia; Anna R. Karlin, University of Washington, USA)
• Combinatorial optimization (Tamon Stephen, Simon Fraser University)
• Computational methods in industrial mathematics (Bogumil Kaminski, Warsaw School of Economics, Poland; Andrei Raigorodskii, Moscow Institute of Physics and Technology, Russia)
• Discrete algorithms (Marcin Pilipczuk, University of Warsaw, Poland)
• Discrete geometry (Agelos Georgakopoulos, University of Warwick, UK)
• Enumerative combinatorics (Sergi Elizalde, Dartmouth College, USA)
• Extremal combinatorics (Joonkyung Lee, University of Oxford, UK)
• Graph decompositions (Marthe Bonamy, Laboratoire Bordelais de Recherche en Informatique, France)
• Matroid theory (Peter Nelson, University of Waterloo)
• Random graphs (Lutz Warnke, Georgia Institute of Technology, USA)
• Structural graph theory (Sophie Spirkl, Princeton University, USA)
• Special minisymposium on the occasion of the 25th Anniversary of Electronic Journal of Combinatorics
• (Richard A. Brualdi, Bruce Sagan, Maya Stein and David Wood)