Final Program

Sponsored by the SIAM Activity Group on Discrete

The SIAG on focuses on combinatorics, , cryptography, discrete optimization, mathematical programming, coding theory, information theory, , and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing. This activity group provides an opportunity to unify pure discrete mathematics and areas of applied research such as computer science, operations research, combinatorics, and the social sciences. It organizes the SIAM Conference on Discrete Mathematics; co-sponsors, with ACM SIGACT, the annual Symposium on Discrete Algorithms; and sponsors minisymposia at SIAM meetings and conferences. The activity group also runs DM-Net, an electronic forum; publishes an electronic newsletter; and maintains a website and a member directory. Every two years, the activity group also awards the Dénes König Prize to a young researcher for outstanding research in the area of discrete mathematics.

Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 USA Telephone: +1-215-382-9800 Fax: +1-215-386-7999 Conference E-mail: [email protected] Conference Web: www.siam.org/meetings/ Membership and Customer Service: (800) 447-7426 (USA & Canada) or +1-215-382-9800 (worldwide) www.siam.org/meetings/dm18 2 SIAM Conference on Discrete Mathematics

Table of Contents Local Organizing Conference Location Committee All sessions and on-site registration Program-At-A-Glance… Michael Ferrara will take place on the University of ...... Separate handout University of Colorado Denver, USA Colorado, Denver campus located in the Tivoli Student Union and North General Information...... 2 Stephen Hartke Get-togethers...... 4 University of Colorado Denver, USA Classroom Building. Invited Plenary Presentations...... 5 Michael Jacobson Prize...... 8 University of Colorado Denver, USA Program Schedule...... 11 SIAM Registration Desk Speaker and Organizer Index...... 45 Florian Pfender University of Colorado Denver, USA The SIAM registration desk locations Conference Budget.... Inside Back Cover and hours are listed below: Hotel Floor Plan...... Back Cover Monday, June 4 Conference Themes 7:00 AM – 8:30 AM Organizing Committee Discrete Mathematics, including: Tivoli Student Union Turnhalle (TV 250) Atrium Co-Chairs Algebraic Combinatorics Jerry Griggs Combinatorial Algorithms 9:00 AM – 4:30 PM University of South Carolina, USA Combinatorial Number Theory North Classroom 1130 Entry Ravi Kumar Design Theory Google, Mountain View, USA Tuesday, June 5 Discrete Geometry 7:30 AM – 3:30 PM Enumeration North Classroom 1130 Entry Organizing Committee Extremal Combinatorics Wednesday, June 6 Graph Theory Massachusetts Institute of Technology, USA 7:30 AM – 3:30 PM Jennifer Tour Chayes Matroids North Classroom 1130 Entry Microsoft Research New England, USA Ordered Sets Bill Chen Probabilistic Combinatorics Thursday, June 7 Center for Combinatorics, Nankai University, 7:30 AM – 3:30 PM Ramsey Theory China North Classroom 1130 Entry Topological and Analytical Techniques Julia Chuzhoy Toyota Technological Institute at Chicago, in Combinatorics Friday, June 8 USA 7:30 AM – 10:30 AM North Classroom 1130 Entry David Conlon With connections to other disciplines, University of Oxford, United Kingdom including: Daniela Kühn Computational Child Care University of Birmingham, United Kingdom Conference attendees interested in child Combinatorial Scientific Computing David Shmoys care services can visit www.care.com. , USA Computer Science Attendees are responsible for making Angelika Stege Game Theory their own child care arrangements. ETH Zürich, Switzerland Prasad Tetali Optimization Georgia Institute of Technology, USA Probability Michelle Wachs University of Miami, USA Statistical SIAM Conference on Discrete Mathematics 3

Corporate Members Mentor Graphics If you are not a SIAM member and paid and Affiliates National Institute of Standards and the Non-Member or Non-Member Mini Technology (NIST) Speaker/Organizer rate to attend the SIAM corporate members provide conference, you can apply the difference their employees with knowledge about, National Security Agency (DIRNSA) between what you paid and what a access to, and contacts in the applied Naval PostGrad member would have paid ($140 for a mathematics and computational sciences Oak Ridge National Laboratory, managed Non-Member and $70 for a Non-Member community through their membership Mini Speaker/Organizer) towards a benefits. Corporate membership is more by UT-Battelle for the Department of Energy SIAM membership. Contact SIAM than just a bundle of tangible products Customer Service for details or join at Sandia National Laboratories and services; it is an expression of the conference registration desk. support for SIAM and its programs. Schlumberger-Doll Research SIAM is pleased to acknowledge its United States Department of Energy corporate members and sponsors. In If you are a SIAM member, it only costs recognition of their support, non-member U.S. Army Corps of Engineers, Engineer $15 to join the SIAM Activity Group attendees who are employed by the Research and Development Center on the Discrete Mathematics (SIAG/ following organizations are entitled to US Naval Research Labs DM). As a SIAG/DM member, you are the SIAM member registration rate. eligible for an additional $15 discount on this conference, so if you paid List current April 2018. the SIAM member rate to attend the Corporate/Institutional conference, you might be eligible for a free SIAG/DM membership. Check at the Members Funding Agency registration desk. The Aerospace Corporation SIAM and the conference organizing Air Force Office of Scientific Research committee wish to extend their thanks Free Student Memberships are available and appreciation to the U.S. National Amazon to students who attend an institution that Science Foundation for its support of this Aramco Services Company is an Academic Member of SIAM, are conference. Bechtel Marine Propulsion Laboratory members of Student Chapters of SIAM, or are nominated by a Regular Member The Boeing Company of SIAM. CEA/DAM Department of National Defence (DND/ Join onsite at the registration desk, go to CSEC) www.siam.org/joinsiam to join online or DSTO- Defence Science and Technology download an application form, or contact Organisation Join SIAM and save! SIAM Customer Service: Exxon Mobil Leading the applied Telephone: +1-215-382-9800 Hewlett-Packard mathematics community . . . (worldwide); or 800-447-7426 (U.S. and Canada only) Huawei FRC French R&D Center SIAM members save up to $140 on IBM Corporation full registration for the 2018 SIAM Fax: +1-215-386-7999 Conference on Discrete Mathematics! IDA Center for Communications E-mail: [email protected] Join your peers in supporting the Research, La Jolla premier professional society for applied IDA Center for Communications mathematicians and computational Research, Princeton scientists. SIAM members receive IFP Energies nouvelles subscriptions to SIAM Review, SIAM News and SIAM Unwrapped, and enjoy Institute for Defense Analyses, Center substantial discounts on SIAM books, for Computing Sciences journal subscriptions, and conference Lawrence Berkeley National Laboratory registrations. Lawrence Livermore National Labs Lockheed Martin Los Alamos National Laboratory Max-Planck-Institute for Dynamics of Complex Technical Systems 4 SIAM Conference on Discrete Mathematics

Standard Audio-Visual Set- Conference Sponsors sexual orientation, race, color, national or ethnic origin, religion or religious (Sponsor of the Dénes König Prize) Up in Meeting Rooms belief, age, marital status, disabilities, SIAM does not provide computers for veteran status, field of expertise, or any any speaker. When giving an electronic other reason not related to scientific merit. presentation, speakers must provide This philosophy extends from SIAM their own computers. SIAM is not conferences, to its publications, and to its responsible for the safety and security of governing structures and bodies. We expect speakers’ computers. all members of SIAM and participants A data (LCD) projector and screen will in SIAM activities to work towards this be provided in all technical session commitment. meeting rooms. The data projectors support both VGA and HDMI Please Note connections. Presenters requiring an Name Badges SIAM is not responsible for the safety alternate connection must provide their and security of attendees’ computers. Do own adaptor. A space for emergency contact information is provided on the back of not leave your personal electronic devices your name badge. Help us help you in unattended. Please remember to turn off the event of an emergency! your cell phones and other devices during Internet Access sessions. All conference attendees will have access through an open network called Comments? “Cu Denver Guest.” Comments about SIAM meetings are Recording of Presentations encouraged! Please send to: Cynthia Audio and video recording of presentations Phillips, SIAM Vice President for at SIAM meetings is prohibited without Registration Fee Includes Programs ([email protected]). the written permission of the presenter and • Admission to all technical sessions SIAM. • Business Meeting (open to SIAG/DM members) Get-togethers Social Media Welcome Reception • Coffee breaks daily SIAM is promoting the use of social • Room set-ups and audio/visual Monday, June 4 media, such as Facebook and Twitter, in equipment 5:15 PM – 7:15 PM order to enhance scientific discussion at its • Welcome Reception meetings and enable attendees to connect with each other prior to, during and after Business Meeting conferences. If you are tweeting about Job Postings (open to SIAG/DM members) a conference, please use the designated Please check with the SIAM registration Wednesday, June 6 hashtag to enable other attendees to keep desk regarding the availability of job 5:30 PM – 6:30 PM up with the Twitter conversation and to postings or visit http://jobs.siam.org . allow better archiving of our conference Complimentary refreshments will be discussions. The hashtag for this meeting served. is #SIAMDM18. SIAM Books and Journals SIAM’s Twitter handle is Statement on Inclusiveness @TheSIAMNews. Display copies of books and complimentary copies of journals are As a professional society, SIAM is available on site. SIAM books are committed to providing an inclusive available at a discounted price during climate that encourages the open Changes to the Printed the conference. Titles on display forms expression and exchange of ideas, that Program is free from all forms of discrimination, are available with instructions on how to The printed program and abstracts were place a book order. harassment, and retaliation, and that is welcoming and comfortable to all current at the time of printing, however, Table Top Display members and to those who participate please review the online program schedule (http://meetings.siam.org/program. Cambridge University Press in its activities. In pursuit of that commitment, SIAM is dedicated to the cfm?CONFCODE=DM18 ). philosophy of equality of opportunity and treatment for all participants regardless of gender, gender identity or expression, SIAM Conference on Discrete Mathematics 5

Invited Plenary Speakers The SIAM 2018 Events Mobile App Powered by TripBuilder® To enhance your conference experience, we’re providing a state-of-the-art mobile Monday, June 4 app to give you important conference information right at your fingertips. With this TripBuilder EventMobile™ app, you 8:15 AM - 9:00 AM can: Analytic Methods in Graph Theory • Create your own custom schedule IP1 • View Sessions, Speakers, ExhibitorsDaniel and Kral, University of Warwick, United Kingdom more • Take notes and export them to your emailTivoli Student Union Turnhalle (TV 250) • View Award-Winning TripBuilder Recommendations for the meeting location • Get instant Alerts about important 1:30 PM - 2:15 PM conference info IP2 Interpolation Polynomials, Operator Method, and Theory of Enumeration Catherine Yan, Texas A&M University, USA Scan the QR code with any QR reader and download the TripBuilder EventMobile™Tivoli Student Union Turnhalle (TV 250) app to your iPhone, iPad, iTouch or Android mobile device. You can also visit www.tripbuildermedia.com/apps/ siamevents Tuesday, June 5

8:15 AM - 9:00 AM IP3 Title Not Available at Time of Publication Anna R. Karlin, , USA North Classroom 1130 6 SIAM Conference on Discrete Mathematics

Invited Plenary Speakers

Wednesday, June 6

8:15 AM - 9:00 AM IP4 Waiter-Client Games Michael Krivelevich, Tel Aviv University, Israel North Classroom 1130

1:30 PM - 2:15 PM IP5 New Developments in Hypergraph Ramsey Theory Andrew Suk, University of California, San Diego, USA North Classroom 1130 SIAM Conference on Discrete Mathematics 7

Invited Plenary Speakers

Thursday, June 7 8:15 AM - 9:00 AM IP6 Random Graph Processes Robert Morris, Institute for Pure and Applied Mathematics - IMPA , Brazil North Classroom 1130

1:30 PM - 2:15 PM IP7 Deciphering Cellular Networks: From Normal Functioning to Disease , , USA North Classroom 1130

Friday, June 8 8:15 AM - 9:00 AM IP8 Algorithms for the Asymmetric Traveling Salesman Problem Ola Svensson, École Polytechnique Fédérale de Lausanne, Switzerland North Classroom 1130 8 SIAM Conference on Discrete Mathematics

Prize Lecture ** The Dénes König Prize Lecture will take place in North Classroom 1130**

** The Dénes König Prize Lecture will take place in North Classroom 1130**

Tuesday, June 5 1:30 PM – 2:15 PM

SP1 2018 Dénes König Prize Lecture: Pseudorandom Graphs and the Green-Tao Theorem Yufei Zhao, Massachusetts Institute of Technology, USA SIAM Conference on Discrete Mathematics 9 10 SIAM Conference on Discrete Mathematics

SIAM Activity Group on Discrete Mathematics (SIAG/DM) www.siam.org/activity/dm A GREAT WAY TO GET INVOLVED! Collaborate and interact with mathematicians and applied scientists whose work involves Discrete Mathematics

ACTIVITIES INCLUDE: • Special Sessions at SIAM meetings • Biennial conference • Dénes König Prize

BENEFITS OF SIAG/UQ MEMBERSHIP: • Listing in the SIAG’s online membership directory • Additional $15 discount on registration at the SIAM Conference on Discrete Mathematics • Electronic communications about recent developments in your specialty • Eligibility for candidacy for SIAG/DM office • Participation in the selection of SIAG/DM officers

ELIGIBILITY: • Be a current SIAM member.

COST: • $15 per year • Student members can join 2 activity groups for free!

2018-19 SIAG/DM OFFICERS Chair: Bojan Mohar, Simon Fraser University Vice Chair: Blair Sullivan, North Carolina State University Program Director: Seshadhri Comandur, University of California, Santa Cruz Secretary: Richard Brewster, Thompson Rivers University

TO JOIN: SIAG/DM: my.siam.org/forms/join_siag.htm SIAM: www.siam.org/joinsiam SIAM Conference on Discrete Mathematics 11

Program Schedule 12 SIAM Conference on Discrete Mathematics SIAM Conference on Discrete Mathematics 13

Monday, June 4 Monday, June 4 Monday, June 4 IP1 Registration Analytic Methods in Graph 9:00 AM-4:00 PM Theory Room:North Classroom 1130 Entry Registration 8:15 AM-9:00 AM 7:00 AM-8:30 AM Room:Tivoli Student Union Turnhalle (TV Room:Tivoli Student Union Turnhalle 250) MS1 (TV 250) Atrium Chair: To Be Determined Combinatorics of Partially At 8:30 AM, registration will move to North The theory of graph limits provides Ordered Sets - Part I of III Classroom 1130 Entry. analytic tools to study large graphs. 9:30 AM-12:00 PM Such tools have found applications in various areas of computer science Room:North Classroom 1604 Opening Remarks and mathematics; they are also closely For Part 2 see MS6 linked to the flag algebra method, which Over the past 10 years there has been 8:00 AM-8:15 AM changed the landscape of extremal a resurgence of research into the Room:Tivoli Student Union Turnhalle (TV combinatorics. We will present an combinatorics of partially ordered sets, 250) introduction to this rapidly developing including significant progress on old area of graph theory and survey some conjectures, applications of classical of the recent results obtained in the techniques to seemingly unrelated area. problems in other areas of mathematics, and novel connections between well- Daniel Kral studied areas. The goal of this mini- University of Warwick, United Kingdom symposium is to continue the growth of this area by bringing together senior and junior researchers working on the combinatorics of partially ordered sets. Coffee Break Organizer: Mitchel T. Keller 9:00 AM-9:30 AM Washington and Lee University, USA Room:Tivoli Student Union Turnhalle Organizer: Stephen J. Young (TV 250) Atrium Pacific Northwest National Laboratory, USA 9:30-9:55 Hereditary Semiorders and Enumeration of Semiorders by Dimension (Part I) Mitchel T. Keller, Washington and Lee University, USA; Stephen J. Young, Pacific Northwest National Laboratory, USA 10:00-10:25 Hereditary Semiorders and Enumeration of Semiorders by Dimension (Part II) Mitchel T. Keller, Washington and Lee University, USA; Stephen J. Young, Pacific Northwest National Laboratory, USA 10:30-10:55 A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and k Simona Boyadzhiyska, Freie Universitaet Berlin, Germany; Garth T. Isaak, Lehigh University, USA; Ann N. Trenk, Wellesley College, USA 11:00-11:25 A Note on the Size of N-free Families Shanise Walker and Ryan R. Martin, Iowa State University, USA 14 SIAM Conference on Discrete Mathematics

