Additive combinatorics I (IM1) 
Org: Hamed Hatami (McGill University) 
Additive combinatorics is an area of mathematics that studies combinatorial properties of subsets of integers or other Abelian groups. Other than its two obvious roots, number theory, and discrete mathematics, it has surprisingly deep connections to harmonic analysis, ergodic theory and theoretical computer science. This minisymposium will cover topics that are of interests to additive combinatorics and theoretical computer science. 

Friday May 31 
10:30  10:50  Shachar Lovett (University of California San Diego), The sunflower conjecture  new perspectives, Segal Centre 14201430 
10:55  11:15  Avishay Tal (Stanford University), Fourier Tails of Boolean Functions and Their Applications, Segal Centre 14201430 
11:20  11:40  Cosmin Pohoata (Caltech University), Upper bounds for sets of points with prescribed pairwise distances, Segal Centre 14201430 
11:45  12:05  Hamed Hatami (McGill University), Influences of coalitions over arbitrary product distributions, Segal Centre 14201430 

Additive combinatorics II (IM2) 
Org: Hamed Hatami (McGill University) 
Additive combinatorics is an area of mathematics that studies combinatorial properties of subsets of integers or other Abelian groups. Other than its two obvious roots, number theory, and discrete mathematics, it has surprisingly deep connections to harmonic analysis, ergodic theory and theoretical computer science. This minisymposium will cover topics that are of interests to additive combinatorics and theoretical computer science. 

Friday May 31 
15:30  15:50  Pablo Candela (Autonomous University of Madrid), A generalization of the inverse theorem for uniformity norms, Segal Centre 14201430 
15:55  16:15  Oleksiy Klurman (Royal Institute of Technology (KTH)), The Erdos discrepancy problem over the function fields, Segal Centre 14201430 
16:20  16:40  Jozsef Solymosi (University of British Columbia), The Uniformity Conjecture and the Sumproduct Phenomenon, Segal Centre 14201430 
16:45  17:05  Eshan Chattopadhyay (Cornell University), NonMalleable Extractors and Codes from Additive Combinatorics, Segal Centre 14201430 

Algebraic and geometric methods in combinatorics I (IM3) 
Org: Christophe Hohlweg (Université du Québec à Montréal) 
Since the past decades, many significant results flourished from the interplay between algebra, geometry and combinatorics. This minisymposium is dedicated to discussing some of the latest developments in algebraic combinatorics, combinatorial representation theory, reflection groups theory or in geometric combinatorics. 

Thursday May 30 
10:30  10:50  Alexander Garver (UQAM), Minuscule reverse plane partitions via representations of quivers, Fletcher Challenge Theatre 1900 
10:55  11:15  Aram Dermenjian (UQAM), Facial weak order in hyperplane arrangements, Fletcher Challenge Theatre 1900 
11:20  11:40  Elizabeth Miliæeviæ (Hartford College), The Peterson Isomorphism: Moduli of Curves and Alcove Walks, Fletcher Challenge Theatre 1900 
11:45  12:05  Emily Barnard (Northeastern University), Graph Associahedra and the Poset of Maximal Tubings, Fletcher Challenge Theatre 1900 

Algebraic and geometric methods in combinatorics II (IM4) 
Org: Christophe Hohlweg (Université du Québec à Montréal) 
Since the past decades, many significant results flourished from the interplay between algebra, geometry and combinatorics. This minisymposium is dedicated to discussing some of the latest developments in algebraic combinatorics, combinatorial representation theory, reflection groups theory or in geometric combinatorics. 

Thursday May 30 
15:30  15:50  Stephanie van Willigenburg (UBC), Noncommutative chromatic symmetric functions revisited, Fletcher Challenge Theatre 1900 
15:55  16:15  Brendon Rhoades (UCSD), Spanning configurations, Fletcher Challenge Theatre 1900 
16:20  16:40  Maria Monks Gillespie (UC Davis), Characterization of queer supercrystals, Fletcher Challenge Theatre 1900 
16:45  17:05  Nathan Williams (UT Dallas), Reflexponents, Fletcher Challenge Theatre 1900 

Algorithmic game theory (IM5) 
Org: Hu Fu (University of British Columbia) and Anna R. Karlin (University of Washington, USA) 
This minisymposium will explore recent research in the area of algorithmic game theory, i.e., topics at the intersection of theoretical computer science, game theory and economics. Of particular interest is algorithmic mechanism design, sometimes referred to as "incentive engineering", which focuses on the design of protocols (games) that guarantee that when rational participants act in their own selfinterest, the designer's goals are achieved. In other words: algorithm design with incentives. 