Monday, June 4 Monday, June 4 Monday, June 4 MS2 MS3 MS4 Structural Graph Theory - Graph Coloring - Part I of II Discrete Random Processes - Part I of III 9:30 AM-12:00 PM Part I of II 9:30 AM-12:00 PM Room:North Classroom 1005 9:30 AM-12:00 PM Room:North Classroom 1130 For Part 2 see MS8 Room:North Classroom 1003 For Part 2 see MS7 Graph coloring is a central area of For Part 2 see MS10 Structural theorems in graph theory seek discrete mathematics, and it is widely The analysis of discrete random to describe all the graphs with satisfying studied. In this minisymposium we will processes is a central topic in the fields some desirable property by showing such hear about recent developments in the of probabilistic combinatorics and graphs either fall into one of a number area. random graph theory, and has important of basic classes or can be decomposed Organizer: Daniel Cranston applications to extremal combinatorics. into smaller graphs. The methodology Virginia Commonwealth University, USA In this minisymposium, researchers will has shown to be extremely effective share recent results in the area including in proving both theoretical results as 9:30-9:55 Acyclic Edge-coloring of dynamic concentration and the so-called Planar Graphs: Delta Colors Suffice well as in the development of efficient when Delta is Large “differential equations method” and its algorithms. Daniel Cranston, Virginia Commonwealth applications. Organizer: Paul Wollan University, USA Organizer: Deepak Bal University of Rome La Sapienza, Italy 10:00-10:25 Characterization of Montclair State University, USA Cycle Obstruction Sets for Improper 9:30-9:55 Large Independent Sets Organizer: Patrick Bennett in Triangle-free Graphs Avoiding a Coloring Planar Graphs Western Michigan University, USA Clique-minor Ilkyoo Choi, Hankuk University of Foreign Zdenek Dvorak, Charles University, Czech Studies, Korea 9:30-9:55 The Bipartite K2,2 -Free Republic; Liana Yepremyan, University of 10:30-10:55 Distributed Coloring with Process and Ramsey Numbers Oxford, United Kingdom Fewer Colors Patrick Bennett, Western Michigan University, USA 10:00-10:25 Hereditary Families with Marthe Bonamy, LaBRI, Université de Atypical Structure Bordeaux, and CNRS, France 10:00-10:25 A Probabilistic Approach Sergey Norin, McGill University, Canada; 11:00-11:25 Vector Coloring the Towards the Aharoni-Berger Yelena Yuditsky, Karlsruhe Institute of Categorical Product of Graphs Conjecture on Rainbow Matchings Technology, Germany Robert Šámal, Charles University, Czech Pu Gao, Monash University, Australia 10:30-10:55 Polynomial-time Algorithm Republic 10:30-10:55 Domination in Random for Maximum Weight Independent Set 11:30-11:55 Vertex Partition with Regular Graphs and in Graphs with on P6-free Graphs Average Degree Constraint Large Girth Andrzej Grzesik, University of Warwick, Hehui Wu, Shanghai Center for Carlos Hoppen and Giovane Mansan, Federal United Kingdom; Tereza Klimosova, Mathematical Sciences, China University of Rio Grande do Sul, Brazil Charles University, Czech Republic; 11:00-11:25 The Size of the Giant Marcin Pilipczuk and Michal Pilipczuk, Component in the D-Process University of Warsaw, Poland Laura Eslava, Georgia Institute of 11:00-11:25 Erdös-Pósa Property of Technology, USA Chordless Cycles and its Applications 11:30-11:55 Packing Edge-disjoint O-Joung Kwon, Incheon National University, Spanning Trees in Random Geometric Korea; Eun Jung Kim, Universite Paris Graphs Dauphine and CNRS, France Pu Gao, Monash University, Australia; 11:30-11:55 The Grid Theorem for Xavier Perez-Gimenez, University of Rank-Width Nebraska-Lincoln, USA; Cristiane M. Sato, Jim Geelen, University of Waterloo, University of Waterloo, Canada Canada; O-Joung Kwon, Incheon National University, Korea; Rose McCarty, University of Waterloo, Canada; Paul Wollan, University of Rome La Sapienza, Italy SIAM Conference on Discrete Mathematics 15

Monday, June 4 Monday, June 4 Monday, June 4 MS5 CP1 CP2 Extremal Problems Involving Networks Directed Graphs Cycles and Trees - Part I of II 9:30 AM-11:10 AM 9:30 AM-11:10 AM 9:30 AM-11:30 AM Room:North Classroom 1606 Room:North Classroom 1607 Room:North Classroom 1806 Chair: To Be Determined Chair: To Be Determined For Part 2 see MS11 9:30-9:45 Algebraic Analysis of Spiking 9:30-9:45 Proper Orientations of Planar Extremal combinatorics is the study Neural Networks for Graph Partitioning Bipartite Graphs of questions of the form “How large Kathleen Hamilton, Catherine Schuman, Sebastian Gonzalez Hermosillo De La and does a parameter of a graph G need and Travis Humble, Oak Ridge National Fiachra Knox, Simon Fraser University, to be to guarantee that G contains a Laboratory, USA Canada; Naoki Matsumoto, Seikei University, Japan; Bojan Mohar, Simon certain substructure?” In addition to 9:50-10:05 Approximating Sparse being interesting on their own right, Graphs: the Random Overlapping Fraser University, Canada; Claudia problems in extremal combinatorics are Communities Model Linhares Sales, Federal University of Ceará, Brazil important because they occur in many Samantha N. Petti and Santosh Vempala, other branches of mathematics as well Georgia Institute of Technology, USA 9:50-10:05 Cyclic Triangle Factors in Regular Tournaments as computer science. Additionally, many 10:10-10:25 Robust Maximal useful methods, such as the probabilistic Independent Sets Theodore Molla, University of South Florida, USA; Lina Li, University of Illinois at method and regularity, have arisen from Kevin C. Halasz, Simon Fraser University, Urbana-Champaign, USA the study of extremal combinatorics. The Canada; Arnaud Casteigts, Universite de aim of this minisymposium is to bring Bordeaux I, France; Luis Goddyn, Simon 10:10-10:25 A Matrix Approach to together promising young researchers in Fraser University, Canada p-Competition Graphs extremal combinatorics. We will discuss 10:30-10:45 Large Degree Asymptotics Taehee Hong, Suh-Ryung Kim, and Seung recent progress on important conjectures, and the Reconstruction Threshold of Chul Lee, Seoul National University, Korea new methods developed to solve them, Asymmetric Ising Model on Regular 10:30-10:45 On 1-Factors with and interesting new problems in the area. D-Ary Trees Prescribed Lengths in Tournaments We will particularly focus on extremal Wenjian Liu, City University of New York, Dongyeap Kang, Korea Advanced Institute of problems involving sparse structures such USA Science and Technology, Korea; Jaehoon as cycles, trees and hypercubes. Such 10:50-11:05 Dynamical Stability Kim, University of Birmingham, United problems are usually much harder then Despite Time-Varying Network Kingdom ones involving dense structures. However, Structure 10:50-11:05 Simple Transformation recently various new methods have been David Reber and Benjamin Webb, Brigham for Finding a Maximum Weighted found for studying sparse structures e.g. Young University, USA Matching in General Digraphs the hypergraph container method. We hope Choon Sung Lim, Bank of Korea, South that gathering researchers working on such Korea problems will encourage the exchange of ideas, leading to further progress in the area. Lunch Break Organizer: Shoham Letzter 12:00 PM-1:30 PM University of Cambridge, United Kingdom Attendees on their own Organizer: Alexey Pokrovskiy ETH Zürich, Switzerland 9:30-9:55 Rainbow Trees Alexey Pokrovskiy, ETH Zürich, Switzerland 10:00-10:25 Three Colour Bipartite Ramsey Number of Cycles and Paths Matija Bucic, Shoham Letzter, and Benjamin Sudakov, ETH Zürich, Switzerland 10:30-10:55 A Stability Theorem for Small Cycle Covers Frank Mousset, Tel Aviv University, Israel 11:00-11:25 Linear Cycles of Consecutive Lengths in Linear Hypergraphs Liana Yepremyan, University of Oxford, United Kingdom 16 SIAM Conference on Discrete Mathematics

Monday, June 4 Monday, June 4 Monday, June 4 IP2 MS6 MS7 Interpolation Polynomials, Combinatorics of Partially Structural Graph Theory - Operator Method, and Ordered Sets - Part II of III Part II of III Theory of Enumeration 2:45 PM-5:15 PM 2:45 PM-4:45 PM 1:30 PM-2:15 PM Room:North Classroom 1604 Room:North Classroom 1130 Room:Tivoli Student Union Turnhalle (TV For Part 1 see MS1 For Part 1 see MS2 250) For Part 3 see MS12 For Part 3 see MS13 Over the past 10 years there has been Structural theorems in graph theory seek Chair: To Be Determined a resurgence of research into the to describe all the graphs with satisfying Goncarov Polynomials are the basis combinatorics of partially ordered sets, some desirable property by showing such of solutions of the classical Goncarov including significant progress on old graphs either fall into one of a number Interpolation Problem, which have been conjectures, applications of classical of basic classes or can be decomposed studied extensively by analysts due to techniques to seemingly unrelated into smaller graphs. The methodology their significance in the interpolation problems in other areas of mathematics, has shown to be extremely effective theory of smooth and analytic functions. and novel connections between well- in proving both theoretical results as These Polynomials also play an important studied areas. The goal of this mini- well as in the development of efficient role in combinatorics due to their close symposium is to continue the growth algorithms. relations to parking functions. This is not of this area by bringing together senior just a coincidence. In this talk we will and junior researchers working on the Organizer: Paul Wollan present the interpolation problems with combinatorics of partially ordered sets. University of Rome La Sapienza, Italy delta-operators, develop the algebraic 2:45-3:10 Scattered Classes of Graphs and analytic theory of delta-Goncarov Organizer: Mitchel T. Keller O-Joung Kwon, Incheon National University, polynomials, and apply these results to Washington and Lee University, USA Korea; Sang-Il Oum, KAIST, Korea problems in binomial enumeration and Organizer: Stephen J. Young 3:15-3:40 On the Genus of the order statistics. Pacific Northwest National Laboratory, USA Complete 3-uniform Hypergraph Bojan Mohar and Yifan Jing, Simon Fraser Catherine Yan 2:45-3:10 Local Dimension is University, Canada Texas A&M University, USA Unbounded for Planar Posets Bartlomiej Bosek, Jagiellonian University, 3:45-4:10 The Genus of a Random Poland; Jaroslaw Grytczuk, Warsaw Bipartite Graph University of Technology, Poland; William Yifan Jing and Bojan Mohar, Simon Fraser T. Trotter, Georgia Institute of Technology, University, Canada Coffee Break USA 4:15-4:40 Half-integral Linkages in 2:15 PM-2:45 PM 3:15-3:40 Fractional Local Dimension Highly Connected Directed Graphs Fidel Barrera-Cruz, Thomas Prag, Heather Irene Muzi, University of Warsaw, Poland; Room:Tivoli Student Union Turnhalle C. Smith, and William T. Trotter, Georgia Paul Wollan, University of Rome La (TV 250) Atrium Institute of Technology, USA Sapienza, Italy; Katherine Edwards, Nokia Bell Labs, USA 3:45-4:10 Dimension and Subdivision of K4 Free Posets Adam Bamforth, University of Louisville, USA 4:15-4:40 Partially Ordered Sets and Finite Topologies Emilie Purvine, Cliff Joslyn, and Brenda Praggastis, Pacific Northwest National Laboratory, USA; Michael Robinson, American University, USA 4:45-5:10 A Random Version of the r-fork-free Theorem Kirsten Hogenson, Colorado College, USA SIAM Conference on Discrete Mathematics 17

Monday, June 4 Monday, June 4 2:45-3:10 Secure Distributed Storage and Its Connections to MS8 MS9 Communication-efficient Secret Sharing Graph Coloring - Part II of II Secret Sharing at the Ankit Rawat, Massachusetts Institute of 2:45 PM-5:15 PM Intersection of Cryptography Technology, USA Room:North Classroom 1539 and Coding Theory 3:15-3:40 Staircase Codes for Secret Sharing and Private Information For Part 1 see MS3 2:45 PM-5:15 PM Retrieval Graph coloring is a central area of Room:North Classroom 1606 Salim El Rouayheb, Rutgers University, USA discrete mathematics, and it is widely Secret sharing is an important primitive 3:45-4:10 Homomorphic Secret studied. In this minisymposium we will in cryptography, allowing n parties to Sharing, or: Locally Decodable Codes hear about recent developments in the share a secret, x, so that “qualified” for Functions (Part 1) area. subsets of parties can recover the secret, Yuval Ishai, Technion, Israel Organizer: Daniel Cranston but an “unqualified” subsets of parties 4:15-4:40 Homomorphic Secret Virginia Commonwealth University, USA learn nothing about the secret. There Sharing, or: Locally Decodable Codes 2:45-3:10 Bounding the Chromatic are rich connections between secret for Functions (Part 2) Number by a Fraction of the sharing and error correcting codes, and Elette Boyle, Interdisciplinary Center Maximum Degree for Graphs with no this mini-symposium will bring together Herzliya, Israel Large Cliques researchers working at this intersection 4:45-5:10 Coding for Private Function Thomas Kelly, University of Waterloo, to discuss their work and share ideas. Computation Canada Secret sharing has found numerous Joerg Kliewer, New Jersey Institute of 3:15-3:40 Circular Flow and Circular applications in theoretical and real- Technology, USA Coloring of Graphs world cryptographic constructions, and Jiaao Li, West Virginia University, USA these cryptographic applications have motivated many variations and extensions 3:45-4:10 4-coloring P6-free Graphs Sophie Spirkl, Princeton University, USA of the basic definitions, including robust, verifiable, pseudorandom, and 4:15-4:40 Clustered Coloring, Hajos’ homomorphic secret sharing, among Conjecture and Gerards-Seymour Conjecture others. Ideas from coding theory have Chun-Hung Liu, Princeton University, USA been a key tool in the approach of many of these problems, going all the 4:45-5:10 Coloring (2K2, W4)-Free way back to the Shamir secret sharing Graphs scheme, which is essentially a Reed- Aurélie Lagoutte, University Clermont- Solomon code. However, more recent Auvergne, France advances have including connections throughout coding theory, in particular to locally decodable codes and coding for distributed storage. This minisymposium will highlight recent research on secret sharing across the fields of cryptography, theoretical computer science and electrical engineering, with the aim to strengthen the ties between these fields. Organizer: Mary Wootters Stanford University, USA Organizer: Brett Hemenway University of Pennsylvania, USA

continued in next column 18 SIAM Conference on Discrete Mathematics

Monday, June 4 Monday, June 4 2:45-3:10 Path Partitions of Regular Graphs MS10 MS11 Shoham Letzter, University of Cambridge, United Kingdom Discrete Random Processes Extremal Problems Involving 3:15-3:40 Generalized Turan Problem - Part II of II Cycles and Trees - for Trees 2:45 PM-4:45 PM Part II of II Clara Shikhelman, Tel Aviv University, Israel Room:North Classroom 1003 2:45 PM-4:45 PM 3:45-4:10 Maximising the Number of Induced Cycles in a Graph For Part 1 see MS4 Room:North Classroom 1806 Natasha Morrison, University of Cambridge, The analysis of discrete random For Part 1 see MS5 United Kingdom processes is a central topic in the fields Extremal combinatorics is the study 4:15-4:40 Incomplete Tilings of probabilistic combinatorics and of questions of the form “How large random graph theory, and has important Vytautas Gruslys, University of Cambridge, does a parameter of a graph G need United Kingdom applications to extremal combinatorics. to be to guarantee that G contains a In this minisymposium, researchers will certain substructure?” In addition to share recent results in the area including being interesting on their own right, dynamic concentration and the so-called problems in extremal combinatorics are “differential equations method” and its important because they occur in many applications. other branches of mathematics as well Organizer: Deepak Bal as computer science. Additionally, many Montclair State University, USA useful methods, such as the probabilistic method and regularity, have arisen from Organizer: Patrick Bennett the study of extremal combinatorics. The Western Michigan University, USA aim of this minisymposium is to bring 2:45-3:10 Embedding the Uniform together promising young researchers in Random Graph into the Bipartite extremal combinatorics. We will discuss Regular Random Graph recent progress on important conjectures, Tereza Klimosova, Charles University, Czech new methods developed to solve them, Republic; Christian Reiher, University of and interesting new problems in the area. Hamburg, Germany; Andrzej Rucinski, We will particularly focus on extremal Adam Mickiewicz University, Poland, and problems involving sparse structures such Emory University, USA; Matas Sileikis, as cycles, trees and hypercubes. Such Czech Academy of Sciences, Czech Republic problems are usually much harder then ones involving dense structures. However, 3:15-3:40 Packing Nearly Optimal recently various new methods have been Ramsey R(3,t) Graphs found for studying sparse structures e.g. He Guo and Lutz Warnke, Georgia Institute the hypergraph container method. We of Technology, USA hope that gathering researchers working 3:45-4:10 Assessing Significance in a on such problems will encourage the Markov Chain Without Mixing exchange of ideas, leading to further Wes Pegden, Carnegie Mellon University, progress in the area. USA 4:15-4:40 Minimizing the Number of Organizer: Shoham Letzter 5-cycles in Graphs with Given Edge- University of Cambridge, United Kingdom density Organizer: Alexey Pokrovskiy Andrzej Dudek, Western Michigan University, ETH Zürich, Switzerland USA

continued in next column continued on next page SIAM Conference on Discrete Mathematics 19

Tuesday, June 5 Monday, June 4 Tuesday, June 5 CP3 MS12 Algebraic Combinatorics/ Combinatorics of Partially Geometry Registration Ordered Sets - Part III of III 2:45 PM-5:15 PM 7:30 AM-3:30 PM 9:30 AM-11:30 AM Room:North Classroom 1607 Room:North Classroom 1130 Entry Room:North Classroom 1604 Chair: To Be Determined For Part 2 see MS6 2:45-3:00 Solving Tropical Linear Over the past 10 years there has been Systems in Terms of the Shortest Path Announcements a resurgence of research into the Problem 8:10 AM-8:15 AM combinatorics of partially ordered sets, Yuki Nishida, Doshisha University, Japan; including significant progress on old Sennosuke Watanabe, National Institute Room:North Classroom 1130 conjectures, applications of classical of Technology, Oyama College, Japan techniques to seemingly unrelated ; Yoshihide Watanabe, Doshisha University, problems in other areas of mathematics, Japan and novel connections between well- 3:05-3:20 Topology and Holomorphic IP3 studied areas. The goal of this mini- Invariants Using the Application of Title Not Available at Time symposium is to continue the growth Combinatorics of Publication of this area by bringing together senior Abdulsalam G. Ya’u, Abubakar Tafawa and junior researchers working on the Balewa University Bauchi, Nigeria; 8:15 AM-9:00 AM combinatorics of partially ordered sets. Mohammed Abdulhameed, Federal Polytechnic Bauchi, Nigeria Room:North Classroom 1130 Organizer: Mitchel T. Keller 3:25-3:40 Many k-Neighborly Chair: To Be Determined Washington and Lee University, USA Polytopes from Quivers Abstract Not Available At Time Of Organizer: Stephen J. Young Daniel Mckenzie, University of Georgia, Publication. Pacific Northwest National Laboratory, USA USA; Patricio Gallardo, Washington University, St. Louis, USA Anna R. Karlin 9:30-9:55 On the Dimension of Random Posets University of Washington, USA 3:45-4:00 On Generalized Csaba Biro, University of Louisville, USA; Quadrangles and Girth Eight Peter Hamburger, Western Kentucky Algebraically Defined Graphs University, USA; H. A. Kierstead, Arizona Brian Kronenthal, Kutztown University State University, USA; Attila Por, Western of Pennsylvania, USA; Felix Lazebnik, Coffee Break Kentucky University, USA; William University of Delaware, USA; Jason T. Trotter and Ruidong Wang, Georgia Williford, University of Wyoming, USA 9:00 AM-9:30 AM Institute of Technology, USA Room:North Classroom 1130 Atrium 10:00-10:25 The Width of Down Sets in Boolean Lattices Welcome Reception Dwight Duffus, Emory University, USA; David M. Howard, Colgate University, USA; Imre 5:15 PM-7:15 PM Leader, University of Cambridge, United Room:Tivoli Brewing Company Kingdom 10:30-10:55 Minimum Saturated Families of Sets Tuan Tran, Matija Bucic, Shoham Letzter, and Benny Sudakov, ETH Zürich, Switzerland 11:00-11:25 Whitney Duals of Graded Posets Joshua Hallam, Wake Forest University, USA 20 SIAM Conference on Discrete Mathematics

Tuesday, June 5 Tuesday, June 5 Tuesday, June 5 MS13 MS14 MS15 Structural Graph Theory - Graph Colouring - Part I of II Computational Biology - Part III of III 9:30 AM-12:00 PM Part I of II 9:30 AM-12:00 PM Room:North Classroom 1539 9:30 AM-12:00 PM Room:North Classroom 1130 For Part 2 see MS17 Room:North Classroom 1003 For Part 2 see MS7 In it’s broadest definition, graph For Part 2 see MS18 Structural theorems in graph theory coloring involves assigning labels This minisymposium surveys a host seek to describe all the graphs with (which might be colors, numbers, lists) of different topics where graph theory, satisfying some desirable property by to each vertex or edge of a graph using combinatorics, and discrete mathematics showing such graphs either fall into one stated restrictions, rules, and goals. Each more generally are making contributions of a number of basic classes or can be type of graph coloring has its own uses to computational biology. Part I focuses decomposed into smaller graphs. The and motivations. There are many forms on the analysis of biological networks. methodology has shown to be extremely of graph coloring. ‘Proper’ coloring, Part II looks at a range of topics effective in proving both theoretical list coloring, path coloring, fractional from biological networks to sequence results as well as in the development of coloring, distinguishing coloring are analysis, and circles back to new efficient algorithms. just a few of these. Graph theorists mathematical problems inspired by the who study various graph colorings biology. Organizer: Paul Wollan often find it useful to learn each others’ University of Rome La Sapienza, Italy motivations and methods. This session Organizer: Lenore J. Cowen 9:30-9:55 Coloring Graphs with No brings together researchers from a Tufts University, USA Clique Immersion variety of types of graph colorings in 9:30-9:55 Random Walk Methods Paul Wollan and Tommaso d’Orsi, order to encourage such sharing and and Their Application to Biological University of Rome La Sapienza, Italy productive cross fertilization. Networks 10:00-10:25 Caterpillars and the Lenore J. Cowen, Tufts University, USA Organizer: Debra L. Boutin Strong Erdos-Hajnal Property 10:00-10:25 Synthesizing Signaling Hamilton College, USA Anita Liebenau, Monash University, Pathways from Temporal Australia; Marcin Pilipczuk, University Organizer: Gary MacGillivray Phosphoproteomic Data of Warsaw, Poland; Paul Seymour and University of Victoria, Canada Anthony Gitter, University of Wisconsin, Sophie Spirkl, Princeton University, USA Madison, USA 9:30-9:55 Acyclic Colouring of 10:30-10:55 Obstructions for Three- Graphs on Surfaces 10:30-10:55 Integration and Coloring and List Three-Coloring Shayla Redlin and Luke Postle, University of Dissection of Molecular Networks H-Free Graphs Waterloo, Canada for Functional Analysis and Disease Maria Chudnovsky, Princeton University, Modeling USA; Jan Goedgebeur, Ghent University, 10:00-10:25 The Distinguishing Cost of Jian Peng, University of Illinois at Urbana- Belgium; Oliver Schaudt, RWTH Aachen, Graph Products Champaign, USA Germany; Mingxian Zhong, Columbia Debra L. Boutin, Hamilton College, USA 11:00-11:25 A Multi-Species University, USA 10:30-10:55 On Uniquely k-List Functional Embedding Integrating 11:00-11:25 Unavoidable Minors Colorable Graphs Sequence and Network Structure in 2-connected Graphs of Large Joan P. Hutchinson, Macalester College, Mark Leiserson, University of Maryland, Pathwidth USA; Ebad Mahmoodian, Sharif College Park, USA Tony Huynh and Gwenael Joret, Université University of Technology, Iran 11:30-11:55 Denoising Large Scale Libre de Bruxelles, Belgium; Piotr Micek, 11:00-11:25 Distinguishing Numbers of Molecular Profiling Data Using Jagiellonian University, Poland; David R. Partially Ordered Sets Network Filters Wood, Monash University, Australia Karen Collins, , USA; Andrew J. Kavran and Aaron Clauset, 11:30-11:55 Attacking Hadwiger’s Ann N. Trenk, Wellesley College, USA University of Colorado Boulder, USA Conjecture via Chordal Partitions 11:30-11:55 Arithmetic Progressions in David R. Wood, Monash University, Graphs Australia Michael Young, Iowa State University, USA SIAM Conference on Discrete Mathematics 21

Tuesday, June 5 9:30-9:55 Parking Distributions on Tuesday, June 5 Trees MS16 Catherine Yan, Texas A&M University, USA CP4 New Trends in Enumerative 10:00-10:25 Barely Set-valued Algorithms and Applications Tableaux and Nonintersecting Paths Combinatorics - Part I of II in Young Diagrams 9:30 AM-11:50 AM Peter L. Guo, Nankai University, China 9:30 AM-12:00 PM Room:North Classroom 1606 10:30-10:55 Mahonian-Stirling Room:North Classroom 1806 Chair: To Be Determined Statistics on Labeled Trees For Part 2 see MS19 Svetlana Poznanovikj and Amy Grady, 9:30-9:45 Polynomial Time Solution to The origin of algebraic combinatorics Clemson University, USA the Domino Puzzle lies in the desire to bring coherence and Ivan Avramovic, George Mason University, 11:00-11:25 Log-behavior of Partition unity to the discipline of combinatorics, USA Function in particular, enumeration, and to Xingwei Wang, Nankai University, China 9:50-10:05 The Solution Attractor incorporate it into the mainstream Theory of Local Search System: The of contemporary mathematics. 11:30-11:55 Counting with Borel’s Traveling Salesman Problem Case Triangle Today Algebraic and Enumerative Weiqi Li, University of Michigan-Flint, USA Combinatorics concerns itself with the Yue Cai and Catherine Yan, Texas A&M University, USA 10:10-10:25 Efficient Methods for study of combinatorial problems arising Enforcing Contiguity in Geographic from other branches of mathematics Districting Problems and, on the other hand, with the Sheldon H. Jacobson, University of Illinois application and use of techniques at Urbana-Champaign, USA; Douglas coming from other parts of mathematics King, University of Illinois, USA; Edward to combinatorial problems. At the heart Sewell, Southern Illinois University, of the subject there is the development Edwardsville, USA of algebraic theories for the solution to 10:30-10:45 Optimizing Order Picking such problems. The implied interactions Problem By a New Scalable Method with other fields are mutually beneficial Arash Ghasemi, University of Tennessee, and concern particularly Algebra, Chattanooga, SimCenter, USA Geometry, Topology, Computer Science, 10:50-11:05 Leximax and Leximin Probability Theory and Statistics. The Rank-Ordered Rules on the Power Set development of combinatorics requires with Discrete Categories a familiarity of several mathematical Takashi Kurihara, Waseda University, Japan branches for its researchers. This 11:10-11:25 Garden-of-Eden States minisymposium is proposed to facilitate and Fixed Points of Monotone Systems the contact between Enumerative and Ricky X. Chen, Virginia Tech, USA; Algebraic Combinatorics and other Christian Reidys and Henning Mortveit, fields in an effective way. It is aimed to Biocomplexity Institute, USA bring together a strong group of active 11:30-11:45 The Fullerene Project researchers in Algebraic Combinatorics Elizabeth Hartung, Massachusetts College of with an emphasis on Enumeration, as Liberal Arts, USA; Jack Graver, Syracuse well as other areas of mathematical University, USA sciences in which substantial enumerative questions with a strong algebraic or geometric foundation have arisen. Lunch Break Organizer: Catherine Yan 12:00 PM-1:30 PM Texas A&M University, USA Attendees on their own Organizer: Yue Cai Texas A&M University, USA

continued in next column 22 SIAM Conference on Discrete Mathematics

Tuesday, June 5 Tuesday, June 5 Tuesday, June 5 SP1 MS17 MS18 2018 Dénes König Prize Graph Colouring - Part II of Computational Biology - Lecture: Pseudorandom II Part II of II Graphs and the Green-Tao 2:45 PM-5:15 PM 2:45 PM-5:15 PM Theorem Room:North Classroom 1539 Room:North Classroom 1003 1:30 PM-2:15 PM For Part 1 see MS14 For Part 1 see MS15 Room:North Classroom 1130 This 2-part minisymposium will This minisymposium surveys a host showcase some of the many faces of of different topics where graph theory, Chair: To Be Determined graph colouring, arguably one of the combinatorics, and discrete mathematics The celebrated Green-Tao theorem most studied topics in graph theory. more generally are making contributions states that there are arbitrarily long Part I features talks on distinguishing to computational biology. Part I focuses arithmetic progressions in the primes. colourings where the colouring breaks on the analysis of biological networks. I will explain some of the main ideas the graph symmetry, list colourings Part II looks at a range of topics from of the proof from a graph theoretic where lists of colours are assigned biological networks to sequence analysis, perspective, with a focus on the role of to each vertex, and polychromatic and circles back to new mathematical pseudorandomness in the proof. (Based colourings where given subgraphs must problems inspired by the biology. on joint work with David Conlon and contain an element of each colour class. Jacob Fox) Part II features the following topics: Organizer: Lenore J. Cowen a coloring game, colourings in which Tufts University, USA Yufei Zhao colour classes may induce cliques 2:45-3:10 Network-based Investigation of Mutational Profiles Reveals Cancer Massachusetts Institute of Technology, USA or independent sets, the chromatic number of subgraphs of a clustered Genes graph, colouring with restrictions on the Borislav Hristov, Princeton University, USA number of times each colour can appear 3:15-3:40 New Directions in Coffee Break in any neighborhood, and structures Deconvolving Genomic Mixtures of 2:15 PM-2:45 PM that forbid generalized colourings (i.e., Copy Number Variation Data homomorphisms) of graphs with two Haoyun Lei, Theodore Roman, Jesse Eation, Room:North Classroom 1130 Atrium edge sets. and Russell Schwartz, Carnegie Mellon University, USA Organizer: Debra L. Boutin 3:45-4:10 Two Problems on Tree-based Hamilton College, USA Networks Organizer: Gary Macgillivray Megan Owen, City University of New York, USA University of Victoria, Canada 4:15-4:40 The Language of RNA Base 2:45-3:10 The Slow-Coloring Game Pairings Douglas B. West, Zhejiang Normal Christine Heitsch, Georgia Institute of University, China and University of Technology, USA; Svetlana Poznanovi , Illinois, USA ć Clemson University, USA; Torin 3:15-3:40 Fractional Cocolorings of Greenwood, Georgia Institute of Graphs Technology, USA John Gimbel, University of Alaska, 4:45-5:10 Multi de Bruijn Sequences Fairbanks, USA; Andre Kundgen, Glenn Tesler, University of California, San California State University, San Marcos, Diego, USA USA 3:45-4:10 The Selective Coloring Problem Tinaz Ekim, Bogazici University, Turkey 4:15-4:40 Homomorphism Duals for 2-Edge-Coloured Paths Kyle Booker and Richard Brewster, Thompson Rivers University, Canada 4:45-5:10 Frugal Colourings and Homomorphisms Gary MacGillivray, University of Victoria, Canada SIAM Conference on Discrete Mathematics 23