Thursday May 30 
10:30  10:50  Nikhil Devanur (Microsoft Research), Online Stochastic Optimization and game theory: beyond convexity, Segal Centre 14001410 
10:55  11:15  Kira Goldner (University of Washington), A BulowKlemperer Result for Gains From Trade in TwoSided Markets, Segal Centre 14001410 
11:20  11:40  Jason Hartline (Northwestern University), Anonymous Pricing for Nonlinear Agents, Segal Centre 14001410 
11:45  12:05  Kevin LeytonBrown (University of British Columbia), Formalizing the Boundary Between Strategic and Nonstrategic Reasoning, Segal Centre 14001410 
12:10  12:30  Brendan Lucier (Microsoft Research), Efficiency and Inefficiency in Emission License Auctions, Segal Centre 14001410 

Combinatorial optimization I (IM6) 
Org: Tamon Stephen (Simon Fraser University) 
Optimization continues to be a central theme in discrete and algorithmic mathematics. It is also a key link to applications, where it is a cornerstone of data science and machine learning. Themes featured in this session include polyhedra, pivoting algorithms and network flows. 

Wednesday May 29 
10:30  10:50  Kanstantsin Pashkovich (University of Ottawa), On the approximability of the stable matching problem with ties of size two, Segal Centre 14201430 
10:55  11:15  Mehrdad Ghadiri (University of British Columbia), In Search of Tractable Supermodular Maximization Problems, Segal Centre 14201430 
11:20  11:40  Charles Viss (University of Colorado, Denver), A Polyhedral Model for Enumeration and Optimization over the Set of Circuits, Segal Centre 14201430 
11:45  12:05  Amy Wiebe (University of Washington), Slack Realization Spaces, Segal Centre 14201430 

Combinatorial optimization II (IM7) 
Org: Tamon Stephen (Simon Fraser University) 
Optimization continues to be a central theme in discrete and algorithmic mathematics. It is also a key link to applications, where it is a cornerstone of data science and machine learning. Themes featured in this session include polyhedra, pivoting algorithms and network flows. 

Wednesday May 29 
15:30  15:50  Ahmad Abdi (Carnegie Mellon University and London School of Economics), Intersecting families in Combinatorial Optimization, Segal Centre 14201430 
15:55  16:15  Dabeen Lee (Carnegie Mellon University), Deltas, extended odd holes, and their blockers, Segal Centre 14201430 
16:20  16:40  Anne Condon (University of British Columbia), Predicting Minimum Free Energy Structures of Multistranded Nucleic Acid Systems is APXHard, Segal Centre 14201430 
16:45  17:05  Tony Huynh (Universite libre de Bruxelles), Stable sets in graphs with no two disjoint odd cycles, Segal Centre 14201430 

Computational methods in industrial mathematics I (IM8) 
Org: Bogumił Kamiński (Warsaw School of Economics, Poland) and Andrei Raigorodskii (Moscow Institute of Physics and Technology, Russia) 
Current economic development is based on continuous increase in efficiency of business processes and industrial organization. This increase is obtained through better collection of business process data, data analytics tools (including machine learning and data science methods), and advanced simulation and optimization techniques. Including all key features characterizing industrial processes and their business environment leads to complex mathematical models. The proposed minisymposium will highlight a number of recent applications of computational methods in industrial world. 

Thursday May 30 
10:30  10:50  Pawel Pralat (Ryerson University), Clustering via Hypergraph Modularity, Segal Centre 14201430 
10:55  11:15  Richard Darling (U. S. Department of Defense), Resolving labelling conflicts on big graphs via combinatorial data fusion, Segal Centre 14201430 
11:20  11:40  Łukasz Kraiński (SGH Warsaw School of Economics), Optimization of road side units location within vehicle communication networks using multiagent routing simulation, Segal Centre 14201430 
11:45  12:05  Marcin Opalski (SGH Warsaw School of Economics), Optimization of new roads construction by for intelligent transportation systems  an agent based spatial simulation approach, Segal Centre 14201430 

Computational methods in industrial mathematics II (IM9) 
Org: Bogumił Kamiński (Warsaw School of Economics, Poland) and Andrei Raigorodskii (Moscow Institute of Physics and Technology, Russia) 
Current economic development is based on continuous increase in efficiency of business processes and industrial organization. This increase is obtained through better collection of business process data, data analytics tools (including machine learning and data science methods), and advanced simulation and optimization techniques. Including all key features characterizing industrial processes and their business environment leads to complex mathematical models. The proposed minisymposium will highlight a number of recent applications of computational methods in industrial world. 