Tuesday, June 5 2:45-3:10 CLT for Descents in Tuesday, June 5 Matchings and Derangements MS19 Gene Kim, University of South Carolina, MS20 New Trends in Enumerative USA Linear Algebra Methods in Combinatorics - Part II of II 3:15-3:40 Two Types of Combinatorics Quasisymmetric Power Sums 2:45 PM-5:15 PM Angela Hicks, Lehigh University, USA; 2:45 PM-5:15 PM Cristina Ballantine, College of the Holy Room:North Classroom 1806 Room:North Classroom 1005 Cross, USA; Zajj Daugherty, The City For Part 1 see MS16 College of New York, USA; Sarah Mason, Linear algebraic methods provide The origin of algebraic combinatorics Wake Forest University, USA; Elizabeth powerful tools for answering questions lies in the desire to bring coherence and Niese, Marshall University, USA in combinatorics. Surprisingly, often the unity to the discipline of combinatorics, 3:45-4:10 Enumeration on Row- only solution for a purely combinatorial in particular, enumeration, and to increasing Tableaux of Shape 2 x n problem is found using linear algebra. incorporate it into the mainstream Ruoxia Du, East China Normal University, Recent representative applications of these of contemporary mathematics. China types of methods is the breakthrough Today Algebraic and Enumerative upper bound on the maximum size of 4:15-4:40 Detecting the Integer n Combinatorics concerns itself with the Decomposition Property and Ehrhart a 3-term AP free subset of F /3 and study of combinatorial problems arising Unimodality in Reflexive Simplices the recent constructions of smaller from other branches of mathematics and, Robert Davis, Michigan State University, counterexamples to Borsuk’s conjecture. on the other hand, with the application USA Our minisymposium will focus on and use of techniques coming from other 4:45-5:10 New Duals of MacMahon’s linear algebra methods with a special parts of mathematics to combinatorial Theorem on Plane Partitions emphasis on spectral graph theory. Often, problems. At the heart of the subject Tri Lai, University of Nebraska-Lincoln, USA spectral graph theory theorems can be there is the development of algebraic used to strengthen those in classical theories for the solution to such extremal graph theory. Our session problems. The implied interactions will bring together both junior and with other fields are mutually beneficial senior researchers, both domestic and and concern particularly Algebra, international. Geometry, Topology, Computer Science, Probability Theory and Statistics. The Organizer: Michael Tait development of combinatorics requires Carnegie Mellon University, USA a familiarity of several mathematical Organizer: Sebastian Cioaba branches for its researchers. This University of Delaware, USA minisymposium is proposed to facilitate 2:45-3:10 The Normalized Laplacian the contact between Enumerative and Matrix and Qualitative Properties of Algebraic Combinatorics and other Graphs Including Random Walks fields in an effective way. It is aimed to Steve Butler, Iowa State University, USA; bring together a strong group of active Shaun Fallat, University of Regina, Canada; researchers in Algebraic Combinatorics Kristin Heysse, Macalester College, USA; with an emphasis on Enumeration, as Stephen Kirkland, University of Manitoba, well as other areas of mathematical Canada sciences in which substantial 3:15-3:40 Forbidden Subgraphs and enumerative questions with a strong Equiangular Lines algebraic or geometric foundation have Zilin Jiang, Technion Israel Institute of arisen. Technology, Israel Organizer: Catherine Yan 3:45-4:10 Rainbow Spanning Trees in General Graphs Texas A&M University, USA Lauren M. Nelsen and Paul Horn, University Organizer: Yue Cai of Denver, USA Texas A&M University, USA 4:15-4:40 Graphs Whose Distance Matrices Have the Same Determinant Jephian C.-H. Lin, University of Victoria, Canada; Yen-Jen Cheng, National Chiao Tung University, Taiwan continued in next column 4:45-5:10 Balanced Set Type Conditions Jason Williford, University of Wyoming, USA 24 SIAM Conference on Discrete Mathematics

Tuesday, June 5 Tuesday, June 5 Wednesday, CP5 CP6 June 6 Hypergraphs, Ordered Sets, Computational Geometry/ Extremal Combinatorics Words 2:45 PM-3:45 PM 2:45 PM-3:25 PM Registration Room:North Classroom 1604 Room:North Classroom 1606 7:30 AM-3:30 PM Chair: To Be Determined Chair: To Be Determined Room:North Classroom 1130 Entry 2:45-3:00 The Zarankiewicz Problem in 2:45-3:00 An Algorithm to 3-Partite Graphs Find Maximum Area Polygons Craig Timmons, California State University, Circumscribed About a Convex Announcements Sacramento, USA; Michael Tait, Carnegie Polygon Mellon University, USA Zsolt Langi, Budapest University of 8:10 AM-8:15 AM 3:05-3:20 Decomposition of Random Technology and Economics, Hungary Room:North Classroom 1130 Hypergraphs 3:05-3:20 Circular Repetition Xing Peng, Tainjin University, China Thresholds for Small Alphabets James D. Currie, Lucas Mol, and Narad 3:25-3:40 The Saturation Number, Rampersad, The University of Winnipeg, Extremal Number, Spectral Radius, Canada and Family of k-Edge-Connected Graphs Suil O, State University of New York, USA; Hui Lei and Yongtang Shi, Nankai University, China; Douglas B. West, Zhejiang Normal University, China and University of Illinois, USA; Xuding Zhu, Zhejiang Normal University, China SIAM Conference on Discrete Mathematics 25

Wednesday, June 6 Wednesday, June 6 Wednesday, June 6 IP4 MS21 MS22 Waiter-Client Games Edge Colouring and Related Theoretical Computer 8:15 AM-9:00 AM Notions - Part I of II Science as a New Room:North Classroom 1130 9:30 AM-11:30 AM Discovery Engine of Discrete Chair: To Be Determined Room:North Classroom 1003 Mathematics Waiter-Client games (also called Picker- For Part 2 see MS28 9:30 AM-12:00 PM Chooser games) is a type of positional Speakers will discuss problems related Room:North Classroom 1607 games that gained popularity recently. to edge colouring, including but not Theoretical Computer Science has When played on the edge set of a graph limited to: the classification problem, a close relationship with discrete G (typically a complete graph K , or a the Goldberg--Seymour conjecture, edge n mathematics. The recent developments random graph drawn from G(n,p)), the list colouring, matchings, and rainbow/ and breakthroughs in theoretical game goes as follows. For a positive antirainbow subgraphs in edge-coloured computer science can lead to surprising integer q (the so called game bias), in graphs. new progress of discrete mathematics. each round Waiter offers to Client q+1 Organizer: Gregory J. Puleo This session is a collection of some such previously unoffered edges of G. Client Auburn University, USA amazing breakthroughs and connections. chooses one of the edges offered, the rest go to Waiter. Waiter wins the game Organizer: Jessica McDonald Organizer: Rupei Xu if by the time every edge of G has been Auburn University, USA University of Texas at Dallas, USA claimed, Client’s graph possesses a 9:30-9:55 t-Cores for (Δ+t)-edge- Organizer: Andrea Lincoln given graph theoretic property P, Client colouring Massachusetts Institute of Technology, USA wins otherwise. We will present several Jessica McDonald and Gregory J. Puleo, 9:30-9:55 Fine-grained Complexity, recent results about Waiter-Client games Auburn University, USA played on complete and random graphs Meta-algorithm and their Connections and discuss the role of the so called 10:00-10:25 Star Edge-colorings of with Extremal Graph Theory Subcubic Multigraphs Rupei Xu and András Faragó, University of probabilistic intuition in their analysis. Zixia Song, University of Central Florida, Texas at Dallas, USA Based on joint works with M. Bednarska- USA Bzdega, D. Hefetz, T. Luczak, W. E. Tan, 10:00-10:25 The 4/3 Additive Spanner N. Trumer. 10:30-10:55 Delay Edge-colouring Exponent Is Tight Bipartite Graphs Amir Abboud, IBM Research, USA; Greg Michael Krivelevich Katherine Edwards and William Kennedy, Bodwin, Massachusetts Institute of Tel Aviv University, Israel Nokia Bell Labs, USA Technology, USA 11:00-11:25 Recent Progress Toward 10:30-10:55 A Fast New Algorithm for Goldberg’s Conjecture Weak Graph Regularity Guantao Chen, Georgia State University, Jacob Fox, Stanford University, USA; László USA Coffee Break M. Lovász, University of California, Los Angeles, USA; Yufei Zhao, Massachusetts 9:00 AM-9:30 AM Institute of Technology, USA Room:North Classroom 1130 Atrium 11:00-11:25 Explicit Constructions of Ramsey Graphs via Randomness Extractors Xin Li, Johns Hopkins University, USA 11:30-11:55 Duality, Flows, and Shortest Paths in Planar Graphs Jeff Erickson, University of Illinois at Urbana-Champaign, USA; Kyle Fox, University of Texas, Dallas, USA; Luvsandondov Lkhamsuren, Airbnb, USA 26 SIAM Conference on Discrete Mathematics

Wednesday, June 6 9:30-9:55 Invitation to Combinatorial Wednesday, June 6 Reconfiguration MS23 Takehiro Ito, Tohoku University, Japan MS24 Reconfiguration Problems 10:00-10:25 Reconfiguring Graph Analytic and Probabilistic Colourings and Homomorphisms 9:30 AM-12:00 PM Richard Brewster, Thompson Rivers Techniques in Combinatorics Room:North Classroom 1604 University, Canada; Jae-Baek Lee, - Part I of II Kyungpook National University, Korea; 9:30 AM-12:00 PM Given two feasible solutions to a Sean Mcguinness, Thompson Rivers (combinatorial) problem, reconfiguration University, Canada; Benjamin Moore, Room:North Classroom 1005 is the process of modifying the first into University of Waterloo, Canada; Jonathan For Part 2 see MS30 the second through a sequence of allowed A. Noel, University of Warwick, United Contemporary combinatorics is an Kingdom; Mark Siggers, Kyungpook steps while ensuring all intermediate exciting and rapidly growing discipline National University, Korea configurations are feasible. A common on the frontier of mathematics and framework for studying reconfiguration 10:30-10:55 The Independent computer science. Many new techniques is to build a graph whose vertices Domination Graph in combinatorics rely on applications of are feasible solutions and adjacency Laura E. Teshima, University of Victoria, tools from other mathematical areas such Canada; Richard Brewster, Thompson indicates two solutions differ by a single as algebra, analysis and probability. In reconfiguration step. Natural questions Rivers University, Canada; Kieka Mynhardt, University of Victoria, Canada the last decade, various powerful novel include studying the algorithmic methods have emerged. For example, complexity of finding reconfiguration 11:00-11:25 Hamilton Connectedness recent works in the probabilistic method sequences, conditions for the existence of Sdr Graphs that culminated with the celebrated Stefan Bard, University of Victoria, Canada of reconfiguration sequences, and container method which answered many properties of reconfiguration graphs. 11:30-11:55 Reconfiguration of long-standing open Ramsey-type and Reconfiguration problems are interesting Common Independent Sets of extremal questions, new developments in their own right, They are also naturally Matroids of algebraic techniques that were crucial applied to problems where one wishes Moritz Muehlenthaler, TU Dortmund, in settling famous conjectures in design Germany to incrementally improve an existing theory and number theory, and analytic solution while maintaining feasibility. approaches to Szemerédi’s regularity Typically NP-hard problems lead to lemma that served as the corner-stone PSPACE-complete reconfiguration of graph limits, which then spin-off problems. A surprising example to techniques for large networks and 3-colouring: it is NP-complete to development of flag algebras. In this determine if a graph admits a 3-colouring, mini-symposium, we aim to bring mostly but it is polynomial to determine if one junior researchers in combinatorics in colouring reconfigures to the another. This order to present further developments and mini-symposium includes an introductory applications of these methods, as well as talk, and talks on reconfiguration of talk about completely new approaches. matroids, homomorphisms, matching, and We will discuss relevant open problems, dominating sets. exchange research ideas, and initiate new Organizer: Richard Brewster collaborations. Thompson Rivers University, Canada Organizer: Andrzej Grzesik University of Warwick, United Kingdom Organizer: Jan Volec McGill University, Canada 9:30-9:55 Extremal Graph Theory and Finite Forcibility Andrzej Grzesik and Daniel Kral, University of Warwick, United Kingdom; Laszlo M. Lovasz, University of California, Los Angeles, USA

continued in next column continued on next page SIAM Conference on Discrete Mathematics 27

10:00-10:25 Inducibility in Graphs Wednesday, June 6 10:30-10:55 Pebbling on Semi-2-Trees Florian Pfender, University of Colorado at Liliana Alcon and Marisa Gutierrez, Denver, USA; Bernard Lidicky, Iowa State MS25 Universidad Nacional de La Plata, University, USA Argentina; Glenn Hurlbert, VCU, Center Graph Pebbling - Part I of III 10:30-10:55 Large Multipartite for the Study of Biological Complexity, Subgraphs of H-Free Graphs 9:30 AM-12:00 PM USA Jan Volec, McGill University, Canada; 11:00-11:25 Pebbling on Graph Room:North Classroom 1130 Bernard Lidicky, Iowa State University, Products and More! USA; Taisa Martins, University of Warwick, For Part 2 see MS31 John Asplund, Dalton State College, USA; United Kingdom; Sergey Norin, McGill The subject of graph pebbling Franklin Kenter, United States Naval University, Canada; Ping Hu, University of encompasses a broad spectrum of Academy, USA; Glenn Hurlbert, Virginia Warwick, United Kingdom concepts regarding the movement of Commonwealth University, USA 11:00-11:25 Forcing Oriented Cycles pebbles through a graph, with many 11:30-11:55 Pebbling on Split Graphs Roman Glebov, Hebrew University of diverse applications to areas such Liliana Alcon and Marisa Gutierrez, Jerusalem, Israel; Andrzej Grzesik, as computational complexity, graph Universidad Nacional de La Plata, University of Warwick, United Kingdom; rigidity, large sparse matrix storage, and Argentina; Glenn Hurlbert, Virginia Jan Volec, McGill University, Canada combinatorial number theory, among Commonwealth University, USA 11:30-11:55 Step Sidorenko Property others. Modern graph pebbling also and Non-Norming Edge-Transitive fits under the umbrella of network Graphs optimization, as a model for the Daniel Kral, Taisa Martins, and Péter Pál transportation of limited and consumable Pach, University of Warwick, United resources. One of the main goals of Kingdom; Marcin Wrochna, University of this minisymposium is to attract new Warsaw, Poland researchers to the field. Graph pebbling utilizes many techniques, including those from probabilistic combinatorics, linear optimization, discharging, domination, and more, making it naturally attractive to a wide audience. The topic has also supported a great amount of undergraduate research since the 1990s. Dozens of papers in this area have been written by participants in various REUs and such. We intend to introduce many new problems that are accessible to this population. Organizer: John Asplund Dalton State College, USA Organizer: Glenn Hurlbert Virginia Commonwealth University, USA Organizer: Franklin Kenter United States Naval Academy, USA Organizer: Carl Yerger Davidson College, USA

9:30-9:55 A Brief Introduction to Graph Pebbling Franklin Kenter, United States Naval Academy, USA 10:00-10:25 Graph Pebbling Algorithms, Doppelgangers, and Lemke Graphs Charles A. Cusack, Hope College, USA

continued in next column 28 SIAM Conference on Discrete Mathematics

Wednesday, June 6 Wednesday, June 6 Wednesday, June 6 MS26 CP7 IP5 Matroid Theory - Part I of II Structural Graph Theory New Developments in 9:30 AM-12:00 PM 9:30 AM-11:30 AM Hypergraph Ramsey Theory Room:North Classroom 1806 Room:North Classroom 1606 1:30 PM-2:15 PM For Part 2 see MS32 Chair: To Be Determined Room:North Classroom 1130 Matroid Theory is a vibrant and 9:30-9:45 A Bandwidth Theorem for Chair: To Be Determined growing subject with connections across Approximate Decompositions The Ramsey number r (s,n) is the mathematics to graph theory, projective k Padraig Condon, Jaehoon Kim, Daniela minimum integer N, such that for any geometry, lattice theory, design Kühn, and Deryk Osthus, University of red/blue coloring of the k-tuples of theory, coding theory, combinatorial Birmingham, United Kingdom {1,2,...,N}, there are s integers such that optimization etc. Groups of researchers 9:50-10:05 Coloring Vertex-minor-free every k-tuple among them is red, or there in matroids and related objects tend Graphs with No Short Cycles are n integers such that every k-tuple to develop topic-specific language James G. Davies, University of Warwick, among them is blue. In this talk, I will that obscures the interrelations. This United Kingdom discuss new lower bounds for r (s,n) minisymposium brings together k 10:10-10:25 On the Excluded Minors which nearly settles a question of Erdos researchers from different areas of for Represented Frame Matroids and Hajnal from 1972. I will also discuss matroid theory with the purpose of Cynthia Rodriguez and Jim Geelen, a more general function introduced by seeking commonalities and exploring University of Waterloo, Canada Erdos and Hajnal, and several interesting connections between matroids and other open problems in the area. This is joint areas of combinatorics. 10:30-10:45 Extending a Result of Corradi and Hajnal work with Dhruv Mubayi. Organizer: Sandra Kingan Michael Santana, Grand Valley State Andrew Suk City University of New York, Brooklyn, USA University, USA University of California, San Diego, USA 9:30-9:55 Graph and Matroid Designs 10:50-11:05 Extremal Collections of Talmage J. Reid, University of Mississippi, k-Uniform Vectors USA Joseph G. Briggs and Wesley Pegden, Carnegie Mellon University, USA 10:00-10:25 Delta-Matroids and Rigidity Matroids 11:10-11:25 On Group Divisible Coffee Break Brigitte Servatius, Worcester Polytechnic Designs with Two Associate Classes Institute, USA and Larger Second Index 2:15 PM-2:45 PM Chariya Uiyyasathian, Chulalongkorn 10:30-10:55 Interlacement and Room:North Classroom 1130 Atrium University, Thailand Activities in Delta-Matroids Ada Morse, University of Vermont, USA 11:00-11:25 Algebraic Structures Related to Matroid Theory Lunch Break Ivan Martino, Northeastern University, USA 12:00 PM-1:30 PM 11:30-11:55 Projective Planarity of Attendees on their own 3-Nets and Biased Graphs Rigoberto Florez, The Citadel, USA SIAM Conference on Discrete Mathematics 29

Wednesday, June 6 2:45-3:10 Modifications to Chodal Wednesday, June 6 Graphs MS27 Saket Saurabh, Institute of Mathematical MS28 Sciences, India Modification Problems to Edge Colouring and Related Discrete Structures - 3:15-3:40 Dynamic Parameterized Problems and Algorithms Notions - Part II of II Part I of II Josh Alman, Massachusetts Institute of 2:45 PM-5:15 PM Technology, USA 2:45 PM-5:15 PM Room:North Classroom 1003 3:45-4:10 Solving Feedback Vertex Set Room:North Classroom 1604 For Part 1 see MS21 via Half-Integral Relaxation For Part 2 see MS34 Yoichi Iwata, National Institute of Speakers will discuss problems related A surprisingly high number of the Informatics, Japan to edge colouring, including but not interesting computational problems limited to: the classification problem, 4:15-4:40 Delta Decomposition arising from theory and applications the Goldberg--Seymour conjecture, edge Ross McConnell, Colorado State University can be formulated as graph/matrix list colouring, matchings, and rainbow/ Fort Collins, USA modification problems. In a graph antirainbow subgraphs in edge-coloured modification problem, we are given as graphs. input a graph G, and the goal is to apply Organizer: Gregory J. Puleo certain operations on G (such as vertex Auburn University, USA deletions, edge deletions, additions or contractions) in order to obtain a graph Organizer: Jessica McDonald H with some particular property. A Auburn University, USA matrix modification problem is defined 2:45-3:10 Edge-Colouring Planar analogously. For an example the classical Graphs with Precoloured Edges Vertex Cover problem can be formulated Joshua Harrelson, Jessica McDonald, and as trying to change G into an edgeless Gregory J. Puleo, Auburn University, USA graph by deleting the minimum number 3:15-3:40 Total List Coloring of Planar of vertices. The treewidth problem Graphs is essentially a graph modification Marthe Bonamy, LaBRI, Université de problem, where we add edges to make a Bordeaux, and CNRS, France; Théo Pierron graph chordal and having the minimum and Eric Sopena, Universite de Bordeaux I, clique number, while the classic marix France rigidity problems is nothing but a matrix 3:45-4:10 Independence Number of modification problem. These problems Edge-chromatic Critical Graphs have been studied quite extensively, and Yan Cao, Guantao Chen, and Guanming Jing, both algorithms for these problems and Georgia State University, USA; Songling structural aspects have been thoroughly Shan, Vanderbilt University, USA explored. We plan to bring together 4:15-4:40 Polychromatic Colorings experts in algorithms and experts in graph of Complete Graphs with Respect to classes and structural graph theory to join 1-,2-factors and Hamiltonian Cycles forces on graph modification problems. Maria Axenovich, Karlsruhe Institute of Technology, Germany; John L. Goldwasser Organizer: Yixin Cao and Ryan Hansen, West Virginia University, Hong Kong Polytechnic University, China USA; Bernard Lidicky and Ryan R. Organizer: Saket Saurabh Martin, Iowa State University, USA; David Offner, Westminster College, USA; John Institute of Mathematical Sciences, India Talbot, University College London, United Kingdom; Michael Young, Iowa State University, USA 4:45-5:10 Polychromatic Colorings of the Integers and Integers Mod N John L. Goldwasser, West Virginia University, USA

continued in next column 30 SIAM Conference on Discrete Mathematics

Wednesday, June 6 2:45-3:10 Infinite Random Geometric Wednesday, June 6 Graphs MS29 Jeannette Janssen, Dalhousie University, MS30 Canada Spatial Random Networks Analytic and Probabilistic 3:15-3:40 Random Geometric Graphs 2:45 PM-5:15 PM in Normed Spaces Techniques in Combinatorics - Part II of II Room:North Classroom 1606 Karen Gunderson, University of Manitoba, Canada The application of random graphs to the 2:45 PM-5:15 PM 3:45-4:10 Geometric Networks and analysis of complex networks has led Room:North Classroom 1539 Graph Limits to many new mathematical models. Of Mahya Ghandehari, University of Delaware, For Part 1 see MS24 special interest are spatial random graph USA Contemporary combinatorics is an models, where the vertices of the graphs exciting and rapidly growing discipline 4:15-4:40 On Geometric Embedding are embedded in a metric space, and link on the frontier of mathematics and formation depends on the distance of of Graphs and Random Graphs Huda Chuangpishit, Ryerson University, computer science. Many new techniques the vertices in the space. Spatial models Canada in combinatorics rely on applications of are especially suited for the modelling tools from other mathematical areas such 4:45-5:10 Layout of Random Circulant of complex networks, such as social as algebra, analysis and probability. In Graphs networks, biological networks, and the last decade, various powerful novel Web-based networks such as Wikipedia. Israel S. Rocha, Czech Academy of Sciences, Czech Republic methods have emerged. For example, The underlying metric space represents recent works in the probabilistic method the feature space, in which vertices that culminated with the celebrated are placed according to their defining container method which answered many properties. Vertices that are close together long-standing open Ramsey-type and represent entities that are similar and extremal questions, new developments so are more likely to be linked. This of algebraic techniques that were crucial minisymposium aims to give an overview in settling famous conjectures in design of the many different aspects of spatial theory and number theory, and analytic random graphs. The simplest spatial approaches to Szemerédi’s regularity graph model is the random geometric lemma that served as the corner-stone graph, where vertices are connected if of graph limits, which then spin-off and only if they are within a threshold to techniques for large networks and distance of each other. The study of development of flag algebras. In this spatial random graphs is flourishing, mini-symposium, we aim to bring mostly and some of our speakers will give junior researchers in combinatorics in the latest results, including research order to present further developments and on infinite random geometric graphs. applications of these methods, as well as A fundamental question addressed by talk about completely new approaches. some of our speakers is whether a large We will discuss relevant open problems, finite or infinite graph embodies the exchange research ideas, and initiate new characteristics of the underlying metric collaborations. space. Finally, some speakers will present state-of-the-art research using spatial Organizer: Andrzej Grzesik random graphs to simulate the properties University of Warwick, United Kingdom of real-life networks. Organizer: Jan Volec Organizer: Jeannette Janssen McGill University, Canada Dalhousie University, Canada Organizer: Anthony Bonato Ryerson University, Canada

continued in next column continued on next page SIAM Conference on Discrete Mathematics 31

2:45-3:10 Induced Subgraphs of Wednesday, June 6 2:45-3:10 Thresholds for Random Ramsey Graphs Pebbling Matthew Kwan and Benjamin Sudakov, ETH MS31 Neal Bushaw, Virginia Commonwealth Zürich, Switzerland University, USA Graph Pebbling - Part II of III 3:15-3:40 On the Turón Number of 3:15-3:40 Optimal Pebbling Number of Ordered Forests 2:45 PM-5:15 PM Graphs with Given Minimum Degree Daniel Korandi, École Polytechnique Room:North Classroom 1130 Andrjez Czygrinow, Arizona State University, Fédérale de Lausanne, Switzerland; USA Gábor Tardos, Alfréd Rényi Institute of For Part 1 see MS25 Mathematics, Budapest; Istvan Tomon, For Part 3 see MS37 3:45-4:10 The Weight Function Lemma École Polytechnique Fédérale de Lausanne, The subject of graph pebbling and Its Applications Switzerland; Craig Weidert, Google, Inc., encompasses a broad spectrum of Glenn Hurlbert, Virginia Commonwealth USA concepts regarding the movement of University, USA 3:45-4:10 Polynomial Time Smoothed pebbles through a graph, with many 4:15-4:40 Distance Pebbling on Analysis for Local Max-Cut diverse applications to areas such Directed Cycle Graphs Fan Wei, Stanford University, USA; Omer as computational complexity, graph Michael P. Knapp, Loyola University Angel, University of British Columbia, rigidity, large sparse matrix storage, and Maryland, USA Canada; Yuval Peres and Sébastien Bubeck, combinatorial number theory, among 4:45-5:10 A Graph Pebbling Algorithm Microsoft Research, USA others. Modern graph pebbling also on Weighted Graphs 4:15-4:40 Counting Tree-Like Graphs in fits under the umbrella of network Nandor Sieben, Northern Arizona University, Locally Dense Graphs optimization, as a model for the USA Joonkyung Lee, University of Oxford, United transportation of limited and consumable Kingdom resources. One of the main goals of 4:45-5:10 The Erdos-Gallai Theorem for this minisymposium is to attract new Berge-Cycles in Hypergraphs researchers to the field. Graph pebbling Alexandr Kostochka and Ruth Luo, University utilizes many techniques, including those of Illinois at Urbana-Champaign, USA from probabilistic combinatorics, linear optimization, discharging, domination, and more, making it naturally attractive to a wide audience. The topic has also supported a great amount of undergraduate research since the 1990s. Dozens of papers in this area have been written by participants in various REUs and such. We intend to introduce many new problems that are accessible to this population. Organizer: John Asplund Dalton State College, USA Organizer: Carl Yerger Davidson College, USA Organizer: Glenn Hurlbert Virginia Commonwealth University, USA Organizer: Franklin Kenter United States Naval Academy, USA

continued in next column 32 SIAM Conference on Discrete Mathematics

Wednesday, June 6 Wednesday, June 6 Thursday, June 7 MS32 CP8 Matroid Theory - Part II of II Enumeration 2:45 PM-4:45 PM 2:45 PM-4:05 PM Room:North Classroom 1806 Room:North Classroom 1607 Registration For Part 1 see MS26 Chair: To Be Determined 7:30 AM-3:30 PM Matroid Theory is a vibrant and 2:45-3:00 Some Partitions Identities Room:North Classroom 1130 Entry growing subject with connections across Between P(n,m) -P(n-1,m) and mathematics to graph theory, projective p(n,m-1) geometry, lattice theory, design Acadia B. Larsen, The University of Texas theory, coding theory, combinatorial Rio Grande Valley, USA Announcements optimization etc. Groups of researchers 3:05-3:20 Enumeration of Unsensed 8:10 AM-8:15 AM in matroids and related objects tend Orientable Maps on Surfaces of a Room:North Classroom 1130 to develop topic-specific language Given Genus that obscures the interrelations. This Evgeniy Krasko and Alexander Omelchenko, minisymposium brings together St. Petersburg Academic University, researchers from different areas of Russia IP6 matroid theory with the purpose of 3:25-3:40 Tools for Enumerating seeking commonalities and exploring Graphs with Prescribed Degree Random Graph Processes connections between matroids and other Sequences 8:15 AM-9:00 AM areas of combinatorics. David Burstein, Swarthmore College, USA; Jonathan E. Rubin, University of Room:North Classroom 1130 Organizer: Sandra Kingan Pittsburgh, USA Chair: To Be Determined City University of New York, Brooklyn, USA 3:45-4:00 A Randomized Algorithm 2:45-3:10 Deletion Sets in Binary When dealing with random objects, it for Approximating Zonotopes is often useful to reveal the randomness Matroids Paul Constantine, University of Colorado gradually, rather than all at once; that Sandra Kingan, City University of New Boulder, USA; David F. Gleich, Purdue York, Brooklyn, USA University, USA; Kerrek Stinson, is, to turn a static random object into a random process. In this talk we will 3:15-3:40 Efficient Enumeration Carnegie Mellon University, USA of Binary Matroids Using a New describe some classical proofs of this Canonical Form type, and a few more recent applications, Ken Sugimori, University of Tokyo, Japan; for example to Ramsey numbers, and to Sonoko Moriyama, Nihon University, Intermission determining sharp thresholds in G(n,p) Japan; Kunihiko Sadakane, University of 5:15 PM-5:30 PM and in random sets of integers. Various Tokyo, Japan parts of the talk are based on joint work 3:45-4:10 Beta Invariants of with Paul Balister, Béla Bollobás, Asaf 3-Connected Matroids Ferber, Gonzalo Fiz Pontiveros, Simon Sooyeon Lee, University of Mississippi, USA SIAG/DM Business Meeting Griffiths, Oliver Riordan, Wojciech Samotij, and Paul Smith. 4:15-4:40 Triangle Roundedness in 5:30 PM-6:30 PM Matroids Room:North Classroom 1130 Robert Morris Joao Paulo Costalonga, Federal University Institute for Pure and Applied Mathematics - of Espirito Santo, Brazil Complimentary refreshments will be served. IMPA , Brazil

Coffee Break 9:00 AM-9:30 AM Room:North Classroom 1130 Atrium SIAM Conference on Discrete Mathematics 33

Thursday, June 7 Thursday, June 7 9:30-9:55 An O(k4) Kernel for Unit Interval Vertex Deletion MS33 MS34 Yixin Cao, Hong Kong Polytechnic University, China The Structure of Families of Modification Problems 10:00-10:25 Complexity Dichotomies Finite Sets - Part I of II to Discrete Structures - for H-free Edge Modification 9:30 AM-12:00 PM Part II of II Problems 9:30 AM-12:00 PM R B Sandeep, Indian Institute of Information Room:North Classroom 1539 Technology, India For Part 2 see MS39 Room:North Classroom 1604 10:30-10:55 Modification of Matroids The theme of this minisymposium is the For Part 1 see MS27 and Matrices research on ordered sets in recent years, A surprisingly high number of the Meirav Zehavi, Ben-Gurion University, mainly on the structure of families of interesting computational problems Israel finite sets. In the last decade, more and arising from theory and applications 11:00-11:25 A Polynomial Kernel of more results on the problems related to can be formulated as graph/matrix Distance-Hereditary Vertex Deletion finding the families of subsets avoiding a modification problems. In a graph Eun Jung Kim, Universite Paris Dauphine given pattern have been discovered and modification problem, we are given as and CNRS, France; O-Joung Kwon, published. In the two sessions, we invite input a graph G, and the goal is to apply Incheon National University, Korea international researchers to give talks on certain operations on G (such as vertex 11:30-11:55 Maximum Induced the problems and results of determining the deletions, edge deletions, additions or Matching Algorithms via Vertex largest size of P-free families (avoiding the contractions) in order to obtain a graph Ordering Characterizations poset P as a subfamily) for general posets, H with some particular property. A Lalla Mouatadid, University of Toronto, for the specific posets, and for the induced matrix modification problem is defined Canada subposets. In addition, we also invite the analogously. For an example the classical researchers to give talks addressing the Vertex Cover problem can be formulated results on antichains as well as the Ramsey- as trying to change G into an edgeless type results in Boolean lattices. We expect graph by deleting the minimum number this minisymposium will enhance the of vertices. The treewidth problem development of new theory of the structures is essentially a graph modification of finite sets and draw attention to more problem, where we add edges to make a people who may be interested in this type of graph chordal and having the minimum problems. clique number, while the classic marix Organizer: Wei-Tian Li rigidity problems is nothing but a matrix modification problem. These problems National Chung-Hsing University, Taiwan have been studied quite extensively, and 9:30-9:55 An Improvement on the both algorithms for these problems and Intersecting Shadow Theorem structural aspects have been thoroughly Gyula Katona, Renyi Institute, Hungary explored. We plan to bring together 10:00-10:25 Problems and Results Related experts in algorithms and experts in to Maximal Antichains graph classes and structural graph theory Uwe Leck, Europa-Universitaet Flensburg, to join forces on graph modification Germany problems. 10:30-10:55 On Difference Graphs and the Local Dimension of Posets Organizer: Yixin Cao Ryan R. Martin, Iowa State University, USA; Hong Kong Polytechnic University, China Jinha Kim, Seoul National University, Korea; Organizer: Saket Saurabh Tomas Masarik, Charles University, Czech Institute of Mathematical Sciences, India Republic; Warren Shull, Emory University, USA; Heather C. Smith, Georgia Institute of Technology, USA; Andrew Uzzell, Grinnell College, USA; Zhiyu Wang, University of South Carolina, USA 11:00-11:25 Forbidden Induced Subposets Istvan Tomon, École Polytechnique Fédérale de Lausanne, Switzerland 11:30-11:55 Ramsey-Type of Problems on Posets in the Boolean Lattices continued in next column Wei-Tian Li, National Chung-Hsing University, Taiwan 34 SIAM Conference on Discrete Mathematics