Thursday May 30 
15:30  15:50  Jacek Filipowski (SGH Warsaw School of Economics), Urban traffic optimization via cost incentivisation through a dynamic mutual payments between vehicle commuters, Segal Centre 14001430 
15:55  16:15  Przemysław Szufel (SGH Warsaw School of Economics), Unsupervised machine learning methods for anomaly detection softwareasaservice application network traffic logs, Segal Centre 14001430 
16:20  16:40  Andrei Raigorodskii (Moscow Institute of Physics and Technology, Russia), Moscow Institute of Physics and Technology and Yandex: an overview of joint projects, Segal Centre 14001430 

Discrete algorithms I (IM10) 
Org: Marcin Pilipczuk (University of Warsaw, Poland) 
The minisymposium will cover a number of recent results from various subareas of algorithm design, including counting, sparsification, dynamic algorithms, coloring, or lower bounds. 

Wednesday May 29 
10:30  10:50  Greg Bodwin (Georgia Tech), Distance and Reachability Preservers, Fletcher Challenge Theatre 1900 
10:55  11:15  Radu Curticapean (ITU Copenhagen), Counting small patterns via homomorphisms, Fletcher Challenge Theatre 1900 
11:20  11:40  Krzysztof Nowicki (University of Wrocław), MST in O(1) rounds of Congested Clique, Fletcher Challenge Theatre 1900 
11:45  12:05  Eva Rotenberg (Technical University of Denmark), Online Bipartite Matching with Amortized $O(\log^2 n)$ Replacements, Fletcher Challenge Theatre 1900 
12:10  12:30  Sophie Spirkl (Rutgers), Fourcoloring $P_6$free graphs, Fletcher Challenge Theatre 1900 

Discrete algorithms II (IM11) 
Org: Marcin Pilipczuk (University of Warsaw, Poland) 
The minisymposium will cover a number of recent results from various subareas of algorithm design, including counting, sparsification, dynamic algorithms, coloring, or lower bounds. 

Wednesday May 29 
15:30  15:50  Jakub Gajarský (TU Berlin), Sparsity and algorithms, Fletcher Challenge Theatre 1900 
15:55  16:15  Meike Hatzel (TU Berlin), Polynomial Planar Directed Grid Theorem, Fletcher Challenge Theatre 1900 
16:20  16:40  Sándor KisfaludiBak (Eindhoven University of Technology), ETHtight exact algorithm for Euclidean TSP, Fletcher Challenge Theatre 1900 
16:45  17:05  Jesper Nederlof (Eindhoven University of Technology), Towards Faster Exponential Time Algorithms for Subset Sum, Fletcher Challenge Theatre 1900 
17:10  17:30  Marcin Pilipczuk (University of Warsaw), On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs, Fletcher Challenge Theatre 1900 

Discrete geometry (IM12) 
Org: Agelos Georgakopoulos (University of Warwick, UK) 
This minisymposium will highlight recent developments in various aspects of discrete mathematics that have a geometric flavour. The topics covered include extremal geometry, geometry of surfaces, and tilings. 

Tuesday May 28 
15:30  15:50  Nóra Frankl (London School of Economics), Nearly kdistance sets, Sauder Industries Policy Room 2270 
15:55  16:15  Arnaud de Mesmay (Grenoble), Bridges between embedded graphs and the geometry of surfaces, Sauder Industries Policy Room 2270 
16:20  16:40  John Haslegrave (University of Warwick), Spanning surfaces in 3uniform hypergraphs, Sauder Industries Policy Room 2270 
16:45  17:05  Andrew Vince (University of Florida), A Combinatorial Construction of Self Similar Tilings, Sauder Industries Policy Room 2270 

Enumerative combinatorics I (IM13) 
Org: Sergi Elizalde (Dartmouth College, USA) 
Enumerative combinatorics deals with the number of ways that discrete structures can be formed. Counting problems appear throughout mathematics, and also in statistical mechanics, computer science, and computational biology. This session explores recent work in theoretical and applied aspects of enumerative combinatorics, with an emphasis on the exact and asymptotic enumeration of permutations, tableaux, partitions, lattice walks and graphs. 