Thursday, June 7 Thursday, June 7 Thursday, June 7 MS35 MS36 MS37 Modeling and Mining Open Problems in Graph Pebbling - Part III of III Network Data - Part I of II Combinatorics on Words 9:30 AM-12:00 PM 9:30 AM-12:00 PM 9:30 AM-12:00 PM Room:North Classroom 1130 Room:North Classroom 1003 Room:North Classroom 1806 For Part 2 see MS31 The subject of graph pebbling For Part 2 see MS40 Combinatorics on words is a rapidly encompasses a broad spectrum of Discrete mathematics is at the heart of growing field at the border of mathematics concepts regarding the movement of challenging data-driven problems. Many and computer science. Roughly speaking, pebbles through a graph, with many discrete datasets look like networks, a it is the study of words (finite lists diverse applications to areas such mathematical formalism for modeling of symbols) and their combinatorial as computational complexity, graph complex systems by interactions properties. Our minisymposium will rigidity, large sparse matrix storage, and between entities. This minisymposium center around the theme of open problems combinatorial number theory, among highlights several recent advances in in combinatorics on words. We propose to others. Modern graph pebbling also modeling and mining network data have speakers discussing (1) the additive fits under the umbrella of network with an underlying theme of connecting k’th power problem: does there exist optimization, as a model for the theory and applications with real data. an infinite word over a finite subset of transportation of limited and consumable The theoretical tools are quite diverse Z avoiding k consecutive blocks of the resources. One of the main goals of and include extremal graph theory, same size and the same sum? Recently this minisymposium is to attract new numerical linear algebra, and algorithm this problem was (positively) resolved researchers to the field. Graph pebbling design. The applications are equally for k = 3, but the problem for k = 2 is utilizes many techniques, including those diverse, drawing from marketing, still open. (2) discrete tilings and their from probabilistic combinatorics, linear machine learning, and social network relationship to combinatorics on words. optimization, discharging, domination, analysis, using data from protein Here the principal open problem is and more, making it naturally attractive interactions, neural systems, email Nivat’s conjecture about two-dimensional to a wide audience. The topic has communications, transportation systems, periodicity. (3) automatic sequences also supported a great amount of and more. This minisymposium will (sequences generated by finite automata) undergraduate research since the 1990s. showcase the exciting opportunities at and their generalizations. Here we propose Dozens of papers in this area have been the intersection of discrete mathematics to have speakers addressing generalizations written by participants in various REUs and data science. of Cobham’s theorem and p-adic and such. We intend to introduce many properties. Organizer: Austin Benson new problems that are accessible to this Cornell University, USA Organizer: Jeffrey Shallit population. University of Waterloo, Canada 9:30-9:55 New Perspectives on Organizer: John Asplund Measuring Network Clustering Organizer: Narad Rampersad Dalton State College, USA Austin Benson, Cornell University, USA; The University of Winnipeg, Canada Hao Yin and Jure Leskovec, Stanford Organizer: Carl Yerger University, USA Organizer: James D. Currie Davidson College, USA The University of Winnipeg, Canada 10:00-10:25 Hypergraph Kronecker Organizer: Glenn Hurlbert Models for Networks 9:30-9:55 Introduction to Combinatorics Virginia Commonwealth University, USA David F. Gleich and Nicole Eikmeier, on Words Purdue University, USA James D. Currie, The University of Winnipeg, Organizer: Franklin Kenter 10:30-10:55 Mitigating Overexposure Canada United States Naval Academy, USA in Viral Marketing 10:00-10:25 Generalizations of Rediet Abebe, Cornell University, USA; Lada Cobham’s Theorem Adamic, The University of Michigan, Ann Jakub Byszewski, Jagiellonian University, Arbor, USA; Jon M. Kleinberg, Cornell Poland University, USA 10:30-10:55 The Additive K’th Power 11:00-11:25 Modeling and Mining Problem and Generalizations Dynamic Competition Networks Matthieu Rosenfeld, LIMOS- UCA, France Anthony Bonato, Ryerson University, Canada 11:00-11:25 Decidability and the 11:30-11:55 Tuning the Activity of Ostrowski Numeration System Neural Networks at Criticality Philipp Hieronymi, University of Illinois, Kathleen Finlinson, University of Colorado Urbana-Champaign, USA continued on next page Boulder, USA 11:30-11:55 Automatic Sequences and p-adic Asymptotics Eric Rowland, Hofstra University, USA SIAM Conference on Discrete Mathematics 35

9:30-9:55 Pebbling on Low Diameter Thursday, June 7 Thursday, June 7 Interval Graphs Carl Yerger, Davidson College, USA; Xuchen IP7 Zhou, Columbia University, USA CP9 Deciphering Cellular 10:00-10:25 Optimal Pebbling Number Coloring of Grids 9:30 AM-10:30 AM Networks: From Normal Ervin Gyori, Renyi Institute, Hungary; Gyula Functioning to Disease Y. Katona and Laszlo F. Papp, Budapest Room:North Classroom 1606 University of Technology and Economics, Chair: To Be Determined 1:30 PM-2:15 PM Hungary; Casey Tompkins, Renyi Institute, 9:30-9:45 A k-Partite Generalization of Room:North Classroom 1130 Hungary Chordal Bipartite Graphs Chair: To Be Determined 10:30-10:55 Variations on the Pebbling Terry McKee, Wright State University, USA Game: Critical, Weighted, and Each cell in our body accomplishes 9:50-10:05 Properly Colored Transport Pebbling its functions via a complex network of Connections in Graphs Josh Laison, Willamette University, USA molecular interactions. Analyses of these Wayne Goddard and Robert Melville, networks are thus key to understanding 11:00-11:25 On Some Questions Clemson University, USA cellular functioning (and, in the case of Regarding Class 0 Graphs 10:10-10:25 An Asymptotic Bound for John Schmitt, Middlebury College, USA disease, malfunctioning). I will overview the Strong Chromatic Number what has been discovered about the basic 11:30-11:55 Pebbling Bounds for Class Allan Lo and Nicolás Sanhueza-Matamala, structure and organization of cellular 0 Graphs University of Birmingham, United networks, and present frameworks and Daniel Cranston, Virginia Commonwealth Kingdom algorithms that leverage these properties University, USA; Luke Postle, University of Waterloo, Canada; Carl Yerger, Davidson in order to gain a better understanding of College, USA; Chenxiao Xue, Google, Inc., diseases such as cancer. USA Lunch Break Mona Singh 12:00 PM-1:30 PM Princeton University, USA Attendees on their own

Coffee Break 2:15 PM-2:45 PM Room:North Classroom 1130 Atrium 36 SIAM Conference on Discrete Mathematics

Thursday, June 7 2:45-3:10 Spanning Subgraphs of Thursday, June 7 Randomly Perturbed Graphs MS38 Julia Boettcher, London School of MS39 Economics, United Kingdom; Yury Person Extremal Problems for and Olaf Parczyk, University of Frankfurt, The Structure of Families of Sparse Graphs and Germany; Richard Montgomery, University Finite Sets - Part II of II Hypergraphs - Part I of II of Cambridge, United Kingdom 2:45 PM-4:45 PM 3:15-3:40 Proof of Komlos’s Conjecture 2:45 PM-5:15 PM Room:North Classroom 1539 on Hamiltonian Subsets Room:North Classroom 1003 Jaehoon Kim, University of Birmingham, For Part 1 see MS33 The theme of this minisymposium is the For Part 2 see MS43 United Kingdom; Hong Liu and Maryam Extremal theory for graphs and Sharifzadeh, University of Warwick, research on ordered sets in recent years, hypergraphs is a fast developing and United Kingdom; Katherine L. Staden, mainly on the structure of families of University of Oxford, United Kingdom important area within Combinatorics that finite sets. In the last decade, more and typically studies extrema of parameters 3:45-4:10 On Subgraphs of 2k-cycle- more results on the problems related to of graphs and hypergraphs with given free Graphs and Some Generalised finding the families of subsets avoiding properties. It has applications to areas Turán Problems a given pattern have been discovered such as combinatorial geometry, number Abhishek Methuku, Central European and published. In the two sessions, we University, Hungary theory, coding theory, computer science, invite international researchers to give and etc. In recent decades, extremal 4:15-4:40 The Junta Method in talks on the problems and results of (hyper-)graph theory has experienced Extremal Hypergraph Theory and determining the largest size of P-free significant growth thanks to the Chvátal’s Conjecture families (avoiding the poset P as a development of some powerful methods Nathan Keller and Noam Lifshitz, Bar-Ilan subfamily) for general posets, for the University, Israel such as the probabilistic method, the specific posets, and for the induced regularity method and the absorbing 4:45-5:10 Isoperimetric Stability for the subposets. In addition, we also invite method. The latter two are especially Cube the researchers to give talks addressing effective on dense graphs. Relatively Peter Keevash and Eoin Long, University of the results on antichains as well as the speaking, there has been a lack of Oxford, United Kingdom Ramsey-type results in Boolean lattices. general tools for tackling extremal We expect this minisymposium will problems for sparse graphs. However, enhance the development of new theory there have been many interesting of the structures of finite sets and draw developments in this area and some attention to more people who may be promising methods have been introduced interested in this type of problems. such as dependent random choice, delta Organizer: Wei-Tian Li system method, junta method and etc. National Chung-Hsing University, Taiwan The aim of this mini-symposium is to 2:45-3:10 Sizes of Maximal Antichains bring together a diverse group of active in Bn researchers working on sparse problems Jerry Griggs, University of South Carolina, using different methods. The hope is USA; Thomas Kalinowski, University of that the interchanging of ideas from New England, Armidale, Australia; Uwe different angles will help forging the Leck, Europa-Universitaet Flensburg, development of more universal tools for Germany; Ian Roberts, Charles Darwin extremal problems in the sparse setting. University, Australia; Michael Schmitz, We also hope that the broad range of Europa-Universitaet Flensburg, the interesting results and methods Germany covered by the talks will help generate 3:15-3:40 An Algorithm Approach to more interests from the general discrete Bounding Families of Subsets Avoiding mathematics community in the extremal a Subposet in Boolean Lattices problems in the sparse setting. Hong-Bin Chen, Feng-Chia University, Taiwan Organizer: Tao Jiang 3:45-4:10 An Upper Bound on the Size Miami University, USA of Diamond-Free Families of Sets Organizer: Liana Yepremyan Dániel Grósz, Universita di Pisa, Italy; Abhishek Methuku, Central European University of Oxford, United Kingdom University, Hungary; Casey Tompkins, Renyi Institute, Hungary continued in next column 4:15-4:40 A Generalization of Sperner’s Theorem for Convex Families Lili Mu, Liaoning Normal University, China SIAM Conference on Discrete Mathematics 37

Thursday, June 7 Thursday, June 7 2:45-3:10 Bayesian Optimization with Exotic Structure MS41 Peter I. Frazier, Saul Toscano Palmerin, MS40 Matthias Poloczek, and Andrew Wilson, Modeling and Mining Foundations of Data Science Cornell University, USA; Jian Wu, Two Network Data - Part II of II - Part I of II Sigma, USA 2:45 PM-4:45 PM 2:45 PM-5:15 PM 3:15-3:40 Graphons: From Graph Limits to Non-Parametric Graph Models and Room:North Classroom 1604 Room:North Classroom 1130 Estimation For Part 1 see MS35 For Part 2 see MS47 Christian Borgs, Microsoft Research, USA Discrete mathematics is at the heart of In support of the NSF initiative on 3:45-4:10 Learning Determinantal Point challenging data-driven problems. Many Trandisciplinary Research in Principles Processes discrete datasets look like networks, a of Data Science (TRIPODS) and tapping Philippe Rigollet, Victor-Emmanuel mathematical formalism for modeling into the broader research interest and Brunel, Ankur Moitra, and John Urschel, complex systems by interactions between investment from research labs across Massachusetts Institute of Technology, USA entities. This minisymposium highlights the nation, this minisymposium will 4:15-4:40 Stochastic Combinatorial several recent advances in modeling feature lectures on frontier research in Optimization with Queries and mining network data with an foundational aspects of data science. A Takanori Maehara, RIKEN Center for underlying theme of connecting theory primary goal is to feature a diverse set of Advanced Intelligence Project, Japan; and applications with real data. The speakers from computing, engineering Yutaro Yamaguchi, Osaka University, Japan theoretical tools are quite diverse and and statistics who will help identify 4:45-5:10 Mathematical and include extremal graph theory, numerical algorithmic and mathematical challenges Computational Grand Challenges in linear algebra, and algorithm design. The confronting the current state of this Estimating the Tree of Life applications are equally diverse, drawing fast growing, exciting interdisciplinary Tandy Warnow and Mike Nute, University from marketing, machine learning, and field. Topics will include nonlinear of Illinois at Urbana-Champaign, USA; social network analysis, using data from optimization and high-dimensional Sebastien Roch, University of Wisconsin, protein interactions, neural systems, email statistics, statistical and large-scale Madison, USA; Siavash Mirarab, University of California, San Diego, USA communications, transportation systems, machine learning, data-driven algorithm and more. This minisymposium will design, scalable learning algorithms, showcase the exciting opportunities at the automation of data analysis, neural nets intersection of discrete mathematics and and deep learning, structured sparsity data science. and compressed sensing, submodular optimization, and analysis of complex, Organizer: Austin Benson high-dimensional data sets, large Cornell University, USA networks and computational phylogeny. 2:45-3:10 Graph Matching Via Low Rank Factors Organizer: Prasad Tetali Huda Nassar, Purdue University, USA Georgia Institute of Technology, USA 3:15-3:40 Risk-Averse Matchings over Organizer: Jennifer Chayes Uncertain Graph Databases Microsoft Research, USA Charalampos Tsourakakis, Boston University and , USA Organizer: David Shmoys Cornell University, USA 3:45-4:10 Detectability of Hierarchical Community Structure in Preprocessed Multilayer Networks Dane Taylor, State University of New York, Buffalo, USA; Peter J. Mucha, University of North Carolina at Chapel Hill, USA 4:15-4:40 Evaluating Overfit and Underfit in Models of Network Community Structure Amir Ghasemian, University of Colorado Boulder, USA; Homa Hosseinmardi, University of Southern California, USA; Aaron Clauset, University of Colorado Boulder, USA continued in next column 38 SIAM Conference on Discrete Mathematics

Thursday, June 7 3:15-3:40 A Forest Building Process for Thursday, June 7 Simple Graphs MS42 Zhanar Berikkyzy and Steve Butler, Iowa CP10 State University, USA; Jay Cummings, Results from the Graduate Sacramento State University, USA; General Graph Theory Research Workshop in Kristin Heysse, Macalester College, USA; 2:45 PM-4:05 PM Combinatorics Paul Horn, University of Denver, USA; Ruth Luo, University of Illinois at Urbana- Room:North Classroom 1607 2:45 PM-5:15 PM Champaign, USA; Brent Moran, Berlin Chair: To Be Determined Mathematical School, Germany Room:North Classroom 1606 2:45-3:00 Limited Broadcast 3:45-4:10 Graph Saturation Problems Since the summer of 2014 the Graduate Domination and Multipacking with Colored Edges Frank Yang, University of Victoria, Canada Research Workshop in Combinatorics Michael Tait, Carnegie Mellon University, (GRWC) has worked with over a USA 3:05-3:20 On Essentially 4-Edge- hundred graduate students and postdocs Connected Cubic Bricks by engaging them in original research in 4:15-4:40 I,F Partitions of Sparse Nishad Kothari, University of Vienna, Graphs combinatorics. The research topics that Austria; Marcelo de Carvalho, Axel Brandt, Davidson College, USA; Universidade Federal do Mato Grosso have been explored cover a wide range Micheal Ferrarra, University of Colorado, including structural graph theory, graph do Sul, Brazil; Charles Little, Massey Denver, USA; Mohit Kumbhat, University University, New Zealand; Claudio coloring, extremal graph theory, and of Nevada, Reno, USA; Sarah Loeb, Lucchesi, University of Campinas, Brazil combinatorial linear algebra, resulting College of William & Mary, USA; in over twenty papers (and counting). Derrick Stolee, Microsoft, USA; Matthew 3:25-3:40 Vertex Disjoint Paths Covers This minisymposium will bring together Yancey, IDA/CCS, USA of Rectangular Grids, Tori, and Hypertori a few of the past participants to speak 4:45-5:10 Degree Conditions for Wing Hong Tony Wong, Kutztown University on some of the research which has come Small Contagious Sets in Bootstrap of Pennsylvania, USA out of GRWC over the past few years. Percolation More information about GRWC is online Andrew Uzzell, Grinnell College, USA 3:45-4:00 A Local Chordalization at CombinatoricsWorkshop.org. Approach to the Hadwiger Conjecture and the Erdös-Faber- Organizer: Bernard Lidicky Lovász Conjecture Iowa State University, USA Soogang Eoh, Seoul National University, Korea; Jihoon Choi, Cheongju University, Organizer: Steve Butler South Korea; Suh-Ryung Kim, Seoul Iowa State University, USA National University, Korea 2:45-3:10 The Zero Forcing Polynomial of a Graph Kirk Boyer, University of Denver, USA; Intermission Boris Brimkov, Rice University, USA; Sean English, Western Michigan 5:15 PM-5:30 PM University, USA; Daniela Ferrero, Texas State University, San Marcos, USA; Ariel Keller, Emory University, USA; Rachel Kirsch, University of Nebraska, USA; Michael Phillips, University of Colorado, SP2 Denver, USA; Carolyn Reinhart, Iowa Hot Topics Session State University, USA 5:30 PM-6:30 PM Room:North Classroom 1130 Chair: To Be Determined Abstract Not Available At Time Of Publication. Henry Cohn Microsoft Research New England, USA

continued in next column SIAM Conference on Discrete Mathematics 39

Friday, June 8 9:30-9:55 Embedding Trees with Friday, June 8 Minimum and Maximum Degree MS43 Conditions Maya Stein, Universidad de Chile, Chile Extremal Problems for Sparse Registration 10:00-10:25 Extremal Problems for Graphs and Hypergraphs - Multigraphs 7:30 AM-10:30 AM Part II of II Dhruv Mubayi, University of Illinois at Room:North Classroom 1130 Entry 9:30 AM-12:00 PM Chicago, USA; Caroline Terry, University of Maryland, USA Room:North Classroom 1806 10:30-10:55 Independent Sets in Closing Remarks For Part 1 see MS38 Sparse Hypergraphs Extremal theory for graphs and Jacques Verstraete, University of California, 8:10 AM-8:15 AM hypergraphs is a fast developing and San Diego, USA; Jeroen Schillewaert, University of Auckland, New Zealand Room:North Classroom 1130 important area within Combinatorics that typically studies extrema of parameters 11:00-11:25 Kissing Numbers in High of graphs and hypergraphs with given Dimensions properties. It has applications to areas Matthew Jenssen, University of Oxford, IP8 such as combinatorial geometry, number United Kingdom theory, coding theory, Information Algorithms for the 11:30-11:55 Turan Exponents of theory, etc. In recent decades, extremal Bipartite Graphs Asymmetric Traveling graph theory has experienced significant Tao Jiang, Miami University, USA; Jie Ma, Salesman Problem growth thanks to the development of University of Science and Technology 8:15 AM-9:00 AM some powerful methods such as the of China, China; Liana Yepremyan, probabilistic method, the regularity University of Oxford, United Kingdom Room:North Classroom 1130 method and the absorbing method. Chair: To Be Determined The latter two are especially effective on dense graphs. Relatively speaking, The traveling salesman problem is one there has been a lack of general tools of the most fundamental optimization for tackling extremal problems for problems. Given n cities and pairwise sparse graphs. However, there have distances, it is the problem of finding been many interesting developments in a tour of minimum distance that visits this area and some promising methods each city once. In spite of significant have been introduced such as dependent research efforts, current techniques random choice, delta system method, seem insufficient for settling the junta method, etc. The aim of this approximability of the traveling salesman mini-symposium is to bring together problem. The gap in our understanding a diverse group of active researchers is especially large in the general working on sparse problems using asymmetric setting where the distance different methods. The hope is that the from city i to j is *not* assumed to equal interchanging of ideas from different the distance from j to i. In this talk, we angles will help forging the development will give an overview of old and new of more universal tools for extremal approaches for settling this question. We problems in the sparse setting. We shall, in particular, talk about our new also hope that the broad range of the approach that gives the first constant- interesting results and methods covered factor approximation algorithm for the by the talks will help generate more asymmetric traveling salesman problem. interests from the general discrete This is based on joint work with Jakub mathematics community in the extremal Tarnawski and László Végh. problems in the sparse setting. Ola Svensson Organizer: Tao Jiang École Polytechnique Fédérale de Lausanne, Miami University, USA Switzerland Organizer: Liana Yepremyan University of Oxford, United Kingdom Coffee Break

9:00 AM-9:30 AM continued in next column Room:North Classroom 1130 Atrium 40 SIAM Conference on Discrete Mathematics

Friday, June 8 Friday, June 8 10:30-10:55 Gradient Flows of Wasserstein Spaces on Data Clouds MS44 MS45 and Their Continuum Limits Nicolas Garcia Trillos, Brown University, Structured Families of Graphs Graph Curvature and USA and Posets Related Topics 11:00-11:25 Large Scale Ricci 9:30 AM-12:00 PM 9:30 AM-12:00 PM Curvature on Graphs Mark Kempton, Harvard University, USA; Room:North Classroom 3205 Room:North Classroom 3207 Gabor Lippner, Northeastern University, This minisymposium brings together There are rich connections between the USA; Florentin Munch, University of researchers in the areas of structured spectral theory of the Laplace-Beltrami Potsdam, Germany; Shing-Tung Yau, families of graphs and posets, including operator on Riemannian manifolds and Harvard University, USA basic graph properties, graph minors and the spectral theory of graph Laplacians. 11:30-11:55 Using Curvature to Bound interval orders. These structured families A recent effort of researchers has been Stretches in Eigenfunctions of Graphs are utilized to organize and analyze to further develop analogies between Fan Chung, University of California, San data. Key goals include characterization; Riemannian manifolds and graphs by Diego, USA; Shing-Tung Yau, Harvard recognition and translation from one developing notions of curvature and University, USA setting to another. Some families can be curvature lower bounds for graphs. These recognized in polynomial time and others efforts involve a number of ideas from not. probability and geometry. Two major approaches developed recently are the use Organizer: Karen Collins of curvature-dimension type inequalities, Wesleyan University, USA generalizing Bochner’s formula, in a Organizer: Ann N. Trenk graph setting and using the Wasserstein Wellesley College, USA distance between probability distributions 9:30-9:55 Structured Graphs and to define a notion of graph curvature. Posets Overview Graph curvature notions have led to Karen Collins, Wesleyan University, USA graph theoretical analogues of a number of results from Riemannian geometry, 10:00-10:25 Hereditary Families and including eigenvalue bounds (such as the Dominance Order Michael D. Barrus, University of Rhode Buser’s inequality), and volume and Island, USA diameter bounds. This mini-symposium brings together a number of active 10:30-10:55 Hamiltonian Path Variants researchers in the area to discuss recent in Structured Graph Families results in this direction, and further Garth T. Isaak, Lehigh University, USA challenges on applying graph curvature as 11:00-11:25 Using Three-Sided well as on related problems. Brambles to Bound Treewidth in Planar Graphs Organizer: Paul Horn Brett Smith, Yale University, USA University of Denver, USA 11:30-11:55 Non-monochromatic 9:30-9:55 Curvature and the Geometry Triangles in 2-edge-coloured Graphs of Graphs Jessica McDonald, Auburn University, USA Paul Horn, University of Denver, USA 10:00-10:25 Volume Growth and Buser’s Inequality in Graphs Peter Ralli, Princeton University, USA

continued in next column SIAM Conference on Discrete Mathematics 41

Friday, June 8 Friday, June 8 9:30-9:55 Robustness and Submodularity MS46 MS47 Stefanie Jegelka and Matthew Staib, Massachusetts Institute of Technology, Computational Methods in Foundations of Data USA; Bryan Wilder, University of Southern Discrete Mathematics Science - Part II of II California, USA 9:30 AM-12:00 PM 9:30 AM-12:00 PM 10:00-10:25 Statistical Estimation Under Group Actions: The Sample Room:North Classroom 1207 Room:North Classroom 1130 Complexity of Multi-Reference Computational methods in discrete For Part 1 see MS41 Alignment mathematics have become more widely In support of the NSF initiative on Afonso Bandeira, Courant Institute of used in recent years. Such approaches Trandisciplinary Research in Principles Mathematical Sciences, New York have had some stunning successes, of Data Science (TRIPODS) and tapping University, USA such as the Four Color Theorem, the into the broader research interest and 10:30-10:55 Differential Privacy for nonexistence of the projective plane of investment from research labs across Growing Databases order 10, and the proof of the Kepler the nation, this minisymposium will Rachel Cummings, Georgia Institute Conjecture, but these methods are now feature lectures on frontier research in of Technology, USA; Sara Krehbiel, becoming part of the toolbox of the foundational aspects of data science. A University of Richmond, USA; Kevin everyday working mathematician. This primary goal is to feature a diverse set of Lai and Uthaipon (Tao) Tantipongpipat, minisymposium will showcase recent speakers from computing, engineering Georgia Institute of Technology, USA results in the area. and statistics who will help identify 11:00-11:25 Title Not Available At Time algorithmic and mathematical challenges Of Publication Organizer: Stephen Hartke confronting the current state of this Hanie Sedghi, Google, Inc., USA University of Colorado, USA fast growing, exciting interdisciplinary 11:30-11:55 Catalyst, Generic 9:30-9:55 Chromatic Folkman Numbers field. Topics will include nonlinear Acceleration Scheme for Gradient- and Some Related Computational optimization and high-dimensional based Optimization Challenges statistics, statistical and large-scale Zaid Harchaoui, University of Washington, Xiaodong Xu, Guangxi Academy of Sciences, machine learning, data-driven algorithm USA; Hongzhou Lin, Massachusetts Guangxi, China; Meilian Liang, Guangxi design, scalable learning algorithms, Institute of Technology, USA; Courtney University, China; Stanislaw Radziszowski, Paquette, Lehigh University, USA; Julien Rochester Institute of Technology, USA automation of data analysis, neural nets and deep learning, structured sparsity Mairal, Inria, France; Dmitriy Drusvyatskiy, University of Washington, USA 10:00-10:25 Computational Bounds on and compressed sensing, submodular Classical Ramsey Numbers optimization, and analysis of complex, Brendan McKay, Australian National University, Australia high-dimensional data sets, large networks and computational phylogeny. 10:30-10:55 Generating New Patterns for Antique Lace Organizer: Prasad Tetali Veronika Irvine, University of Waterloo, Georgia Institute of Technology, USA Canada Organizer: Jennifer Chayes 11:00-11:25 On Small k-chromatic Microsoft Research, USA Graphs of Girth g Geoffrey Exoo, Indiana State University, USA Organizer: David Shmoys 11:30-11:55 Rotation Systems for Cornell University, USA Hamilton Cycles Aaron Williams, Bard College at Simon’s Rock, USA

continued in next column 42 SIAM Conference on Discrete Mathematics

Friday, June 8 Jeremy Martin, University of Kansas, USA; Bruce Sagan, Michigan State MS48 University, USA Graph Polynomials 10:30-10:55 On the Stability of Independence Polynomials 9:30 AM-12:00 PM Ben R. Cameron and Jason Brown, Dalhousie University, Canada Room:North Classroom 3209 11:00-11:25 Chromatic Symmetric For a variety of combinatorial problems, Functions and e-Positivity such as network reliability and graph Samantha Dahlberg, University of British colourings, the models turn out to be Columbia, Canada graph polynomials. On the other hand, the investigation of various subgraph 11:30-11:55 On the Roots of Wiener Polynomials of Graphs properties (such as independence and domination) leads one to explore the Jason Brown, Dalhousie University, Canada; associated combinatorial sequences by Lucas Mol, The University of Winnipeg, formulating generating polynomials. Canada; Ortrud R. Oellermann, The In all cases, polynomials carry useful University of Winnipeg, Canada or even essential information about the underlying combinatorics, and the connections allow one to draw on classical areas of mathematics, such as analysis and algebra, in the investigations. Combinatorial properties such as unimodality and log-concavity of various graphical sequences can surprisingly be extracted from the location of the roots of such polynomials. Different graph properties can also lead to interesting analytical and algebraic properties of the polynomials as well, such as factorability, the distribution of roots in the complex plane, and even fractals appearing in their roots. We aim to draw on the research of people working on a variety of graph polynomials to share techniques and methods to help advance the study of each polynomial. Organizer: Ben R. Cameron Dalhousie University, Canada Organizer: Jason Brown Dalhousie University, Canada 9:30-9:55 The Theory of Network Reliability Jason Brown, Dalhousie University, Canada 10:00-10:25 Counting Increasing Spanning Forests in Graphs Joshua Hallam, Wake Forest University, USA;

continued in next column SIAM Conference on Discrete Mathematics 43

Or­ganizer and Speaker Index 44 SIAM Conference on Discrete Mathematics

A Bucic, Matija, MS5, 10:00 Mon Currie, James D., MS36, 9:30 Thu Abebe, Rediet, MS35, 10:30 Thu Burstein, David, CP8, 3:25 Wed Currie, James D., MS36, 9:30 Thu Alman, Josh, MS27, 3:15 Wed Bushaw, Neal, MS31, 2:45 Wed Cusack, Charles A., MS25, 10:00 Wed Asplund, John, MS25, 9:30 Wed Butler, Steve, MS20, 2:45 Tue Czygrinow, Andrjez, MS31, 3:15 Wed Asplund, John, MS25, 11:00 Wed Butler, Steve, MS42, 2:45 Thu D Asplund, John, MS31, 2:45 Wed Byszewski, Jakub, MS36, 10:00 Thu Dahlberg, Samantha, MS48, 11:00 Fri Asplund, John, MS37, 9:30 Thu C Davies, James G., CP7, 9:50 Wed Avramovic, Ivan, CP4, 9:30 Tue Cai, Yue, MS16, 9:30 Tue Davis, Robert, MS19, 4:15 Tue B Cai, Yue, MS16, 11:30 Tue Du, Ruoxia, MS19, 3:45 Tue Bal, Deepak, MS4, 9:30 Mon Cai, Yue, MS19, 2:45 Tue Dudek, Andrzej, MS10, 4:15 Mon Bal, Deepak, MS10, 2:45 Mon Cameron, Ben R., MS48, 9:30 Fri Duffus, Dwight, MS12, 10:00 Tue Bamforth, Adam, MS6, 3:45 Mon Cameron, Ben R., MS48, 10:30 Fri Dvorak, Zdenek, MS2, 9:30 Mon Bandeira, Afonso, MS47, 10:00 Fri Cao, Yixin, MS27, 2:45 Wed E Bard, Stefan, MS23, 11:00 Wed Cao, Yixin, MS34, 9:30 Thu Edwards, Katherine, MS21, 10:30 Wed Barrus, Michael D., MS44, 10:00 Fri Cao, Yixin, MS34, 9:30 Thu Ekim, Tinaz, MS17, 3:45 Tue Bennett, Patrick, MS4, 9:30 Mon Chayes, Jennifer, MS41, 2:45 Thu El Rouayheb, Salim, MS9, 3:15 Mon Bennett, Patrick, MS4, 9:30 Mon Chayes, Jennifer, MS47, 9:30 Fri Eoh, Soogang, CP10, 3:45 Thu Bennett, Patrick, MS10, 2:45 Mon Chen, Guantao, MS21, 11:00 Wed Eslava, Laura, MS4, 11:00 Mon Benson, Austin, MS35, 9:30 Thu Chen, Hong-Bin, MS39, 3:15 Thu Exoo, Geoffrey, MS46, 11:00 Fri Benson, Austin, MS35, 9:30 Thu Chen, Ricky X., CP4, 11:10 Tue Benson, Austin, MS40, 2:45 Thu Choi, Ilkyoo, MS3, 10:00 Mon F Finlinson, Kathleen, MS35, 11:30 Thu Biro, Csaba, MS12, 9:30 Tue Chuangpishit, Huda, MS29, 4:15 Wed Florez, Rigoberto, MS26, 11:30 Wed Bodwin, Greg, MS22, 10:00 Wed Chung, Fan, MS45, 11:30 Fri Fox, Kyle, MS22, 11:30 Wed Boettcher, Julia, MS38, 2:45 Thu Cioaba, Sebastian, MS20, 2:45 Tue Frazier, Peter I., MS41, 2:45 Thu Bonamy, Marthe, MS3, 10:30 Mon Cohn, Henry, SP2, 5:30 Thu Bonato, Anthony, MS29, 2:45 Wed Collins, Karen, MS14, 11:00 Tue G Bonato, Anthony, MS35, 11:00 Thu Collins, Karen, MS44, 9:30 Fri Gao, Pu, MS4, 10:00 Mon Borgs, Christian, MS41, 3:15 Thu Collins, Karen, MS44, 9:30 Fri Garcia Trillos, Nicolas, MS45, 10:30 Fri Bosek, Bartlomiej, MS6, 2:45 Mon Condon, Padraig, CP7, 9:30 Wed Ghandehari, Mahya, MS29, 3:45 Wed Boutin, Debra L., MS14, 9:30 Tue Constantine, Paul, CP8, 3:45 Wed Ghasemi, Arash, CP4, 10:30 Tue Boutin, Debra L., MS14, 10:00 Tue Costalonga, Joao Paulo, MS32, 4:15 Ghasemian, Amir, MS40, 4:15 Thu Wed Boutin, Debra L., MS17, 2:45 Tue Gimbel, John, MS17, 3:15 Tue Cowen, Lenore J., MS15, 9:30 Tue Boyle, Elette, MS9, 4:15 Mon Gitter, Anthony, MS15, 10:00 Tue Cowen, Lenore J., MS15, 9:30 Tue Brewster, Richard, MS17, 4:15 Tue Gleich, David F., MS35, 10:00 Thu Cowen, Lenore J., MS18, 2:45 Tue Brewster, Richard, MS23, 9:30 Wed Goddard, Wayne, CP9, 9:50 Thu Cranston, Daniel, MS3, 9:30 Mon Briggs, Joseph G., CP7, 10:50 Wed Goldwasser, John L., MS28, 4:45 Wed Cranston, Daniel, MS3, 9:30 Mon Brimkov, Boris, MS42, 2:45 Thu Gonzalez Hermosillo De La, Sebastian, Cranston, Daniel, MS8, 2:45 Mon CP2, 9:30 Mon Brown, Jason, MS48, 9:30 Fri Cummings, Rachel, MS47, 10:30 Fri Gruslys, Vytautas, MS11, 4:15 Mon Brown, Jason, MS48, 9:30 Fri