Thursday May 30 
15:30  15:50  Jessica Striker (North Dakota State University), Sign matrix polytopes from Young tableaux, Earl and Jennie Lohn Policy Room 7000 
15:55  16:15  Ae Ja Yee (Penn State), A lecture hall theorem for mfalling partitions, Earl and Jennie Lohn Policy Room 7000 
16:20  16:40  Michael Albert (University of Otago), Wilfequivalence and Wilfcollapse, Earl and Jennie Lohn Policy Room 7000 
16:45  17:05  Miklos Bona (University of Florida), Pattern avoidance in permutations and their squares, Earl and Jennie Lohn Policy Room 7000 
17:10  17:30  Jay Pantone (Marquette University), How many chord diagrams have no short chords?, Earl and Jennie Lohn Policy Room 7000 

Enumerative combinatorics II (IM14) 
Org: Sergi Elizalde (Dartmouth College, USA) 
Enumerative combinatorics deals with the number of ways that discrete structures can be formed. Counting problems appear throughout mathematics, and also in statistical mechanics, computer science, and computational biology. This session explores recent work in theoretical and applied aspects of enumerative combinatorics, with an emphasis on the exact and asymptotic enumeration of permutations, tableaux, partitions, lattice walks and graphs. 

Friday May 31 
10:30  10:50  Alejandro Morales (University of Massachusetts Amherst), Analogues of factorization problems of permutations in other groups, Fletcher Challenge Theatre 1900 
10:55  11:15  Greta Panova (University of Pennsylvania / University of Southern California), Hooklength formulas for skew shapes, Fletcher Challenge Theatre 1900 
11:20  11:40  Sylvie Corteel (CNRS Université Paris Diderot), Bounded Lecture Hall Tableaux, Fletcher Challenge Theatre 1900 
11:45  12:05  Marc Noy (Universitat Politecnica de Catalunya), Counting labelled 4regular planar graphs, Fletcher Challenge Theatre 1900 
12:10  12:30  Andrew Rechnitzer (University of British Columbia), Some cogrowth problems, Fletcher Challenge Theatre 1900 

Extremal combinatorics (IM15) 
Org: Joonkyung Lee (University of Oxford, UK) 
Extremal combinatorics studies how large (or small) a combinatorial parameter can be under a certain restriction. This minisymposium will cover a wide range of modern results in the area that connect to probability, analysis, algebra, and number theory. 

Wednesday May 29 
15:30  15:50  Jacques Verstraete (UC San Diego), Generalized Tur\'{a}n Numbers for Hypergraphs, Segal Centre 14001410 
15:55  16:15  Maya Stein (Universidad de Chile), Clique immersions and independence number, Segal Centre 14001410 
16:20  16:40  Eoin Long (University of Oxford), Cyclecomplete Ramsey numbers, Segal Centre 14001410 
16:45  17:05  Alexander Sidorenko (New York), A bipartite Turán problem for quadruples, Segal Centre 14001410 
17:10  17:30  Felix Lazebnik (University of Delaware), Graphs defined by systems of multivariate polynomial equations, Segal Centre 14001410 

Graph decompositions (IM16) 
Org: Marthe Bonamy (Laboratoire Bordelais de Recherche en Informatique, France) 
Graph colourings and more generally graph decompositions play a central role in graph theory. When can we decompose a graph into simpler substructures? How many such substructures do we need? 

Wednesday May 29 
10:30  10:50  Fábio Botler (Universidade Federal do Rio de Janeiro), Gallai's Conjecture for TriangleFree Planar Graphs, Segal Centre 14001410 
10:55  11:15  Daniel Cranston (Virginia Commonwealth University), Circular Coloring of Planar Graphs, Segal Centre 14001410 
11:20  11:40  Natasha Morrison (University of Cambridge and IMPA), Partitioning the vertices of a torus into isomorphic subgraphs, Segal Centre 14001410 
11:45  12:05  Tom Kelly (University of Waterloo), Fractional Coloring with Local Demands, Segal Centre 14001410 

Matroid theory I (IM17) 
Org: Peter Nelson (University of Waterloo) 
Matroids are combinatorial objects whose definition captures the abstract essence of dependence and independence. Today they arise naturally in many areas including graph theory, polyhedral theory, linear algebra and algebraic geometry.
Speakers in this session will talk on a range of topics on the combinatorial side of matroid theory. 