Italicized names indicate session organizers SIAM Conference on Discrete Mathematics 45

Grzesik, Andrzej, MS24, 9:30 Wed J Kurihara, Takashi, CP4, 10:50 Tue Grzesik, Andrzej, MS24, 11:00 Wed Jacobson, Sheldon H., CP4, 10:10 Tue Kwan, Matthew, MS30, 2:45 Wed Grzesik, Andrzej, MS30, 2:45 Wed Janssen, Jeannette, MS29, 2:45 Wed Kwon, O-Joung, MS2, 11:00 Mon Gunderson, Karen, MS29, 3:15 Wed Janssen, Jeannette, MS29, 2:45 Wed L Guo, He, MS10, 3:15 Mon Jegelka, Stefanie, MS47, 9:30 Fri Lagoutte, Aurélie, MS8, 4:45 Mon Guo, Peter L., MS16, 10:00 Tue Jenssen, Matthew, MS43, 11:00 Fri Lai, Tri, MS19, 4:45 Tue Gutierrez, Marisa, MS25, 11:30 Wed Jiang, Tao, MS38, 2:45 Thu Laison, Josh, MS37, 10:30 Thu H Jiang, Tao, MS43, 9:30 Fri Langi, Zsolt, CP6, 2:45 Tue Halasz, Kevin C., CP1, 10:10 Mon Jiang, Tao, MS43, 11:30 Fri Larsen, Acadia B., CP8, 2:45 Wed Hallam, Joshua, MS12, 11:00 Tue Jiang, Zilin, MS20, 3:15 Tue Leck, Uwe, MS33, 10:00 Thu Hallam, Joshua, MS48, 10:00 Fri Jing, Yifan, MS7, 3:45 Mon Lee, Joonkyung, MS30, 4:15 Wed Hamilton, Kathleen, CP1, 9:30 Mon K Lee, Sooyeon, MS32, 3:45 Wed Harchaoui, Zaid, MS47, 11:30 Fri Kalinowski, Thomas, MS39, 2:45 Thu Lei, Haoyun, MS18, 3:15 Tue Harrelson, Joshua, MS28, 2:45 Wed Kang, Dongyeap, CP2, 10:30 Mon Leiserson, Mark, MS15, 11:00 Tue Hartke, Stephen, MS46, 9:30 Fri Karlin, Anna R., IP3, 8:15 Tue Letzter, Shoham, MS5, 9:30 Mon Hartung, Elizabeth, CP4, 11:30 Tue Katona, Gyula, MS33, 9:30 Thu Letzter, Shoham, MS11, 2:45 Mon Heitsch, Christine, MS18, 4:15 Tue Kavran, Andrew J., MS15, 11:30 Tue Letzter, Shoham, MS11, 2:45 Mon Hemenway, Brett, MS9, 2:45 Mon Keller, Mitchel T., MS1, 9:30 Mon Li, Jiaao, MS8, 3:15 Mon Heysse, Kristin, MS42, 3:15 Thu Keller, Mitchel T., MS1, 9:30 Mon Li, Weiqi, CP4, 9:50 Tue Hicks, Angela, MS19, 3:15 Tue Keller, Mitchel T., MS6, 2:45 Mon Li, Wei-Tian, MS33, 9:30 Thu Hieronymi, Philipp, MS36, 11:00 Thu Keller, Mitchel T., MS12, 9:30 Tue Li, Wei-Tian, MS33, 11:30 Thu Hogenson, Kirsten, MS6, 4:45 Mon Kelly, Thomas, MS8, 2:45 Mon Li, Wei-Tian, MS39, 2:45 Thu Hong, Taehee, CP2, 10:10 Mon Kenter, Franklin, MS25, 9:30 Wed Li, Xin, MS22, 11:00 Wed Hoppen, Carlos, MS4, 10:30 Mon Kenter, Franklin, MS25, 9:30 Wed Lidicky, Bernard, MS28, 4:15 Wed Horn, Paul, MS45, 9:30 Fri Kenter, Franklin, MS31, 2:45 Wed Lidicky, Bernard, MS42, 2:45 Thu Horn, Paul, MS45, 9:30 Fri Kenter, Franklin, MS37, 9:30 Thu Lifshitz, Noam, MS38, 4:15 Thu Hristov, Borislav, MS18, 2:45 Tue Kim, Eun Jung, MS34, 11:00 Thu Lim, Choon Sung, CP2, 10:50 Mon Hurlbert, Glenn, MS25, 10:30 Wed Kim, Gene, MS19, 2:45 Tue Lin, Jephian C.-H., MS20, 4:15 Tue Hurlbert, Glenn, MS25, 9:30 Wed Kingan, Sandra, MS26, 9:30 Wed Lincoln, Andrea, MS22, 9:30 Wed Hurlbert, Glenn, MS31, 2:45 Wed Kingan, Sandra, MS32, 2:45 Wed Lippner, Gabor, MS45, 11:00 Fri Hurlbert, Glenn, MS31, 3:45 Wed Kingan, Sandra, MS32, 2:45 Wed Liu, Chun-Hung, MS8, 4:15 Mon Hurlbert, Glenn, MS37, 9:30 Thu Kliewer, Joerg, MS9, 4:45 Mon Liu, Wenjian, CP1, 10:30 Mon Hutchinson, Joan P., MS14, 10:30 Tue Klimosova, Tereza, MS2, 10:30 Mon Long, Eoin, MS38, 4:45 Thu Huynh, Tony, MS13, 11:00 Tue Knapp, Michael P., MS31, 4:15 Wed Lovasz, Laszlo M., MS24, 9:30 Wed Luo, Ruth, MS30, 4:45 Wed I Korandi, Daniel, MS30, 3:15 Wed Irvine, Veronika, MS46, 10:30 Fri Kothari, Nishad, CP10, 3:05 Thu M Isaak, Garth T., MS44, 10:30 Fri Kral, Daniel, IP1, 8:15 Mon MacGillivray, Gary, MS14, 9:30 Tue Ishai, Yuval, MS9, 3:45 Mon Krasko, Evgeniy, CP8, 3:05 Wed Macgillivray, Gary, MS17, 2:45 Tue Ito, Takehiro, MS23, 9:30 Wed Krivelevich, Michael, IP4, 8:15 Wed MacGillivray, Gary, MS17, 4:45 Tue Iwata, Yoichi, MS27, 3:45 Wed Kronenthal, Brian, CP3, 3:45 Mon Maehara, Takanori, MS41, 4:15 Thu

Italicized names indicate session organizers 46 SIAM Conference on Discrete Mathematics

Martin, Ryan R., MS33, 10:30 Thu Peng, Xing, CP5, 3:05 Tue Servatius, Brigitte, MS26, 10:00 Wed Martino, Ivan, MS26, 11:00 Wed Perez-Gimenez, Xavier, MS4, 11:30 Shallit, Jeffrey, MS36, 9:30 Thu Martins, Taisa, MS24, 11:30 Wed Mon Shan, Songling, MS28, 3:45 Wed McCarty, Rose, MS2, 11:30 Mon Petti, Samantha N., CP1, 9:50 Mon Shikhelman, Clara, MS11, 3:15 Mon McConnell, Ross, MS27, 4:15 Wed Pfender, Florian, MS24, 10:00 Wed Shmoys, David, MS41, 2:45 Thu McDonald, Jessica, MS21, 9:30 Wed Pierron, Théo, MS28, 3:15 Wed Shmoys, David, MS47, 9:30 Fri McDonald, Jessica, MS28, 2:45 Wed Pokrovskiy, Alexey, MS5, 9:30 Mon Sieben, Nandor, MS31, 4:45 Wed McDonald, Jessica, MS44, 11:30 Fri Pokrovskiy, Alexey, MS5, 9:30 Mon Sileikis, Matas, MS10, 2:45 Mon McKay, Brendan, MS46, 10:00 Fri Pokrovskiy, Alexey, MS11, 2:45 Mon Singh, Mona, IP7, 1:30 Thu McKee, Terry, CP9, 9:30 Thu Poznanovikj, Svetlana, MS16, 10:30 Smith, Brett, MS44, 11:00 Fri Tue Mckenzie, Daniel, CP3, 3:25 Mon Song, Zixia, MS21, 10:00 Wed Puleo, Gregory J., MS21, 9:30 Wed Methuku, Abhishek, MS38, 3:45 Thu Spirkl, Sophie, MS8, 3:45 Mon Puleo, Gregory J., MS21, 9:30 Wed Mohar, Bojan, MS7, 3:15 Mon Spirkl, Sophie, MS13, 10:00 Tue Puleo, Gregory J., MS28, 2:45 Wed Mol, Lucas, CP6, 3:05 Tue Staden, Katherine L., MS38, 3:15 Thu Purvine, Emilie, MS6, 4:15 Mon Mol, Lucas, MS48, 11:30 Fri Stein, Maya, MS43, 9:30 Fri Molla, Theodore, CP2, 9:50 Mon R Sugimori, Ken, MS32, 3:15 Wed Morris, Robert, IP6, 8:15 Thu Radziszowski, Stanis{l}aw, MS46, 9:30 Suk, Andrew, IP5, 1:30 Wed Morrison, Natasha, MS11, 3:45 Mon Fri Svensson, Ola, IP8, 8:15 Fri Morse, Ada, MS26, 10:30 Wed Ralli, Peter, MS45, 10:00 Fri Mouatadid, Lalla, MS34, 11:30 Thu Rampersad, Narad, MS36, 9:30 Thu T Tait, Michael, MS20, 2:45 Tue Mousset, Frank, MS5, 10:30 Mon Rawat, Ankit, MS9, 2:45 Mon Tait, Michael, MS42, 3:45 Thu Mu, Lili, MS39, 4:15 Thu Reber, David, CP1, 10:50 Mon Taylor, Dane, MS40, 3:45 Thu Mubayi, Dhruv, MS43, 10:00 Fri Redlin, Shayla, MS14, 9:30 Tue Teshima, Laura E., MS23, 10:30 Wed Muehlenthaler, Moritz, MS23, 11:30 Wed Reid, Talmage J., MS26, 9:30 Wed Tesler, Glenn, MS18, 4:45 Tue Muzi, Irene, MS7, 4:15 Mon Rigollet, Philippe, MS41, 3:45 Thu Tetali, Prasad, MS41, 2:45 Thu Rocha, Israel S., MS29, 4:45 Wed Tetali, Prasad, MS47, 9:30 Fri N Rodriguez, Cynthia, CP7, 10:10 Wed Nassar, Huda, MS40, 2:45 Thu Timmons, Craig, CP5, 2:45 Tue Rosenfeld, Matthieu, MS36, 10:30 Thu Nelsen, Lauren M., MS20, 3:45 Tue Tomon, Istvan, MS33, 11:00 Thu Rowland, Eric, MS36, 11:30 Thu Nishida, Yuki, CP3, 2:45 Mon Tompkins, Casey, MS39, 3:45 Thu Noel, Jonathan A., MS23, 10:00 Wed Š Tran, Tuan, MS12, 10:30 Tue Norin, Sergey, MS2, 10:00 Mon Šámal, Robert, MS3, 11:00 Mon Trenk, Ann N., MS1, 10:30 Mon O S Trenk, Ann N., MS44, 9:30 Fri O, Suil, CP5, 3:25 Tue Sandeep, R B, MS34, 10:00 Thu Trotter, William T., MS6, 3:15 Mon Oum, Sang-Il, MS7, 2:45 Mon Sanhueza-Matamala, Nicolás, CP9, Tsourakakis, Charalampos, MS40, 3:15 10:10 Thu Thu Owen, Megan, MS18, 3:45 Tue Santana, Michael, CP7, 10:30 Wed U P Saurabh, Saket, MS27, 2:45 Wed Uiyyasathian, Chariya, CP7, 11:10 Papp, Laszlo F., MS37, 10:00 Thu Saurabh, Saket, MS27, 2:45 Wed Wed Pegden, Wes, MS10, 3:45 Mon Saurabh, Saket, MS34, 9:30 Thu Uzzell, Andrew, MS42, 4:45 Thu Peng, Jian, MS15, 10:30 Tue Schmitt, John, MS37, 11:00 Thu Sedghi, Hanie, MS47, 11:00 Fri

Italicized names indicate session organizers SIAM Conference on Discrete Mathematics 47

V Yerger, Carl, MS37, 9:30 Thu Verstraete, Jacques, MS43, 10:30 Fri Yerger, Carl, MS37, 9:30 Thu Volec, Jan, MS24, 9:30 Wed Young, Michael, MS14, 11:30 Tue Volec, Jan, MS24, 10:30 Wed Young, Stephen J., MS1, 9:30 Mon Volec, Jan, MS30, 2:45 Wed Young, Stephen J., MS1, 10:00 Mon Young, Stephen J., MS6, 2:45 Mon W Young, Stephen J., MS12, 9:30 Tue Walker, Shanise, MS1, 11:00 Mon Wang, Xingwei, MS16, 11:00 Tue Z Warnow, Tandy, MS41, 4:45 Thu Zehavi, Meirav, MS34, 10:30 Thu Wei, Fan, MS30, 3:45 Wed Zhao, Yufei, SP1, 1:30 Tue West, Douglas B., MS17, 2:45 Tue Zhao, Yufei, MS22, 10:30 Wed Williams, Aaron, MS46, 11:30 Fri Zhong, Mingxian, MS13, 10:30 Tue Williford, Jason, MS20, 4:45 Tue Wollan, Paul, MS2, 9:30 Mon Wollan, Paul, MS7, 2:45 Mon Wollan, Paul, MS13, 9:30 Tue Wollan, Paul, MS13, 9:30 Tue Wong, Wing Hong Tony, CP10, 3:25 Thu Wood, David R., MS13, 11:30 Tue Wootters, Mary, MS9, 2:45 Mon Wu, Hehui, MS3, 11:30 Mon X Xu, Rupei, MS22, 9:30 Wed Xu, Rupei, MS22, 9:30 Wed Xue, Chenxiao, MS37, 11:30 Thu Y Yan, Catherine, IP2, 1:30 Mon Yan, Catherine, MS16, 9:30 Tue Yan, Catherine, MS16, 9:30 Tue Yan, Catherine, MS19, 2:45 Tue Yancey, Matthew, MS42, 4:15 Thu Yang, Frank, CP10, 2:45 Thu Ya’u, Abdulsalam G., CP3, 3:05 Mon Yepremyan, Liana, MS5, 11:00 Mon Yepremyan, Liana, MS38, 2:45 Thu Yepremyan, Liana, MS43, 9:30 Fri Yerger, Carl, MS25, 9:30 Wed Yerger, Carl, MS31, 2:45 Wed

Italicized names indicate session organizers 48 SIAM Conference on Discrete Mathematics

Notes SIAM Conference on Discrete Mathematics 49

DM18 Budget

Conference Budget SIAM Conference on Discrete Mathematics June 4-8, 2018 Denver, Colorado

Expected Paid Attendance 300

Revenue Registration Income $83,865 Total $83,865

Expenses Printing $1,900 Organizing Committee $2,700 Invited Speakers $10,200 Food and Beverage $18,000 Room Rental $0 Advertising $3,300 Conference Labor (including benefits) $29,535 Other (supplies, staff travel, freight, misc.) $6,425 Administrative $6,813 Accounting/Distribution & Shipping $4,456 Information Systems $7,538 Customer Service $2,907 Marketing $4,758 Office Space (Building) $3,091 Other SIAM Services $3,802 Total $105,425

Net Conference Expense ($21,560)

Support Provided by SIAM $21,560 $0

Estimated Support for Travel Awards not included above: Early Career and Students 27 $21,190 University of Colorado Campus Map