Friday May 31 
10:30  10:50  Dillon Mayhew (Victoria University of Wellington), Axiomatising bicircular matroids, Segal Centre 14001410 
10:55  11:15  Joseph Bonin (George Washington University), New connections between polymatroids and graph coloring, Segal Centre 14001410 
11:20  11:40  Rutger Campbell (University of Waterloo), Complexity of Matroid Representability, Segal Centre 14001410 
11:45  12:05  Tara Fife (Louisiana State University), Matroids with a Cyclic Arrangement of Circuits and Cocircuits, Segal Centre 14001410 
12:10  12:30  Nathan Bowler (University of Hamburg), Flowers in infinite matroids, Segal Centre 14001410 

Matroid theory II (IM18) 
Org: Peter Nelson (University of Waterloo) 
Matroids are combinatorial objects whose definition captures the abstract essence of dependence and independence. Today they arise naturally in many areas including graph theory, polyhedral theory, linear algebra and algebraic geometry.
Speakers in this session will talk on a range of topics on the combinatorial side of matroid theory. 

Friday May 31 
15:30  15:50  Jorn van der Pol (University of Waterloo), Enumerating matroids of fixed rank, Segal Centre 14001410 
15:55  16:15  AnnKathrin Elm (University of Hamburg), Infinite (pseudo)flowers, Segal Centre 14001410 
16:20  16:40  Daryl Funk (Douglas College), Describing quasigraphic matroids, Segal Centre 14001410 
16:45  17:05  Zachary Walsh (University of Waterloo), Quadratically Dense Matroids, Segal Centre 14001410 

Random graphs (IM19) 
Org: Lutz Warnke (Georgia Institute of Technology, USA) 
The aim of the minisymposium is to bring together researchers working on different aspects of random graph theory (in particular different models and methods of analysis). 

Tuesday May 28 
10:30  10:50  Catherine Greenhill (UNSW Sydney), The number of spanning trees in random regular uniform hypergraphs, Segal Centre 14001410 
10:55  11:15  Jane Gao (University of Waterloo), Linear time uniform generation of random matrices with prescribed marginals, Segal Centre 14001410 
11:20  11:40  Lutz Warnke (Georgia Tech), The phase transition in the random dprocess, Segal Centre 14001410 
11:45  12:05  Pawel Pralat (Ryerson University), $k$regular subgraphs near the $k$core threshold of a random graph, Segal Centre 14001410 
12:10  12:30  Marc Noy (UPC), Logic of sparse random graphs, Segal Centre 14001410 

Structural graph theory I (IM20) 
Org: Sophie Spirkl (Princeton University, USA) 
Structural graph theory involves problems related to using graph structure (such as forbidden minors or induced subgraphs) for finding properties of a graph and conversely, characterizing graphs with certain properties in terms of their structure, as well as applications, such as efficient algorithms. 

Tuesday May 28 
10:30  10:50  Shenwei Huang (Wilfrid Laurier University), Colouring SquareFree Graphs without Long Induced Paths, Segal Centre 14201430 
10:55  11:15  David Wood (Monash University), The product structure of minorclosed classes, Segal Centre 14201430 
11:20  11:40  ChunHung Liu (Texas A&M University), Threshold probability for destroying large minimum degree subgraphs of an Hminor free graph, Segal Centre 14201430 
11:45  12:05  Piotr Micek (Jagiellonian University), Separating treechromatic number from pathchromatic number, Segal Centre 14201430 
12:10  12:30  James Davies (University of Waterloo), Circle graphs are polynomially $\chi$bounded, Segal Centre 14201430 

Structural graph theory II (IM21) 
Org: Sophie Spirkl (Princeton University, USA) 
Structural graph theory involves problems related to using graph structure (such as forbidden minors or induced subgraphs) for finding properties of a graph and conversely, characterizing graphs with certain properties in terms of their structure, as well as applications, such as efficient algorithms. 

Tuesday May 28 
15:30  15:50  Sangil Oum (KAIST), The ErdosHajnal property for graphs with no fixed cycle as a pivotminor, Segal Centre 14001430 
15:55  16:15  Rose McCarty (University of Waterloo), Decomposing a graph into odd trails, Segal Centre 14001430 
16:20  16:40  Bernard Lidický (Iowa State University), Coloring count cones of planar graphs, Segal Centre 14001430 
16:45  17:05  Vaidyanathan Sivaraman (Binghamton University), A tale of two graph invariants, Segal Centre 14001430 
17:10  17:30  Matt DeVos (Simon Fraser University), Immersion of 2Regular Digraphs, Segal Centre 14001430 