Final Program and Abstracts

Sponsored by the SIAM Activity Group on Discrete Mathematics

The SIAG on Discrete Mathematics focuses on combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game 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 Email: [email protected] Conference Web: www.siam.org/meetings/ Membership and Customer Service: (800) 447-7426 (US& Canada) or +1-215-382-9800 (worldwide)

www.siam.org/meetings/dm16 2 2016 SIAM Conference on Discrete Mathematics

Table of Contents Local Organizing Committee Corporate Members and Affiliates Program-At-A-Glance...Separate handout Albert Bush SIAM corporate members provide General Information...... 2 Georgia State University, USA their employees with knowledge about, Get-togethers...... 4 Yi Zhao access to, and contacts in the applied Invited Plenary Presentations...... 5 Georgia State University, USA mathematics and computational sciences Prize Lecture...... 7 community through their membership Program Schedule...... 9 benefits. Corporate membership is more Poster Session...... 35 Conference Location than just a bundle of tangible products Abstracts...... 39 All sessions and on-site registration and services; it is an expression of support Speaker and Organizer Index...... 95 will take place on the Georgia State for SIAM and its programs. SIAM is Conference Budget...... University Campus located in the Student pleased to acknowledge its corporate ...... Inside Back Cover Center. members and sponsors. In recognition University Meeting Room Map...... of their support, non-member attendees ...... Back Cover Georgia State University who are employed by the following Student Center organizations are entitled to the SIAM

55 Gilmer Street member registration rate. Organizing Committee Atlanta, GA 30303

Co-Chairs Corporate Institutional Henry Cohn Members Microsoft Research New England, USA SIAM Registration Desk The Aerospace Corporation Dana Randall The SIAM registration desk is located Air Force Office of Scientific Research Georgia Institute of Technology, USA in the Georgia State University Student Center. It is open during the following Amazon hours: Aramco Services Company Organizing Committee Monday, June 6 Bechtel Marine Propulsion Laboratory Sara Billey 7:00 AM – 4:00 PM The Boeing Company University of Washington, USA Tuesday, June 7 CEA/DAM Jacob Fox 7:30 AM – 3:30 PM Department of National Defence (DND/ Stanford University, USA Wednesday, June 8 CSEC) Peter Keevash 7:30 AM – 3:30 PM DSTO- Defence Science and Technology University of Oxford, United Kingdom Organisation Thursday, June 9 Daniel Král’ Hewlett-Packard University of Warwick, United Kingdom 7:30 AM – 3:30 PM Huawei FRC French R&D Center Pablo Parrilo Friday, June 10 IBM Corporation Massachusetts Institute of Technology, 7:30 AM – 10:00 AM USA IDA Center for Communications Lex Schrijver Research, La Jolla University of Amsterdam and CWI, Child Care IDA Center for Communications Netherlands Research, Princeton For local child care resources, please use: Joel Spencer Institute for Defense Analyses, Center for New York University, USA Computing Sciences Bernd Sturmfels Friend of Family: +1-770-725-2748 Lawrence Berkeley National Laboratory University of California, Berkeley, USA Nanny Poppinz: +1-678-608-2769 Lawrence Livermore National Labs Blair D. Sullivan TLC: +1770-410-4774 Lockheed Martin North Carolina State University, USA Los Alamos National Laboratory Paul Wollan University of Rome “La Sapienza”, Italy Max-Planck-Institute for Dynamics of Complex Technical Systems Mentor Graphics 2016 SIAM Conference on Discrete Mathematics 3

National Institute of Standards and the conference, you can apply the Standard Audio/Visual Technology (NIST) difference between what you paid Set-Up in Meeting Rooms and what a member would have paid National Security Agency (DIRNSA) ($130 for a Non-Member and $65 for a SIAM does not provide computers for Naval PostGrad Non-Member Mini Speaker/Organizer) any speaker. When giving an electronic Oak Ridge National Laboratory, towards a SIAM membership. Contact presentation, speakers must provide their managed by UT-Battelle for the SIAM Customer Service for details or own computers. SIAM is not responsible Department of Energy join at the conference registration desk. for the safety and security of speakers’ computers. Sandia National Laboratories Schlumberger-Doll Research If you are a SIAM member, it only The Plenary Session Room will have United States Department of Energy costs $10 to join the SIAM Activity Group on the Discrete Mathematics one (1) screen, one (1) data projector U.S. Army Corps of Engineers, Engineer (SIAG/DM). As a SIAG/DM member, and one (1) overhead projector. The data Research and Development Center you are eligible for an additional $10 projectors support VGA connections US Naval Research Labs discount on this conference, so if you only. Presenters requiring an HDMI or alternate connection must provide their List current April 2016. paid the SIAM member rate to attend the conference, you might be eligible own adaptor. for a free SIAG/DM membership. Funding Agency Check at the registration desk. All other concurrent/breakout rooms will have one (1) screen and one (1) data SIAM and the Conference Organizing projector. The data projectors support Committee wish to extend their thanks Free Student Memberships are VGA connections only. Presenters and appreciation to the U.S. National available to students who attend an requiring an HDMI or alternate Science Foundation for its support of institution that is an Academic Member connection must provide their own this conference of SIAM, are members of Student Chapters of SIAM, or are nominated adaptor. by a Regular Member of SIAM. If you have questions regarding Join onsite at the registration desk, availability of equipment in the meeting go to www.siam.org/joinsiam to join room of your presentation, please see a online or download an application staff member at the registration desk. form, or contact SIAM Customer Leading the applied Service: Internet Access mathematics community Telephone: +1-215-382-9800 The Student Center does have internet Join SIAM and save! (worldwide); or 800-447-7426 (U.S. and Canada only) connection capability. Information SIAM members save up to $130 on regarding internet access is available at full registration for the 2016 SIAM Fax: +1-215-386-7999 www.siam.org/meetings/dm16/general. Conference on Discrete Mathematics E-mail: [email protected] php. (DM16)! Join your peers in supporting Postal mail: the premier professional society for applied mathematicians and Society for Industrial and Applied Registration Fee Includes Mathematics, computational scientists. SIAM • Admission to all technical sessions members receive subscriptions to 3600 Market Street, 6th floor • Business Meeting SIAM Review, SIAM News and SIAM Philadelphia, PA 19104-2688 USA Unwrapped, and enjoy substantial (open to SIAG/DM members) discounts on SIAM books, journal • Coffee breaks daily subscriptions, and conference • Poster session registrations. • Room set-ups and audio/visual equipment If you are not a SIAM member and • Welcome Reception paid the Non-Member or Non-Member Mini Speaker/Organizer rate to attend 4 2016 SIAM Conference on Discrete Mathematics

Job Postings Get-togethers Please Note Please check with the SIAM registration • Welcome Reception SIAM is not responsible for the safety desk regarding the availability of job Monday, June 6 and security of attendees’ computers. Do not leave your laptop computers postings or visit http://jobs.siam.org. 5:30 PM - 7:30 PM unattended. Please remember to turn off your cell phones, pagers, etc. during Important Notice to Poster sessions. Presenters • Business Meeting (open to SIAG/DM members) The poster session is scheduled for Wednesday, June 8 Recording of Presentations Thursday, June 9, at 5:30 PM. All materials must be posted by Thursday, 6:30 PM - 7:15 PM Audio and video recording of June 9, 5:30 PM, the official start time presentations at SIAM meetings is of the session. Poster displays must be • Poster Session prohibited without the written permission of the presenter and SIAM. removed at the end of the session, by Thursday, June 9 6:30 PM. Posters remaining after this 5:30 PM - 6:30 PM time will be discarded. SIAM is not responsible for discarded posters. Social Media Statement on Inclusiveness SIAM is promoting the use of social As a professional society, SIAM is media, such as Facebook and Twitter, SIAM Books and Journals committed to providing an inclusive in order to enhance scientific discussion SIAM books are available at a discounted climate that encourages the open at its meetings and enable attendees price during the conference. Titles expression and exchange of ideas, that to connect with each other prior to, on Display forms are available with is free from all forms of discrimination, during and after conferences. If you instructions on how to place a book order. harassment, and retaliation, and that are tweeting about a conference, please is welcoming and comfortable to all use the designated hashtag to enable members and to those who participate other attendees to keep up with the Twitter conversation and to allow better Table Top Display in its activities. In pursuit of that commitment, SIAM is dedicated to the archiving of our conference discussions. Elsevier philosophy of equality of opportunity and The hashtag for this meeting is treatment for all participants regardless #SIAMDM16. of gender, gender identity or expression, Name Badges sexual orientation, race, color, national A space for emergency contact or ethnic origin, religion or religious information is provided on the back of belief, age, marital status, disabilities, your name badge. Help us help you in the veteran status, field of expertise, or any event of an emergency! other reason not related to scientific merit. This philosophy extends from SIAM conferences, to its publications, and Comments? to its governing structures and bodies. We expect all members of SIAM and Comments about SIAM meetings are participants in SIAM activities to work encouraged! Please send to: towards this commitment. Cynthia Phillips, SIAM Vice President for Programs ([email protected]). 2016 SIAM Conference on Discrete Mathematics 5

Invited Plenary Speakers

** All Invited Plenary Presentations will take place in SCE Speakers Auditorium - First Floor**

Monday, June 6 8:15 AM - 9:00 AM IP1 Accuracy, Privacy, and Validity: When Right is Wrong and Wrong is Right Cynthia Dwork, Microsoft Research, USA

1:30 PM - 2:15 PM IP2 From Algorithm to Theorem (in Probabilistic Combinatorics) Persi Diaconis, Stanford University, USA

Tuesday, June 7 8:15 AM - 9:00 AM IP3 Stabilisation in Algebra, Geometry, and Combinatorics Jan Draisma, Technische Universiteit Eindhoven, The Netherlands

1:30 PM - 2:15 PM IP4 Mathematical Models: Uses, Abuses, and Non-uses Andrew M. Odlyzko, University of Minnesota, USA 6 2016 SIAM Conference on Discrete Mathematics

Invited Plenary Speakers

** All Invited Plenary Presentations will take place in SCE Speakers Auditorium - First Floor**

Wednesday, June 8 8:15 AM - 9:00 AM IP5 Tangles and the Mona Lisa: Connectivity Versus Tree Structure Reinhard Diestel, Universitat Hamburg, Germany

Thursday, June 9 8:15 AM - 9:00 AM IP6 Induced Matchings, Arithmetic Progressions and Communication Benny Sudakov, ETH Zürich, Switzerland

1:30 PM - 2:15 PM IP7 Quasirandomness, Sidorenko’s Conjecture and Graph Norms David Conlon, University of Oxford, United Kingdom

Friday, June 10 8:15 AM - 9:00 AM IP8 Excluded Grid Theorem: Improved and Simplified Julia Chuzhoy, Toyota Technological Institute at Chicago, USA 2016 SIAM Conference on Discrete Mathematics 7

Prize Lecture

** The Dénes König Prize Lecture will take place in SCE Speakers Auditorium - First Floor**

Tuesday, June 7 5:30 PM – 6:15 PM

SP1 2016 Dénes König Prize Lecture: Phase Transitions in Random Graph Processes Lutz Warnke, University of Cambridge, United Kingdom 8 2016 SIAM Conference on Discrete Mathematics

SIAM Activity Group on Discrete Mathematics (SIAG/DM) http://www.siam.org/activity/dm A GREAT WAY TO GET INVOLVED! Collaborate and interact with mathematicians and applied scientists whose work involves combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, parallel processing and research in mathematics that leads to new methods and techniques useful in descrete mathematics.

ACTIVITIES INCLUDE: • Special sessions at SIAM Annual Meetings • Biennial Conference • Website • Co-sponsors, with ACM SIGACT, the annual Symposium on Discrete Algorithms • Awards the Dénes König Prize to a young researcher for outstanding research in the area of discrete mathematics

BENEFITS OF SIAG/DM MEMBERSHIP: • Listing in the SIAG’s online-only membership directory • Additional $10 discount on registration for the SIAM Conference on Discrete Mathematics (excludes student) • 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: • $10 per year • Student members can join two activity groups for free!

SIAG/DM OFFICERS 2016-2017 • Chair: Chair: Sue Whitesides, University of Victoria • Vice Chair: Dorit Hochbaum, University of California Berkeley • Program Director: Jeannette Janssen, Dalhousie University • Secretary: Geir Agnarsson, George Mason University

TO JOIN:

SIAG/DM: my.siam.org/forms/join_siag.htm SIAM: www.siam.org/joinsiam 2016 SIAM Conference on Discrete Mathematics 9

DM16 Program 10 2016 SIAM Conference on Discrete Mathematics

Monday, June 6 Monday, June 6 Monday, June 6 IP1 MS1 Accuracy, Privacy, and Current Research in Coding Registration Validity: When Right is Theory - Part I of III 7:00 AM-4:00 PM Wrong and Wrong is Right 9:30 AM-12:00 PM Room:SCE Ballroom Pre-function Area - 8:15 AM-9:00 AM Room:SCE Court Salon - First Floor First Floor Room:SCE Speakers Auditorium - First For Part 2 see MS7 Floor The minisymposium is devoted to recent Chair: To Be Determined results and ongoing research in coding Welcome Remarks theory. The topics covered in the talks 8:00 AM-8:15 AM In 2008 a simple pen-and-paper include advances in algebraic geometric privacy attack on aggregate allele codes, coding for DNA memories, Room:SCE Speakers Auditorium - First frequency statistics in a Genome-Wide network coding, combinatorial results Floor Association Study rocked the world related to the MDS conjecture, and other of genomics research and resulted in a problems of current interest. change in access policy for aggregate statistics in studies funded by the US Organizer: Alexander Barg National Institutes of Health. After University of Maryland, USA describing the original attack and 9:30-9:55 Generalized Hamming summarizing recent advances in attack Weights of Projective Reed-Muller strategies, we shift to the defense, Codes discussing differential privacy, a notion Peter Beelen, Technical University of of privacy tailored to statistical analysis Denmark, Denmark of large datasets. Signal properties 10:00-10:25 On Polar and Reed-Muller of differential privacy include its Codes via Independence resilience to arbitrary side information Emmanuel Abbe, Princeton University, and the ability to understand USA cumulative privacy loss over multiple 10:30-10:55 Decoding Reed-Muller statistical analyses. Finally, we Codes from Random Errors describe a tight connection between Ben Lee Volk, Tel Aviv University, Israel differential privacy and statistical 11:00-11:25 Signature Codes for validity under adaptive (exploratory) Multiple-Access Channels - Part I data analysis. Grigory Kabatiansky, Russian Academy Cynthia Dwork of Sciences, Russia Microsoft Research, USA 11:30-11:55 Signature Codes for Multiple-Access Channels - Part II Grigory Kabatiansky, Russian Academy of Sciences, Russia Coffee Break 9:00 AM-9:30 AM Room:SCE Ballroom Pre-function Area - First Floor 2016 SIAM Conference on Discrete Mathematics 11

Monday, June 6 Monday, June 6 Monday, June 6 MS2 MS3 MS4 Structures in Trees - Graph Structure and Matroid Theory - Part I of III Part I of II Applications 9:30 AM-12:00 PM 9:30 AM-12:00 PM 9:30 AM-12:00 PM Room:SCE 217 - Second Floor Room:SCE House Salon - First Floor Room:SCE Senate Salon - First Floor For Part 2 see MS15 For Part 2 see MS22 The speakers in the minisymposium Matroids are combinatorial objects that There is an active interest in structures in will present their latest results in generalize well-known structures such trees, in part motivated by phylogenetics structural graph theory and related as graphs, sets of vectors, and error- and chemical graph theory. Among topics, including the linkage problem, correcting codes. Research problems in others, the session will investigate connections to extremal graph theory matroid theory vary widely, and include problems on the number of subtrees of and graph limits. problems on structure and connectivity, trees (labeled and unlabeled), and on questions regarding the representation Organizer: Bojan Mohar induced quartet subtrees of binary trees of matroids by more concrete objects Simon Fraser University, Canada (maximum agreement subtree problems such as matrices and graphs, problems and maximum quartet distance between Organizer: Zdenek Dvorak regarding enumeration and generation trees). Several talks will represent Charles University, Czech Republic of matroids, and extremal questions. the state-of-the-art in phylogeny 9:30-9:55 Normal Graph Covers Organizer: Stefan van Zwam reconstruction. The minisymposium David Gajser, University of Ljubljana, Louisiana State University, USA brings together researchers from Slovenia; Bojan Mohar, Simon Fraser Organizer: Carolyn Chun phylogenetics, extremal theory, and University, Canada United States Naval Academy, USA random trees. 10:00-10:25 Decomposing 4-Regular 9:30-9:55 When Matroids are Highly Random Graphs into Claws Organizer: Laszlo Szekely Connected University of South Carolina, USA Michelle Delcourt, University of Illinois Stefan van Zwam, Louisiana State at Urbana-Champaign, USA; Luke Organizer: Eva Czabarka University, USA Postle, University of Waterloo, Canada University of South Carolina, USA 10:00-10:25 The Packing/Covering 10:30-10:55 Notions of Convergence 9:30-9:55 Subtrees of Trees: Labeled Conjecture for Sequences of Graphs and Unlabeled Nathan Bowler, University of Hamburg, Laszlo M. Lovasz, Massachusetts Laszlo Szekely, University of South Germany Institute of Technology, USA Carolina, USA 10:30-10:55 Excluded Minors for 11:00-11:25 New Results on Packing 10:00-10:25 The Number of Matroids of Rank Three Odd Trails Automorphisms of Random Trees Sonoko Moriyama, Nihon University, Ross Churchley and Bojan Mohar, Benedikt Stufler, Ludwig-Maximilians- Japan; Hidefumi Hiraishi, University Simon Fraser University, Canada; Universität München, Germany; of Tokyo, Japan Hehui Wu, University of Mississippi, Stephan Wagner, Stellenbosch USA 11:00-11:25 The Cunningham- University, South Africa Geelen Method in Practice: 11:30-11:55 Finding Immersions of 10:30-10:55 Extremal Ratio Questions Branch-Decompositions and Integer Digraphs with Parity Restrictions in Binary Trees Programming Sebastian Gonzalez Hermosillo Hua Wang, Georgia Southern University, Susan Margulies, United States Naval and Bojan Mohar, Simon Fraser USA Academy, USA; Illya Hicks, Rice University, Canada University, USA 11:00-11:25 Extremal Properties of Vertex Attributes in Trees 11:30-11:55 A Matroid Analogue of a Heather C. Smith, Georgia Institute of Theorem of Brooks for Graphs Technology, USA; Laszlo Szekely, James Oxley, Louisiana State University of South Carolina, University, USA USA; Hua Wang, Georgia Southern University, USA; Shuai Yuan, University of South Carolina, USA 11:30-11:55 Species Tree Estimation in the Presence of Incomplete Lineage Sorting Tandy Warnow, University of Illinois at Urbana-Champaign, USA 12 2016 SIAM Conference on Discrete Mathematics

Monday, June 6 Monday, June 6 Monday, June 6 MS5 MS6 CP1 Graph Coloring I - Part I of II Extremal Combinatorics - Graph Theory I 9:30 AM-12:00 PM Part I of III 9:30 AM-11:10 AM Room:SCE 216 - Second Floor 9:30 AM-12:00 PM Room:SCE 203 - Second Floor For Part 2 see MS25 Room:SCE Speakers Auditorium - First Chair: To Be Determined Speakers will present recent results on Floor 9:30-9:45 A Generalization of fundamental problems in graph coloring. For Part 2 see MS26 α-Orientations to Higher Genus Organizer: Daniel Cranston Combinatorics is a fundamental discipline Surfaces Virginia Commonwealth University, of modern mathematics which studies Jason Suagee, George Washington USA discrete objects and their properties. This University, USA 9:30-9:55 Two-Coloring Number of minisymposium we propose will focus 9:50-10:05 The Family of Plane Graphs Planar Graphs on the subfield of extremal combinatorics with Face Sizes 3 or 4 Zdenek Dvorak, Charles University, and graph theory, which has witnessed Sheng Bau, University of Natal, Czech Republic; Adam Kabela and an exciting development over the past Pietermaritzburg, South Africa decades, and also has many striking Tomas Kaiser, University of West 10:10-10:25 Unhinging Cycles: An Bohemia, Pilsen, Czech Republic practical applications in mathematical Approach to Universal Cycles Under optimization, computer science, 10:00-10:25 Clique Immersion in Equivalence Relations statistical physics and voting society. Graph Products Melinda Lanius, University of Illinois at Jessica McDonald, Auburn University, We aim to bring the top researchers to Urbana-Champaign, USA the minisymposium, where they will USA 10:30-10:45 Monotone Paths in Dense present the recent progress, discuss open 10:30-10:55 Common Vertex of Edge-Ordered Graphs challenges, exchange research ideas, and Kevin Milans, West Virginia University, Longest Cycles of Special Chordal initiate new collaborations. We expect Graphs USA a minisymposium of this nature to have Hehui Wu and Shaohui Wang, University a lasting impact on the future of the 10:50-11:05 Bijections to Split Graphs of Mississippi, USA; Guantao Chen, subject. Karen Collins, Wesleyan University, Georgia State University, USA USA; Ann N. Trenk, Wellesley College, 11:00-11:25 Planar Graphs of Girth Organizer: Hao Huang USA; Christine T. Cheng, University of at Least Five are Square (Δ + 2)- Emory University, USA Wisconsin, Milwaukee, USA Choosable Organizer: Yi Zhao Marthe Bonamy, LaBRI, Université de Georgia State University, USA Bordeaux, and CNRS, France; Daniel 9:30-9:55 On Graphs Decomposable Cranston, Virginia Commonwealth into Induced Matchings of Linear Sizes University, USA; Luke Postle, Hao Huang, Emory University, USA University of Waterloo, Canada 10:00-10:25 On the Edit Distance of 11:30-11:55 Precoloring Extension for Powers of Cycles Planar Graphs Zhanar Berikkyzy and Ryan R. Martin, Zdenek Dvorak, Charles University, Iowa State University, USA; Chelsea Czech Republic; Bernard Lidicky, Peck, University of Wisconsin, Iowa State University, USA Madison, USA 10:30-10:55 Turan Numbers of Small Subdivisions Tao Jiang, Miami University, USA 11:00-11:25 How Unproportional Must a Graph Be? Humberto Naves, University of Minnesota, USA; Oleg Pikhurko, University of Warwick, United Kingdom; Alex Scott, Oxford University, United Kingdom 11:30-11:55 Locally Common Graphs and Locally Sidorenko Graphs Fan Wei, Stanford University, USA 2016 SIAM Conference on Discrete Mathematics 13

Monday, June 6 Monday, June 6 Monday, June 6 CP2 IP2 MS7 Probability Theory 1 From Algorithm to Current Research in Coding 9:30 AM-11:30 AM Theorem (in Probabilistic Theory - Part II of III Combinatorics) Room:SCE 218 - Second Floor 2:45 PM-5:15 PM Chair: To Be Determined 1:30 PM-2:15 PM Room:SCE Court Salon - First Floor 9:30-9:45 Counting Spanning Trees in Room:SCE Speakers Auditorium - First For Part 1 see MS1 Random Regular Graphs Floor For Part 3 see MS18 Matthew Kwan, ETH Zürich, Chair: To Be Determined The minisymposium is devoted to recent Switzerland; Catherine Greenhill, results and ongoing research in coding The general question is let X be a set University of New South Wales, theory. The topics covered in the talks of interesting “things” (permutations, Australia; Mikhail Isaev and include advances in algebraic geometric graphs, partitions, ...). Pick x in X Brendan McKay, Australian National codes, coding for DNA memories, at random; what does x “look like”? University, Australia network coding, combinatorial results There are a host of results for taking related to the MDS conjecture, and other 9:50-10:05 l-Cycles in Randomly theorems(e.g., the Gale-Ryser theorem) problems of current interest. Perturbed Hypergraphs and turning them into algorithms for Andrew J. Mcdowell and Richard efficient generation. This talk goes in the Organizer: Alexander Barg Mycroft, University of Birmingham, opposite direction: given an algorithm for University of Maryland, USA United Kingdom random generation, what (limit) theorems 2:45-3:10 Locally Repairable Codes 10:10-10:25 The Emergence of does it imply? One key example, drawn and Index Coding Patterns of Cooperative Behaviour in from joint work with Chern, Kane, and Arya Mazumdar, University of Grids Rhoades---there is a clever algorithm Massachusetts, Amherst, USA Christopher Duffy and Jeannette for generating a random set partition 3:15-3:40 DNA Profile Codes Janssen, Dalhousie University, due to Stam. This allowed us to prove Olgica Milenkovic, University of Illinois Canada the limiting normality of the number of at Urbana-Champaign, USA; Han Mao 10:30-10:45 Recovering the Structure crossings (and many other functionals), a Kiah, Nanyang Technical University, of Random Linear Graphs long-open problem. Singapore; Gregory J. Puleo, Israel S. Rocha and Jeannette Janssen, Persi Diaconis University of Illinois, USA Dalhousie University, Canada Stanford University, USA 3:45-4:10 The Role of Completely 10:50-11:05 Modularity of Random Regular Codes Graphs William J. Martin, Worcester Polytechnic Fiona Skerman, University of Bristol, Institute, USA United Kingdom; Colin McDiarmid, 4:15-4:40 Maximally Recoverable University of Oxford, United Coffee Break Codes - Part I Kingdom 2:15 PM-2:45 PM Parikshit Gopalan, Microsoft 11:10-11:25 The Region of Critical Corporation, USA; Guangda Hu, Probabilities in Bootstrap Percolation Room:SCE Ballroom Pre-function Area - Princeton University, USA; Shubhangi on Inhomogeneous Periodic Trees First Floor Saraf, Massachusetts Institute of Milan Bradonjic, Bell Labs, Alcatel- Technology, USA; Carol Wang, Lucent, USA; Stephan Wagner, Carnegie Mellon University, USA; Stellenbosch University, South Africa Sergey Yekhanin, Microsoft, USA 4:45-5:10 Maximally Recoverable Codes - Part II Lunch Break Parikshit Gopalan, Microsoft 12:00 PM-1:30 PM Corporation, USA; Guangda Hu, Princeton University, USA; Shubhangi Attendees on their own Saraf, Massachusetts Institute of Technology, USA; Carol Wang, Carnegie Mellon University, USA; Sergey Yekhanin, Microsoft, USA 14 2016 SIAM Conference on Discrete Mathematics

Monday, June 6 Monday, June 6 Monday, June 6 MS8 MS9 MS10 Tropical Mathematics and Monochromatic Covering Cops and Robbers and Applications - Part I of III and Ramsey-Type Problems - Pursuit-Evasion in Discrete 2:45 PM-4:45 PM Part I of II Structures - Part I of III Room:SCE Senate Salon - First Floor 2:45 PM-4:45 PM 2:45 PM-4:45 PM For Part 2 see MS14 Room:SCE 217 - Second Floor Room:SCE 216 - Second Floor In this minisymposium we will present For Part 2 see MS28 For Part 2 see MS29 recent developments in tropical Recently there have been some exciting From Cops and Robbers and its many mathematics, which concerns algebra developments in Ramsey theory and variants, to firefighting and graph and geometry over the max-plus the related problem of covering graphs burning, pursuit-evasion is a trending semiring. The field has seen rapid and by monochromatic subgraphs. This topic within graph theory and discrete significant development in the past minisymposium will focus on these recent mathematics. Broadly speaking, pursuit- decade, and touches on many different developments and the methods used to evasion focuses on agents whose goal areas of mathematics including graph obtain them. We will also look at future is to capture, contain, or block intruders theory, commutative algebra, algebraic research directions in the area. loose in a discrete structure. The analysis geometry, non-Archimedean analytic of pursuit-evasion games brings together geometry, matroid theory, and linear Organizer: Louis Debiasio Miami University, USA probabilistic, structural, and algorithmic programming. It has applications to techniques. Applications range from areas as diverse as enumerative geometry, Organizer: Alexey Pokrovskiy mobile computing to modelling the spread auction theory, phylogenetics, and mirror ETH Zürich, Switzerland of influence in social networks. The goal symmetry. This minisymposium will 2:45-3:10 Covering by Monochromatic of the minisymposium is to bring together bring together a diverse group of experts Subgraphs -- A Survey researchers in the field to present results in tropical mathematics with a particular Louis Debiasio, Miami University, USA on the state-of-the-art in the field. (but not exclusive) emphasis on 3:15-3:40 Monochromatic Paths in combinatorial methods and applications. Organizer: Anthony Bonato Graphs and Hypergraphs Ryerson University, Canada Organizer: Josephine Yu Maya Stein, Universidad de Chile, Chile 2:45-3:10 The Game of Zombies and Georgia Institute of Technology, USA 3:45-4:10 Monochromatic Covers and Survivors on Graphs Organizer: Matthew Baker Partitions of Random Graphs Anthony Bonato, Ryerson University, Georgia Institute of Technology, USA Deepak Bal, Ryerson University, Canada Canada Organizer: Ngoc Tran 4:15-4:40 Unavoidable Patterns in 3:15-3:40 Cops and Robber with Words University of California, Berkeley, USA Decoys David Conlon, University of Oxford, Nancy E. Clarke, Acadia University, 2:45-3:10 Metric Graphs with United Kingdom; Jacob Fox, Stanford Canada Prescribed Gonality University, USA; Benjamin Sudakov, Filip Cools, KU Leuven, Belgium; Jan ETH Zürich, Switzerland 3:45-4:10 Watching Block Intersection Draisma, Technische Universiteit Graphs Eindhoven, The Netherlands Danny Dyer and Jared Howell, Memorial University, Newfoundland, Canada 3:15-3:40 A Tropical Bott-Samelson Variety from Matroids Over Valuation 4:15-4:40 Walker-Breaker Game Rings Lisa Espig and Alan Frieze, Carnegie Alex Fink, Queen Mary, University of Mellon University, USA; Michael London, United Kingdom Krivelevich, Tel Aviv University, Israel; 3:45-4:10 A Grassmann Algebra for Wesley Pegden, Carnegie Mellon Matroids University, USA Jeffrey Giansiracusa, Swansea University, United Kingdom; Noah Giansiracusa, University of Georgia, USA 4:15-4:40 Tropical Ideals Felipe Rincon, University of Oslo, Norway; Diane Maclagan, University of Warwick, United Kingdom 2016 SIAM Conference on Discrete Mathematics 15

Monday, June 6 Monday, June 6 Monday, June 6 MS11 CP3 CP4 Graph Theory - Part I of III Miscellaneous Color 1 2:45 PM-5:15 PM 2:45 PM-4:25 PM 2:45 PM-4:05 PM Room:SCE Speakers Auditorium - First Room:SCE 203 - Second Floor Room:SCE 218 - Second Floor Floor Chair: To Be Determined Chair: To Be Determined For Part 2 see MS30 2:45-3:00 A Faster Algorithm for 2:45-3:00 Connectedness of This minisymposium consists of Computting Tutte Polynomials of the Graph of Neighborhood three sessions covering various topics Lattice Path Matroids Distinguishing Colorings and Irregular surrounding extremal graph theory, Jacob Turner, University of Amsterdam, Colorings structural graph theory, and cycles and Netherlands Ramar Rajasekaran, College of Applied Sciences, Sohar, Oman; Swaminathan paths in graphs. 3:05-3:20 Counting Hamiltonian Cycles Organizer: Guantao Chen in a Matroid Basis Graph V, Saraswathi Narayanan College, Madurai Kamaraj University, India Georgia State University, USA Cesar Hernandez-Velez, Universidad Autonoma de San Luis Potosi, Mexico; 3:05-3:20 Coloring the Square of Organizer: Xingxing Yu Cristina Fernandes and Jose de Pina, Subcubic Planar Graphs Georgia Institute of Technology, USA University of Sao Paulo, Brazil; Jorge Stephen Hartke, University of Colorado, 2:45-3:10 Improperly Coloring Kt+1 Luis Ramirez Alfonsin, Universite de USA; Jennifer Diemunsch, Saint Minor-Free Graphs Montpellier II, France Vincent College, USA; Sogol Sergey Norin, McGill University, Jahanbekam and Brent Thomas, Canada; Zdenek Dvorak, Charles 3:25-3:40 Construction of 4-Connected Graphic Matroids with Essential University of Colorado, Denver, USA University, Czech Republic Elements 3:25-3:40 Coloring Intersection 3:15-3:40 The Clique Number and Mahaveer P. Gadiya, University of Pune, Graphs of Curves Crossing a Fixed the Smallest Q-Eigenvalue of Graphs MIT College of Engineering, India Line Vladimir Nikiforov, University of Bartosz Walczak, Jagiellonian 3:45-4:00 Fractal Graphs and Their Memphis, USA; Leonardo De Lima, Combinatorial Properties University, Poland; Alexandre Rok, Federal Center of Technological Pavel Skums, Georgia State University, Ben Gurion University Negev, Israel Education, Brazil; Carla Oliveira, USA; Leonid Bunimovich, Georgia 3:45-4:00 Universal Cycles of Graph National School of Statistics, Brazil Institute of Technology, USA Colorings 3:45-4:10 Turan Number of Katie V. Johnson, Danny DePrisco, and 4:05-4:20 The Generalized Onsager Hypergraphs via Lagrangians Model for a Binary Gas Mixture with Molly Honecker, Florida Gulf Coast Yuejian Peng, Hunan University, China Swirling Feed University, USA 4:15-4:40 The Erdös-Hajnal Sahadev Pradhan, Indian Institute of Conjecture and Structural Theory of Science, Bangalore, India H-Free Graphs Krzysztof M. Choromanski, Google Welcome Reception Research, USA 5:30 PM-7:30 PM 4:45-5:10 Title Not Available Room:SCE Ballroom Pre-function Area Vladimir Nikiforov, University of - First Floor Memphis, USA 16 2016 SIAM Conference on Discrete Mathematics

Tuesday, June 7 Tuesday, June 7 Tuesday, June 7 MS12 MS13 Registration The Mathematics Behind Big Centroidal Voronoi Data Analysis - Part I of II Tessellations and its 7:30 AM-3:30 PM 9:30 AM-12:00 PM Applications Room:SCE Ballroom Pre-function Area - First Floor Room:SCE Court Salon - First Floor 9:30 AM-12:00 PM For Part 2 see MS31 Room:SCE House Salon - First Floor How to get rigorous methods for the Centroidal Voronoi tessellations Announcements seemingly ill-defined notion of data (CVTs) are Voronoi tessellations of a analysis? What kinds of mathematical 8:10 AM-8:15 AM bounded geometric domain such that the methods can be used to get provable and generating points of the tessellations are Room:SCE Speakers Auditorium - practical algorithmics for large data? This also the centroids of the corresponding First Floor is a rich area of study, involving research Voronoi regions with respect to a given from numerical analysis, statistics, density function. CVT is a fundamental theoretical computer science, and applied notion that has a wide spectrum of algorithmics. This minisymposium applications in computational science IP3 brings together researchers from the full and engineering that include art design, spectrum of pure theory to pure practice, astronomy, clustering, geometric Stabilisation in Algebra, to discuss the various viewpoints on data Geometry, and modeling, image and data analysis, analysis. resource optimization, quadrature design, Combinatorics Organizer: C. Seshadhri sensor networks, and numerical solution 8:15 AM-9:00 AM University of California, Santa Cruz, USA of partial differential equations. The goal of this minisymposium is to bring Room:SCE Speakers Auditorium - Organizer: David F. Gleich together scientists including the young First Floor Purdue University, USA researchers to discuss and exchange Chair: To Be Determined 9:30-9:55 Biclustered Matrix ideas in the areas of centroidal Voronoi Completion Throughout mathematics, one encounters tessellations and its applications. Eric Chi, North Carolina State University, sequences of algebraic varieties- USA Organizer: Mrinal K. geometric structures defined by Roychowdhury polynomial equations. As the dimension 10:00-10:25 A Story of Principal Component Analysis in the Distributed University of Texas, Rio Grande Valley, of the variety grows, typically so does USA its complexity, measured, for instance, Model David Woodruff, IBM Almaden Research by the degrees of its defining equations. Organizer: Huayi Wei Center, USA And yet, many sequences stabilise in Xiangtan University, China the sense that from some member of the 10:30-10:55 Sampling Paths in Graphs: 9:30-9:55 Fast Methods for Computing sequence on, all complexity is inherited A Simple Technique for Not So Simple Centroidal Voronoi Tessellations from the smaller members by applying Problems Huayi Wei, Xiangtan University, China; symmetries. I will present several C. Seshadhri, University of California, James C. Hatele, Unaffiliated; Long examples of this, as yet, only partially Santa Cruz, USA Chen, University of California, Irvine, understood phenomenon. Beautiful 11:00-11:25 On the Origin of Locality USA combinatorics of well-quasi-ordered sets in Algorithms for Graph Analysis on 10:00-10:25 An Algorithm for plays a key role in the proofs. The hope Massive Graphs Computing CVTs for Any Cantor is that, conversely, algebraic stabilisation David F. Gleich, Purdue University, USA Distribution may in the future also shed new light on 11:30-11:55 Accurate Inferences Mrinal K. Roychowdhury, University of well-quasi-orders. Beyond the Empirical Distribution Texas, Rio Grande Valley, USA Gregory Valiant, Stanford University, Jan Draisma USA Technische Universiteit Eindhoven, The Netherlands

Coffee Break 9:00 AM-9:30 AM continued on next page Room:SCE Ballroom Pre-function Area - First Floor 2016 SIAM Conference on Discrete Mathematics 17

10:30-10:55 Pseudometrically Tuesday, June 7 Tuesday, June 7 Constrained Centroidal Voronoi Tessellations and its Application to MS14 MS15 Acquisition Design in {MRI} Tropical Mathematics and Cheng G. Koay, National Intrepid Matroid Theory - Part II of III Center of Excellence and Walter Reed Applications - Part II of III 9:30 AM-12:00 PM National Military Medical Center, USA 9:30 AM-11:30 PM Room:SCE 217 - Second Floor 11:00-11:25 Application of Centroidal Room:SCE Senate Salon - First Floor For Part 1 see MS4 Voronoi Tessellation in Continuous For Part 3 see MS24 Optimization For Part 1 see MS8 Matroids are combinatorial objects that Zijun Wu, Beijing Institute for Scientific For Part 3 see MS27 In this minisymposium we will present generalize well-known structures such and Engineering Computing, China recent developments in tropical as graphs, sets of vectors, and error- 11:30-11:55 Quantization for Uniform mathematics, which concerns algebra correcting codes. Research problems in Distributions on Equilateral Triangles and geometry over the max-plus matroid theory vary widely, and include Carl Dettmann, University of Bristol, semiring. The field has seen rapid and problems on structure and connectivity, United Kingdom; Mrinal K. significant development in the past questions regarding the representation Roychowdhury, University of Texas, decade, and touches on many different of matroids by more concrete objects Rio Grande Valley, USA areas of mathematics including graph such as matrices and graphs, problems theory, commutative algebra, algebraic regarding enumeration and generation of geometry, non-Archimedean analytic matroids, and extremal questions. geometry, matroid theory, and linear Organizer: Stefan van Zwam programming. It has applications to Louisiana State University, USA areas as diverse as enumerative geometry, auction theory, phylogenetics, and Organizer: Carolyn Chun mirror symmetry. This minisymposium United States Naval Academy, USA will bring together a diverse group of 9:30-9:55 Bounding the Beta Invariants experts in tropical mathematics with a of 3-Connected Matroids particular (but not exclusive) emphasis on Sooyeon Lee and Haidong Wu, combinatorial methods and applications. University of Mississippi, USA Organizer: Josephine Yu 10:00-10:25 Enumerating Matroids of Georgia Institute of Technology, USA Fixed Rank Jorn van Der Pol and Rudi Pendavingh, Organizer: Matthew Baker Technische Universiteit Eindhoven, Georgia Institute of Technology, USA The Netherlands Organizer: Ngoc Tran 10:30-10:55 Towards an Excluded- University of California, Berkeley, USA Minor Characterization of the Hydra-5 9:30-9:55 Stochastic Mean Payoff Matroids Games are Tropical Semidefinite Ben Clark, Louisiana State University, Programs USA Xavier Allamigeon and Stephane 11:00-11:25 Templates for Minor- Gaubert, Inria and CMAP, Ecole Closed Classes of Binary Matroids Polytechnique, France; Mateusz Kevin M. Grace and Stefan van Zwam, Skomra, INRIA Saclay and Ecole Louisiana State University, USA Polytechnique, France 11:30-11:55 Unavoidable Minors for 10:00-10:25 Tropical Polynomial System Disjoint Bases in a Matroid Solving via Combinatorial Homotopy Peter Nelson, University of Waterloo, Continuation Canada Anders Jensen, Technische Universität Kaiserslautern, Germany 10:30-10:55 Computing Linear Systems on Metric Graphs Bo Lin, University of California, Berkeley, USA 11:00-11:25 The Membership Problem for Tropical Secant Varieties Yaroslav Shitov, Moscow State University, Russia 18 2016 SIAM Conference on Discrete Mathematics

Tuesday, June 7 Tuesday, June 7 Tuesday, June 7 MS16 MS17 CP5 Combinatorics and Graph Limits and Extremal Poset Linear Algebra Applied to Combinatorics 9:30 AM-11:10 AM Electrical Engineering 9:30 AM-12:00 PM Room:SCE 203 - Second Floor 9:30 AM-12:00 PM Room:SCE Speakers Auditorium - First Chair: To Be Determined Room:SCE 216 - Second Floor Floor 9:30-9:45 Unavoidable Trees in To accurately monitor an electric Graph limits and limits of discrete Tournaments power network, it is sufficient to place structures in general form an emerging Richard Mycroft and Tássio Naia, monitoring device at specific network area of combinatorics with many University of Birmingham, United locations. This yields an optimization exciting results and open problems. The Kingdom problem consisting of minimizing the most understood are dense graph limits 9:50-10:05 On the Competition Graphs number of monitoring devices that allows where flag algebras provide a powerful of d-Partial Orders for accurate monitoring of the entire framework for computer assisted proofs. Jihoon Choi, Seoul National University, network. This problem can be interpreted This minisymposium will cover recent Korea; Kyeong Seok Kim, Korea as a combinatorial problem known as progress in graph limits and extremal Advanced Institute of Science and power domination. Recent advances have combinatorics. Technology, Korea; Suh-Ryung Kim, related this problem to linear algebra Organizer: Bernard Lidicky Seoul National University, Korea; including non-convex rank minimization Iowa State University, USA Jung Yeun Lee, National Institute for and zero forcing. This minisymposium Mathematical Sciences, Korea; Yoshio features these new advances and offers to Organizer: Michael Young Sano, University of Tsukuba, Japan Iowa State University, USA shed light on possible new directions. 10:10-10:25 The Nested Chain 9:30-9:55 Are Short Cycles Decompositions of Some Normalized Organizer: Franklin Kenter Fractalizers? Rice University, USA Graded Posets of Rank Three Florian Pfender, University of Colorado, Wei-Tian Li and Yu-Lun Chang, National Organizer: Daniela Ferrero Denver, USA; Bernard Lidicky, Iowa Chung-Hsing University, Taiwan Texas State University, San Marcos, USA State University, USA 10:30-10:45 Shifted Young Diagrams 9:30-9:55 A Minimum Rank 10:00-10:25 Some Progress on the and Binary I/D Error-Correcting Codes Interpretation for Power Domination Diamond Problem Manabu Hagiwara, Chiba University, Daniela Ferrero, Texas State University, Liana Yepremyan and Sergey Norin, Japan San Marcos, USA; Leslie Hogben, McGill University, Canada 10:50-11:05 Unit Tolerance Orders with Iowa State University, USA; Franklin 10:30-10:55 Minimum Number of Open and Closed Points Kenter, Rice University, USA; Michael Edges in Odd Cycles Ann N. Trenk, Wellesley College, USA Young, Iowa State University, USA Ping Hu, University of Warwick, 10:00-10:25 Connections Between United Kingdom; Jan Volec, ETH Power Domination and Zero Forcing Zürich, Switzerland; Andrzej Grzesik, Daniela Ferrero, Texas State University, Jagiellonian University, Poland San Marcos, USA 11:00-11:25 Forcibility Techniques in 10:30-10:55 Searching for a Flag Algebras 3-Separation Formula: Where to Roman Glebov, Hebrew University of Begin? Jerusalem, Israel; Andrzej Grzesik, John Sinkovic, University of Waterloo, Jagiellonian University, Poland; Ping Canada Hu, University of Warwick, United 11:00-11:25 Fast and Efficient High Kingdom; Jan Volec, ETH Zürich, Order Sparse Matrix QR Factorization Switzerland for FPGAs 11:30-11:55 Graph Limits - Finite Semih Aslan, Texas State University, Forcibility and Computability USA Jacob Cooper, Daniel Kral, and Taisa 11:30-11:55 On the Northeast Property Martins, University of Warwick, United of Signed Graphs with Loops Kingdom Hein van der Holst and Marina Arav, Georgia State University, USA; John Sinkovic, University of Waterloo, Canada 2016 SIAM Conference on Discrete Mathematics 19

Tuesday, June 7 Tuesday, June 7 Tuesday, June 7 CP6 IP4 MS18 Color 2 Mathematical Models: Uses, Current Research in Coding 9:30 AM-11:30 AM abuses, and Non-uses Theory - Part III of III Room:SCE 218 - Second Floor 1:30 PM-2:15 PM 2:45 PM-5:15 PM Chair: To Be Determined Room:SCE Speakers Auditorium - First Room:SCE Court Salon - First Floor 9:30-9:45 Colorings of Hypergraphs Floor For Part 2 see MS7 with Large Number of Colors Chair: To Be Determined The minisymposium is devoted to recent results and ongoing research in coding Dmitry Shabanov, Lomonosov Moscow Models are indispensable, but have theory. The topics covered in the talks State University, Russia; Ilia Akolzin, to be used with caution. Some early include advances in algebraic geometric Moscow Institute of Physics and quantitative models, drawn from the codes, coding for DNA memories, Technology, Russia early history of British railways and network coding, combinatorial results 9:50-10:05 (2,0,0)-Coloring of Planar related to the ubiquitous gravity models related to the MDS conjecture, and other Graphs Without 4-Cycles or Close of transportation, urban planning, spacial problems of current interest. Triangles economics, and related areas, will be Jennifer Vandenbussche, Kennesaw presented. They demonstrate how even Organizer: Alexander Barg State University, USA; Gexin Yu and clearly false models can be useful, and University of Maryland, USA Heather Hopkins, College of William how sometimes they are misused or 2:45-3:10 Inclusion Matrices and the & Mary, USA tragically not used. MDS Conjecture 10:10-10:25 A Vizing Type Adjacency Andrew M. Odlyzko Ameera Chowdhury, Rutgers University, Theorem on g -Colorings USA c University of Minnesota, USA Xia Zhang, Shandong Normal University, 3:15-3:40 Rate-Distance Tradeoff for China and College of William and Codes Above Graph Capacity Mary, USA Daniel Cullina, University of Illinois at 10:30-10:45 Precoloring Extensions Urbana-Champaign, USA Coffee Break Using a Generalization of Hall’s 3:45-4:10 Uncertainty Principle and Marriage Theorem 2:15 PM-2:45 PM Stronger Hypercontractivity on the Sarah Holliday, Jennifer Vandenbussche, Room:SCE Ballroom Pre-function Area - Hypercube and Erik E. Westlund, Kennesaw State Yuri Polyanskiy, Massachusetts First Floor University, USA Institute of Technology, USA; Alex 10:50-11:05 A Relative of the Odd Samorodnitsky, Hebrew University of Hadwiger’s Conjecture Jerusalem, Israel Dongyeap Kang and Sang-Il Oum, Korea 4:15-4:40 Estimating the Capacity of Advanced Institute of Science and the 2-D Hard Square Constraint Using Technology, Korea Generalized Belief Propagation - Part I 11:10-11:25 Gyárfás Conjecture Is Navin Kashyap, Indian Institute of Almost Always True Science, Bangalore, India Yelena Yuditsky and Bruce Reed, McGill 4:45-5:10 Estimating the Capacity of University, Canada the 2-D Hard Square Constraint Using Generalized Belief Propagation - Part II Navin Kashyap, Indian Institute of Lunch Break Science, Bangalore, India 12:00 PM-1:30 PM Attendees on their own 20 2016 SIAM Conference on Discrete Mathematics

Tuesday, June 7 Tuesday, June 7 Tuesday, June 7 MS19 MS20 MS21 Discrete Mathematical Combinatorial Extremal Problems for Biology - Part I of II Reconfiguration Hypergraphs - Part I of II 2:45 PM-5:15 PM 2:45 PM-5:15 PM 2:45 PM-5:15 PM Room:SCE 217 - Second Floor Room:SCE 216 - Second Floor Room:SCE Speakers Auditorium - First Floor For Part 2 see MS39 Reconfiguration problems consist in This minisymposium will focus on finding step-by-step transformations For Part 2 see MS35 the importance of discrete models between two solutions such that all In recent years, the study of hypergraphs and methods across a spectrum of intermediate results are also feasible. has grown tremendously, with particular mathematical biology. Our goal is Such problems model dynamic situations focus on extremal questions such to highlight common mathematical where a given solution is in place and has as Turán- and Dirac-type problems. challenges motivated by different to be modified, but no property disruption Hypergraphs have also proven to biological applications. can be afforded. Two types of questions be useful tools in tackling a range Organizer: Christine Heitsch are interesting concerning reconfiguration of questions from other areas of mathematics (for example, through the Georgia Institute of Technology, USA problems: in which case can we ensure that there exists such a transformation? hypergraph container method). This Organizer: Heather C. Smith And what is the complexity of finding minisymposium will give a detailed Georgia Institute of Technology, USA such a reconfiguration? discussion of recent developments 2:45-3:10 Strings, Trees, and {RNA} regarding various extremal problems Folding Organizer: Marthe Bonamy and techniques for hypergraphs. Topics Christine Heitsch, Georgia Institute of LaBRI, Université de Bordeaux, and covered include perfect matchings, tilings Technology, USA CNRS, France and coverings, random hypergraphs, the 2:45-3:10 Invitation to Combinatorial 3:15-3:40 Using Inequality-Based absorbing method and universality. We Reconfiguration Gene Tree Invariants in Phylogenomic propose an international line-up with Inference Takehiro Ito, Tohoku University, Japan speakers based in Europe, North America Ruth Davidson, University of Illinois at 3:15-3:40 Kempe Equivalence of and South America. Urbana-Champaign, USA Colourings of Graphs Organizer: Andrew Treglown Carl Feghali, Durham University, United 3:45-4:10 Branching Polytopes for University of Birmingham, United Kingdom Parametric Analysis of RNA Secondary Kingdom Structure Prediction 3:45-4:10 Kempe Reconfiguration and Svetlana Poznanovikj, Clemson Potts Antiferromagnets Organizer: Richard Mycroft University, USA Jesus Salas, Universidad Carlos III de University of Birmingham, United Kingdom 4:15-4:40 Convexity in Tree Spaces Madrid, Spain Bo Lin and Bernd Sturmfels, University 4:15-4:40 Shortest Reconfiguration 2:45-3:10 Exact Minimum Codegree Threshold for K -Factors of California, Berkeley, USA; Xiaoxian Paths in the Solution Space of Boolean 4 Andrew Treglown, University of Tang, University of Bremen, Germany; Formulas Birmingham, United Kingdom; Jie Ruriko Yoshida, University of Amer Mouawad, University of Bergen, Han, University of Sao Paulo, Brazil; Kentucky, USA Norway; Naomi Nishimura and Vinayak Pathak, University of Allan Lo, University of Birmingham, 4:45-5:10 Analysis of Breast Cancer Waterloo, Canada; Venkatesh Raman, United Kingdom; Yi Zhao, Georgia Genome Data Using Discrete State University, USA Computational Topology Institute of Mathematical Sciences, Javier Arsuaga, University of California, Chennai, India 3:15-3:40 Codegree Thresholds for Davis, USA 4:45-5:10 Reconfiguring Graph Hypergraph Covering Homomorphisms and Colourings Victor Falgas-Ravry, Vanderbilt Richard Brewster and Sean Mcguinness, University, USA; Yi Zhao, Georgia Thompson Rivers University, Canada; State University, USA Benjamin Moore, Simon Fraser University, Canada; Jonathan A. Noel, University of Oxford, United Kingdom

continued on next page 2016 SIAM Conference on Discrete Mathematics 21

3:45-4:10 Turan Problems for Sparse Tuesday, June 7 Tuesday, June 7 Hypergraphs Tao Jiang, Miami University, USA CP7 CP8 4:15-4:40 Fractional Clique Graph Theory II Probability Theory II Decompositions of Dense Graphs 2:45 PM-4:25 PM and Hypergraphs 2:45 PM-4:45 PM Richard Montgomery, University of Room:SCE 203 - Second Floor Room:SCE 218 - Second Floor Cambridge, United Kingdom; Ben Chair: To Be Determined Chair: To Be Determined Barber, University of Bristol, United 2:45-3:00 Antimagic Labelings of 2:45-3:00 Spatial Networks with Kingdom; Daniela Kuhn, Deryk Weighted Graphs Osthus, and Allan Lo, University of Random Connections Victor Larsen, Kennesaw State Carl Dettmann, University of Bristol, Birmingham, United Kingdom University, USA; Zhanar Berikkyzy, United Kingdom; Orestis Georgiou, 4:45-5:10 Perfect Matchings in Iowa State University, USA; Axel Toshiba Corporation, Japan; Justin Hypergraphs Brandt and Sogol Jahanbekam, Coon, University of Oxford, United Jie Han, University of Sao Paulo, Brazil University of Colorado, Denver, Kingdom USA; Danny Rorabaugh, Queen’s University, Canada 3:05-3:20 Evolutionary Dynamics in Finite Populations Mix Rapidly 3:05-3:20 Realization Graphs of Ioannis Panageas, Georgia Institute of Degree Sequences Technology, USA; Piyush Srivastava, Michael D. Barrus, University of Rhode California Institute of Technology, Island, USA USA; Nisheeth K. Vishnoi, École 3:25-3:40 Hamiltonian Cycles in Polytechnique Fédérale de Lausanne, Directed Toeplitz Graphs Switzerland Shabnam Malik, Forman Christian 3:25-3:40 Uniform Distribution, Stein- College, Pakistan Like Characterizations and Identities 3:45-4:00 Ore’s Condition for Vladimir I. Khokhlov and Oleg Viskov, Spanning Halin Subgraphs Steklov Institute of Mathematics, Songling Shan, Vanderbilt University, Russia; Valerii Maksimov, Russian USA; Guantao Chen, Georgia State State University for the Humanities, University, USA; Colton Magnant, Russia Georgia Southern University, USA 3:45-4:00 Corners in Tree-Like 4:05-4:20 Generating Near-Bipartite Tableaux Bricks Amanda Lohss and Pawel Hitczenko, Nishad Kothari, University of Waterloo, Drexel University, USA Canada 4:05-4:20 Algebraic Bounds for Heterogeneous and Correlated Percolation Kathleen Hamilton, Oak Ridge National Laboratory, USA; Leonid Pryadko, University of California, Riverside, USA 4:25-4:40 Using Optimization to Define Unbiased Treatment Effect Estimators for Causal Inference Using Observational Data Sheldon H. Jacobson, University of Illinois, USA; Jason Sauppe, University of Wisconsin, La Crosse, USA 22 2016 SIAM Conference on Discrete Mathematics

Tuesday, June 7 Wednesday, Wednesday, June 8 SP1 June 8 IP5 2016 Dénes König Prize Tangles and the Mona Lisa: Lecture - Phase Transitions in Connectivity Versus Tree Random Graph Processes Registration Structure 5:30 PM-6:15 PM 7:30 AM-3:30 PM 8:15 AM-9:00 AM Room:SCE Speakers Auditorium - First Room:SCE Ballroom Pre-function Area - Room:SCE Speakers Auditorium - First Floor First Floor Floor Chair: To Be Determined Chair: To Be Determined One of the most interesting features Tangles, first introduced by Robertson of Erdös-Rényi random graphs is the Announcements and Seymour in their work on graph ‘percolation phase transition’, where minors, are a radically new way to define the global structure intuitively changes 8:10 AM-8:15 AM regions of high connectivity in a graph. from only small components to a single Room:SCE Speakers Auditorium - First The idea is that, whatever that highly giant component plus small ones. In this Floor connected region might ‘be’, low-order talk, we discuss the percolation phase separations of the graph cannot cut transition of Achlioptas processes, which through it, and so it will orient them: are a class of time-evolving variants of towards the side of the separation on Erdös-Rényi random graphs that (i) can which it lies. A tangle, thus, is simply a exhibit somewhat surprising phenomena, consistent way of orienting all the low- and (ii) are difficult to analyze due to order separations in a graph. The new dependencies between the edges. paradigm this brings to connectivity Lutz Warnke theory is that such consistent orientations University of Cambridge, United of all the low-order separations may, Kingdom in themselves, be thought of as highly connected regions: rather than asking exactly which vertices or edges belong to such a region, we only ask where it is, collecting pointers to it from all sides. Pixellated images share this property: we cannot tell exactly which pixels belong to the Mona Lisa’s nose, rather than her cheek, but we can identify `low-order’ separations of the picture that do not cut right through such features, and which can therefore be used collectively to delineate them. This talk will outline a general theory of tangles that applies not only to graphs and matroids but to a broad range of discrete structures. Including, perhaps, the pixellated Mona Lisa. Reinhard Diestel Universitat Hamburg, Germany

Coffee Break 9:00 AM-9:30 AM Room:SCE Ballroom Pre-function Area - First Floor 2016 SIAM Conference on Discrete Mathematics 23

Wednesday, June 8 Wednesday, June 8 Wednesday, June 8 MS22 MS23 MS24 Structures in Trees - Algebraic and Variational Matroid Theory - Part III of III Part II of II Approaches to Problems on 9:30 AM-12:00 PM 9:30 AM-12:00 PM Graphs Room:SCE 217 - Second Floor Room:SCE House Salon - First Floor 9:30 AM-12:00 PM For Part 2 see MS15 For Part 1 see MS2 Room:SCE Senate Salon - First Floor Matroids are combinatorial objects that There is an active interest in structures in generalize well-known structures such Due to their flexible modeling trees, in part motivated by phylogenetics as graphs, sets of vectors, and error- capabilities, graphs provide a useful and chemical graph theory. Among others, correcting codes. Research problems in abstraction for describing many the session will investigate problems on matroid theory vary widely, and include combinatorial problems arising in various the number of subtrees of trees (labeled problems on structure and connectivity, applications. Examples of problems that and unlabeled), and on induced quartet questions regarding the representation have received much attention in recent subtrees of binary trees (maximum of matroids by more concrete objects years include community detection and agreement subtree problems and such as matrices and graphs, problems finding structured subgraphs inside maximum quartet distance between trees). regarding enumeration and generation of larger graphs. This minisymposium Several talks will represent the state- matroids, and extremal questions. presents recent developments on efficient of-the-art in phylogeny reconstruction. algorithms for such problems on large Organizer: Stefan van Zwam The minisymposium brings together graphs, with a particular emphasis on Louisiana State University, USA researchers from phylogenetics, extremal algebraic and variational approaches. theory, and random trees. Organizer: Carolyn Chun Organizer: Utkan Onur United States Naval Academy, USA Organizer: Laszlo Szekely Candogan 9:30-9:55 The Binary Matroids Whose University of South Carolina, USA California Institute of Technology, USA Only Odd Circuits are Small Organizer: Eva Czabarka Kristen Wetzler, Louisiana State Organizer: Venkat University of South Carolina, USA University, USA Chandrasekaran 9:30-9:55 On Local Profiles of Trees California Institute of Technology, USA 10:00-10:25 A Lattice Point Counting Sebastien Bubeck, Microsoft Research, Generalisation of the Tutte Polynomial USA; Katherine Edwards, Princeton 9:30-9:55 Finding Planted Graphs with Amanda Cameron and Alex Fink, Queen Few Eigenvalues Using the Schur Horn University, USA; Horia Mania, Mary, University of London, United Relaxation University of California, Berkeley, Kingdom Utkan Onur Candogan and Venkat USA; Cathryn Supko, McGill Chandrasekaran, California Institute of 10:30-10:55 Matroids with Many Small University, Canada Technology, USA Circuits and Many Small Cocircuits 10:00-10:25 The Maximum Quartet Simon Pfeil, Louisiana State University, 10:00-10:25 Graph Profiles: Algorithms Distance Between Phylogenetic Trees USA and Approximation Guarantees Humberto Naves, University of Ethan R. Elenberg, Karthikeyan 11:00-11:25 On Representations of Minnesota, USA; Noga Alon, Tel Aviv Shanmugam, Michael Borokhovich, Frame Matroids Over Fields University, Israel; Benny Sudakov, ETH and Alex Dimakis, University of Texas Daryl Funk, Victoria University of Zürich, Switzerland at Austin, USA Wellington, New Zealand 10:30-10:55 The Shape of Treespace 10:30-10:55 Convex Optimization for 11:30-11:55 Bicircular Matroids Katherine St. John, City University of Clustering: Theoretical Guarantees Representable Over GF(4) or GF(5) New York, USA and Practical Applications Tyler Moss and Deborah Chun, West 11:00-11:25 Efficient Quartet Systems in Ramya Korlakai Vinayak, Samet Oymak, Virginia University Institute of Phylogenetic Applications and Babak Hassibi, California Institute Technology, USA; Daniel Slilaty Ruth Davidson, University of Illinois of Technology, USA and Xiangqian Zhou, Wright State University, USA at Urbana-Champaign, USA; MaLyn 11:00-11:25 Chordal Structure in Lawhorn, Joseph P. Rusinko, and Noah Computational Algebra Weber, Winthrop University, USA Diego Cifuentes and Pablo A. Parrilo, 11:30-11:55 Inducibility in Binary Trees Massachusetts Institute of Technology, and Tanglegram Crossing Numbers USA Eva Czabarka and Laszlo Szekely, University of South Carolina, USA; Stephan Wagner, Stellenbosch University, South Africa 24 2016 SIAM Conference on Discrete Mathematics

Wednesday, June 8 Wednesday, June 8 Wednesday, June 8 MS25 MS26 CP9 Graph Coloring II - Part II of II Extremal Combinatorics - Graph Theory 3 9:30 AM-12:00 PM Part II of III 9:30 AM-11:30 AM Room:SCE 216 - Second Floor 9:30 AM-12:00 PM Room:SCE 203 - Second Floor For Part 1 see MS5 Room:SCE Speakers Auditorium - First Chair: To Be Determined Speakers will present recent results on Floor 9:30-9:45 The Decomposition Threshold fundamental problems in graph coloring. For Part 1 see MS6 of a Given Graph Organizer: Daniel Cranston For Part 3 see MS46 Stefan Glock, Daniela Kuehn, and Allan Virginia Commonwealth University, USA Combinatorics is a fundamental discipline Lo, University of Birmingham, United Kingdom; Richard Montgomery, 9:30-9:55 Colorings of Plane Graphs of modern mathematics which studies Daniel Kral, University of Warwick, discrete objects and their properties. This University of Cambridge, United United Kingdom minisymposium we propose will focus Kingdom; Deryk Osthus, University of on the subfield of extremal combinatorics Birmingham, United Kingdom 10:00-10:25 Maximal k-Edge-Colorable and graph theory, which has witnessed Subgraphs, Vizing’s Theorem, and 9:50-10:05 Cycle Decompositions with Tuza’s Conjecture an exciting development over the past No Subsystems Gregory J. Puleo, University of Illinois, decades, and also has many striking John Asplund, Dalton State College, USA practical applications in mathematical USA; Michael Schroeder, Marshall optimization, computer science, University, USA; Venkata Dinavahi, 10:30-10:55 Reed’s Conjecture and statistical physics and voting society. University of Findlay, USA Strong Edge Coloring We aim to bring the top researchers to Marthe Bonamy, LaBRI, Université 10:10-10:25 Clique Decompositions of the minisymposium, where they will de Bordeaux, and CNRS, France; Multipartite Graphs and Completion of present the recent progress, discuss open Thomas Perrett, Technical University Latin Squares challenges, exchange research ideas, and of Denmark, Denmark; Luke Postle, Allan Lo, University of Birmingham, initiate new collaborations. We expect a University of Waterloo, Canada United Kingdom; Ben Barber, minisymposium of this nature to have a University of Bristol, United Kingdom; 11:00-11:25 A Topological Approach lasting impact on the future of the subject. Daniela Kühn, Deryk Osthus, Related to Hedetniemi’s Conjecture and Amelia Taylor, University of Marcin Wrochna, University of Warsaw, Organizer: Hao Huang Birmingham, United Kingdom Poland Emory University, USA Organizer: Yi Zhao 10:30-10:45 On (Strongly) Chordal-(k, l) 11:30-11:55 Generalizations of Reed’s Graph Sandwich Problem Georgia State University, USA Conjecture R Sritharan, University of Dayton, USA Luke Postle, University of Waterloo, 9:30-9:55 On a Conjecture of Erdös on Canada Triangle-Free Graphs 10:50-11:05 Proof of the Barát- Jacques Verstraete, University of Thomassen Conjecture Ararat Harutyunyan, University of California, San Diego, USA; Alexandr Toulouse III, France; Julien Bensmail Kostochka, University of Illinois at and Martin Merker, Technical Urbana-Champaign, USA; Benny University of Denmark, Denmark; Tien- Sudakov, ETH Zürich, Switzerland Nam Le and Stéphan Thomassé, École 10:00-10:25 A Sparse Regular Normale Supérieure de Lyon, France Approximation Lemma Asaf Shapira and Guy Moshkovitz, Tel 11:10-11:25 Strong Oriented Graphs Aviv University, Israel with Largest Directed Metric Dimension Rinovia Simanjuntak and Yozef Tjandra, 10:30-10:55 Degenerate Hypergraphs Bandung Institute of Technology, Linyuan Lu and Shuliang Bai, University Indonesia of South Carolina, USA 11:00-11:25 Exploring with Flag Algebras Sergey Norin and Yue Ru Sun, McGill University, Canada 11:30-11:55 Off-Diagonal Hypergraph Ramsey Numbers Andrew Suk, University of Ilinois at Chicago, USA 2016 SIAM Conference on Discrete Mathematics 25

Wednesday, June 8 Wednesday, June 8 2:00-2:25 Bitangents of Tropical Plane Quartic Curves CP10 MS27 Matthew Baker, Georgia Institute of Technology, USA; Yoav Len, Theoretical Computer Tropical Mathematics and Universität des Saarlandes, Germany; Science Applications - Part III of III Ralph Morrison, KTH Royal Institute 9:30 AM-11:10 AM 1:30 PM-4:00 PM of Technology, Sweden; Nathen Pflueger, Brown University, USA; Room:SCE Senate Salon - First Floor Room:SCE 218 - Second Floor Qingchun Ren, Google, Inc., USA Chair: To Be Determined For Part 2 see MS14 2:30-2:55 A Versatile Technique for the In this minisymposium we will present 9:30-9:45 A Minimum-Change Version Construction of Spectra recent developments in tropical of the Chung-Feller Theorem Andrew Dudzik, University of California, mathematics, which concerns algebra Torsten Mütze, Veit Wiechert, and Berkeley, USA Christoph Standke, Technische and geometry over the max-plus 3:00-3:25 Scheme Theoretic Universität Berlin, Germany semiring. The field has seen rapid and significant development in the past Tropicalization 9:50-10:05 Spectral Graph Properties decade, and touches on many different Oliver Lorscheid, Instituto de in Combined Routing-Facility Location Matemática Pura e Aplicada, Brazil Problems areas of mathematics including graph Dimitri Papadimitriou, Bell Laboratories, theory, commutative algebra, algebraic 3:30-3:55 Tropical Skeletons and the Section of Tropicalization Alcatel-Lucent, Belgium geometry, non-Archimedean analytic geometry, matroid theory, and linear Walter Gubler, Universität Regensburg, 10:10-10:25 Approximate Recognition programming. It has applications to Germany; Joseph Rabinoff, Georgia of Nonregular Languages by Finite areas as diverse as enumerative geometry, Institute of Technology, USA; Annette Automata auction theory, phylogenetics, and mirror Werner, Goethe Universität Frankfurt, Bala Ravikumar, Sonoma State University, Germany USA; Jacob Combs, University of symmetry. This minisymposium will Arizona, USA bring together a diverse group of experts in tropical mathematics with a particular 10:30-10:45 Stability Number Linear (but not exclusive) emphasis on Programs combinatorial methods and applications. Craig E. Larson, Virginia Commonwealth University, USA Organizer: Josephine Yu Georgia Institute of Technology, USA 10:50-11:05 Modified Linear Programming and Class 0 Bounds for Organizer: Matthew Baker Graph Pebbling Georgia Institute of Technology, USA Carl Yerger, Davidson College, Organizer: Ngoc Tran USA; Daniel Cranston, Virginia University of California, Berkeley, USA Commonwealth University, USA; Luke Postle, University of Waterloo, Canada; 1:30-1:55 Anticanonical Tropical del Chenxiao Xue, Davidson College, USA Pezzo Cubic Surfaces Contain Exactly 27 Lines Maria Angelica Cueto, Ohio State University, USA; Anand Deopurkar, Lunch Break Columbia University, USA 12:00 PM-1:30 PM Attendees on their own

continued in next column 26 2016 SIAM Conference on Discrete Mathematics

Wednesday, June 8 Wednesday, June 8 3:00-3:25 The Robot Crawler Graph Process MS28 MS29 Anthony Bonato, Ryerson University, Canada; Calum MacRury, Dalhousie Monochromatic Covering Cops and Robbers and University, Canada; Jake Nicolaidis, and Ramsey-Type Problems - Pursuit-Evasion in Discrete Xavier Perez Gimenez, and Pawel Part II of II Structures - Part II of III Pralat, Ryerson University, Canada; 1:30 PM-4:00 PM Rita María del Río-Chanona, 1:30 PM-4:00 PM Universidad Nacional Autonoma de Room:SCE 217 - Second Floor Room:SCE 216 - Second Floor Mexico, Mexico; Kirill Ternovsky, For Part 1 see MS9 For Part 1 see MS10 Ryerson University, Canada Recently there have been some exciting For Part 3 see MS40 3:30-3:55 Fully-Active Cops and developments in Ramsey theory and From Cops and Robbers and its many Robbers the related problem of covering graphs variants, to firefighting and graph Ilya Gromovikov, Dawson College, by monochromatic subgraphs. This burning, pursuit-evasion is a trending Canada; Bill Kinnersley, University minisymposium will focus on these recent topic within graph theory and discrete of Rhode Island, USA; Ben Seamone, developments and the methods used to mathematics. Broadly speaking, pursuit- Dawson College, Canada obtain them. We will also look at future evasion focuses on agents whose goal research directions in the area. is to capture, contain, or block intruders Organizer: Louis Debiasio loose in a discrete structure. The analysis Miami University, USA of pursuit-evasion games brings together probabilistic, structural, and algorithmic Organizer: Alexey Pokrovskiy techniques. Applications range from ETH Zürich, Switzerland mobile computing to modelling the 1:30-1:55 Partitioning a Graph into a spread of influence in social networks. Cycle and a Sparse Graph The goal of the minisymposium is to Alexey Pokrovskiy, ETH Zürich, bring together researchers in the field to Switzerland present results on the state-of-the-art in 2:00-2:25 Monochromatic Cycle the field. Partitions Organizer: Anthony Bonato Shoham Letzter, University of Cambridge, Ryerson University, Canada United Kingdom 1:30-1:55 Fundamental Conjectures on 2:30-2:55 Monochromatic Cycle Eternal Domination Partitioning of 2-Edge-Colored Graphs Chip Klostermeyer, University of North with Minimum Degree 2n/3 Florida, USA Peter Allen and Julia Böttcher, London School of Economics, United Kingdom; 2:00-2:25 The Firefighter Problem for All Richard Lang, Universidad de Chile, Orientations of the Cubic Grid Chile; Jozef Skokan, London School Gary MacGillivrary, University of of Economics, United Kingdom; Maya Victoria, Canada Stein, Universidad de Chile, Chile 2:30-2:55 On the Zero-Visibility Cops and Robber Game 3:00-3:25 Ramsey Numbers of Sparse Graphs and Monochromatic Partitions Dariusz Dereniowski, Gdansk University Jozef Skokan, London School of of Technology, Poland; Danny Dyer Economics, United Kingdom and Ryan Tifenbach, Memorial University, Newfoundland, Canada; 3:30-3:55 Decompositions of Boting Yang, University of Regina, Edge-Colored Infinite Graphs into Canada Monochromatic Connected Pieces Daniel Soukup, University of Calgary and Pacific Institute for the Mathematical Sciences, Canada

continued in next column 2016 SIAM Conference on Discrete Mathematics 27

Wednesday, June 8 Wednesday, June 8 Wednesday, June 8 MS30 CP11 CP12 Graph Theory - Part II of III Algebraic or Number- Extremal Combinatorics 1:30 PM-4:00 PM Theoretic Combinatorics 1:30 PM-3:10 PM Room:SCE Speakers Auditorium - First 1:30 PM-3:10 PM Room:SCE 218 - Second Floor Floor Room:SCE 203 - Second Floor Chair: To Be Determined For Part 1 see MS11 Chair: To Be Determined 1:30-1:45 Generalizations of Erdös-Ko- For Part 3 see MS41 1:30-1:45 Combinatorial Approaches Rado Theorem to {0,±1}-Vectors This minisymposium consists of Andrey Kupavskii, Moscow Institute of three sessions covering various topics Stanley Depth: Where Do We Stand? Mitchel T. Keller, Washington and Physics and Technology, Russia; Peter surrounding extremal graph theory, Lee University, USA; Stephen Frankl, Renyi Institute, Hungary structural graph theory, and cycles and Young, Pacific Northwest National paths in graphs. 1:50-2:05 Saturation Multiplicity of Laboratory, USA Graphs Organizer: Guantao Chen 1:50-2:05 On Solution-Free Sets of Paul Wenger, Rochester Institute of Georgia State University, USA Integers Technology, USA Organizer: Xingxing Yu Robert A. Hancock and Andrew 2:10-2:25 Involution Factorizations of Georgia Institute of Technology, USA Treglown, University of Birmingham, Random Permutations Chosen from the Ewens Distribution 1:30-1:55 Packing Cycles in Doubly United Kingdom Charles D. Burnette, Drexel University, Group Labeled Graphs 2:10-2:25 Orphans in Forests of Linear Paul Wollan, University of Rome La Fractional Transformations USA Sapienza, Italy Johann Thiel, Satyanand Singh, Sandie 2:30-2:45 Grids, Diamonds, and the Comb Algorithm 2:00-2:25 Quadrangular Embeddings Han, and Ariane Masuda, New York of Complete Graphs City College of Technology, CUNY, Wesley K. Hough, University of Mark Ellingham, Vanderbilt University, USA Kentucky, USA USA; Wenzhong Liu, Nanjing 2:30-2:45 On Zeros of a Polynomial in 2:50-3:05 Plane Permutations and their University of Aeronautics and a Finite Grid: The Alon-Füredi Bound Applications Astronautics, China; Dong Ye and John Schmitt, Middlebury College, Ricky X. Chen, Virginia Tech, USA; Xiaoya Zha, Middle Tennessee State USA; Anurag Bishnoi, Ghent Christian Reidys, Los Alamos National University, USA University, Belgium; Pete L. Clark, Laboratory, USA; Andrei Bura, Virginia Tech, USA 2:30-2:55 3-Flows with Large Support University of Georgia, USA; Aditya Jessica McDonald, Auburn University, Potukuchi, Rutgers University, USA USA 2:50-3:05 The (u,v) Calkin Wilf Tree 3:00-3:25 Minimum Degree and Satyanand Singh, Sandie Han, Ariane Coffee Break Masuda, and Johann Thiel, New York Dominating Paths 4:00 PM-4:30 PM Ralph Faudree, University of Memphis, City College of Technology, CUNY, USA; Ronald Gould, Emory University, USA Room:SCE Ballroom Pre-function Area - USA; Michael Jacobson, University First Floor of Colorado at Denver, USA; Douglas B. West, Zhejiang Normal University, China and University of Illinois, USA 3:30-3:55 A Polyhedral Description of Kernels Wenan Zang, University of Hong Kong, China 28 2016 SIAM Conference on Discrete Mathematics

Wednesday, June 8 Wednesday, June 8 Thursday, June 9 Hot Topics Session: Hot Topics Session: Graph Isomorphism in Graph Isomorphism in Quasipolynomial Time - Quasipolynomial Time - Registration Part I of II Part II of II 7:30 AM-3:30 PM 4:30 PM-5:15 PM 5:30 PM-6:15 PM Room:SCE Ballroom Pre-function Area - Room:SCE Speakers Auditorium - First Room:SCE Speakers Auditorium - First First Floor Floor Floor Chair: To Be Determined Chair: To Be Determined One of the fundamental computational Our divide-and-conquer algorithm Announcements problems in the complexityclass NP on attempts to significantly reduce the size 8:10 AM-8:15 AM Karp’s 1973 list, the Graph Isomorphism n of the permutation domain, at a modest problem asks to decide whether or not multiplicative cost. This is achieved by Room:SCE Speakers Auditorium - First two given graphs are isomorphic. While finding a canonical k-ary relation with Floor program packages exist that solve this k=O(log n), from which we infer either problem remarkably efficiently in practice a good partitioning of the domain or (McKay, Piperno, and others), for find a canonically embedded Johnson complexity theorists the problem has been graph. While the latter does not permit IP6 notorious for its unresolved asymptotic good canonical partitioning, it leads to a Induced Matchings, worst-case complexity; strong theoretical dramatic reduction of the problem size; Arithmetic Progressions and evidence suggests that the problem should so each outcome yields efficient Luks not be NP-complete, yet its worst-case reduction. Communication complexity has stood at exp(O(sqrt{v\log The canonical k-ary relation is found 8:15 AM-9:00 AM v})) (Luks, 1983) for decades, where v is via group theoretic “local certificates.” Room:SCE Speakers Auditorium - the number of vertices. A new group-theoretic lemma is at the First Floor By addressing the bottleneck for Luks’s heart of the design and analysis of the Chair: To Be Determined method, we reduce this “moderately algorithm. exponential” upper bound to Extremal combinatorics is one of In the first talk we shall sketch the main quasipolynomial, i.e.,exp((log v)^c). the central branches of discrete ingredients of the algorithm and indicate mathematics that deals with the problem The problem we actually solve is the how they lead to quasipolynomial of estimating the maximum possible more general String Isomorphism (SI) recurrence. size of a combinatorial structure which problem (“anagrams under a given In the second talk we shall discuss the satisfies certain restrictions. Often, such permutation group”), introduced by Luks core “Local Certificates” algorithm in problems also have applications to other in his seminal 1980/82 paper, E.M. Luks detail and sketch the aggregation of the areas including theoretical computer : Isomorphism of graphs of bounded local certificates. science, additive number theory and valence can be tested in polynomial time. information theory. In his talk, we will J. Comp. Sys. Sci. 25:42--65, 1982. Familiarity with basic concepts of group theory (such as kernel of a illustrate this fact using several closely This Talk and Abstract is split into two homomorphism) will be assumed. related examples, focusing on the recent parts. Please read the Abstract of the works with Alon, Fox, Huang and The paper is available at second part; the two Abstracts are meant Moitra. to form a single document. arXiv:1512.03547. Benny Sudakov This Talk and Abstract is split into two László Babai ETH Zürich, Switzerland The University of Chicago, USA parts. Please read the Abstract of the first part; the two Abstracts are meant to form a single document. Coffee Break Intermission László Babai The University of Chicago, USA 9:00 AM-9:30 AM 5:15 PM-5:30 PM Room:SCE Ballroom Pre-function Area - First Floor SIAG/DM Business Meeting 6:30 PM-7:15 PM Room:SCE Speakers Auditorium - First Floor 2016 SIAM Conference on Discrete Mathematics 29

Thursday, June 9 Thursday, June 9 10:30-10:55 An Occupancy Method for Bounding Partition Functions and MS31 MS32 Counting Matchings Ewan Davies and Matthew Jenssen, The Mathematics Behind Big Random Discrete Structures - London School of Economics, United Data Analysis - Part II of II Part I of III Kingdom; Will Perkins, University 9:30 AM-11:00 AM 9:30 AM-12:00 PM of Birmingham, United Kingdom; Barnaby Roberts, London School of Room:SCE Court Salon - First Floor Room:SCE Senate Salon - First Floor Economics, United Kingdom For Part 1 see MS12 For Part 2 see MS38 11:00-11:25 Towards Disproving the How to get rigorous methods for the The aim of the minisymposium is to Erdös-Hajnal Conjecture... seemingly ill-defined notion of data provide insight into recent advances in Krzysztof M. Choromanski, Google analysis? What kinds of mathematical the area of random discrete structures, Research, USA methods can be used to get provable and which deals mainly with typical properties practical algorithmics for large data? This 11:30-11:55 The Ramsey-Turán Problem and parameters of combinatorial objects with Small Independence Number is a rich area of study, involving research (graphs, hypergraphs, algebraic and data Patrick Bennett and Andrzej Dudek, from numerical analysis, statistics, structures, etc), their limit distributions Western Michigan University, USA theoretical computer science, and applied as well as randomized algorithms for algorithmics. This minisymposium generating and analyzing the structures. brings together researchers from the full Presented topics will cover objects of spectrum of pure theory to pure practice, purely theoretical origin and also models to discuss the various viewpoints on data of random discrete structures motivated analysis. by other fields of science like statistical Organizer: C. Seshadhri physics, computer science and network University of California, Santa Cruz, USA engineering. Organizer: David F. Gleich Organizer: Andrzej Rucinski Purdue University, USA Adam Mickiewicz University, Poland, and Emory University, USA 9:30-9:55 Network Meso-Structure -- Behind the Complexity Curtain Organizer: Matas Sileikis Blair Sullivan, North Carolina State Charles University in Prague, Czech University, USA Republic 10:00-10:25 Reparametrization 9:30-9:55 Looking for Vertex Number Covariant Invariants of Time Series and One Cyclicities Alan Frieze and Wesley Pegden, Carnegie Yuliy Baryshnikov, University of Illinois Mellon University, USA at Urbana-Champaign, USA 10:00-10:25 Universality and Resilience 10:30-10:55 Network-Based in Pseudorandom Graphs Personalization at Twitter Julia Boettcher and Peter Allen, London Aneesh Sharma, Twitter Inc., USA School of Economics, United Kingdom; Julia Ehrenmueller, Hamburg University of Technology, Germany; Anusch Taraz, Technische Universität Hamburg, Germany

continued in next column 30 2016 SIAM Conference on Discrete Mathematics

Thursday, June 9 Thursday, June 9 Thursday, June 9 MS33 MS34 MS35 Matroids Antimatroids - Parameterized Algorithms Extremal Problems for Part I of II and Graph Decompositions - Hypergraphs - Part II of II 9:30 AM-11:30 AM Part I of II 9:30 AM-12:00 PM Room:SCE 217 - Second Floor 9:30 AM-12:00 PM Room:SCE Speakers Auditorium - First Floor For Part 2 see MS44 Room:SCE 216 - Second Floor Matroids and antimatroids are set For Part 1 see MS21 For Part 2 see MS45 systems that satisfy certain combinatorial In recent years, the study of hypergraphs The minisymposium will focus on properties. Matroid theory provides a has grown tremendously, with particular the latest developments in the area of framework in which problems on graphs, focus on extremal questions such parameterized algorithms and fixed- matrices, designs, etc. become easy as Turán- and Dirac-type problems. parameter tractability. Particular emphasis to understand and solve. Antimatroids Hypergraphs have also proven to is put on various graph decompositions have many applications to the theory of be useful tools in tackling a range and structural graph theory with their geometric spaces and knowledge spaces. of questions from other areas of application in graph algorithms. These two areas have grown significantly mathematics (for example, through the in recent decades. This minisymposium Organizer: Marek Cygan hypergraph container method). This brings together researchers in both areas University of Warsaw, Poland minisymposium will give a detailed to seek commonalities and extensions of Organizer: Marcin Pilipczuk discussion of recent developments major work. University of Warsaw, Poland regarding various extremal problems and techniques for hypergraphs. Topics Organizer: Kira Adaricheva Organizer: Michal Pilipczuk Nazarbayev University, Kazakhstan covered include perfect matchings, tilings University of Warsaw, Poland and coverings, random hypergraphs, the Organizer: Sandra Kingan 9:30-9:55 The Directed Grid Theorem absorbing method and universality. We Brooklyn College of the City University Ken-ichi Kawarabayashi, National propose an international line-up with of New York, USA Institute of Informatics, Japan; Stephan speakers based in Europe, North America 9:30-9:55 Matroids, Antimatroids and Kreutzer, Technische Universität and South America. Berlin, Germany Groups Organizer: Andrew Treglown Jean-Paul Doignon, Université Libre de 10:00-10:25 Canonical Decompositions University of Birmingham, United Bruxelles, Belgium and Isomorphism Testing Kingdom 10:00-10:25 Deletions, Contractions, Pascal Schweitzer, RWTH Aachen and Connectivity University, Germany Organizer: Richard Mycroft University of Birmingham, United Joao Paulo Costalonga, Federal 10:30-10:55 Fixed-Parameter Tractable Kingdom University of Espirito Santo, Brazil Canonization and Isomorphism Test for 10:30-10:55 A Class of Infinite Convex Graphs of Bounded Treewidth 9:30-9:55 Hamilton Cycles in Geometries Daniel Lokshtanov, University of Bergen, Hypergraphs James B. Nation, University of Hawaii, Norway; Marcin Pilipczuk and Michal Frederik Garbe and Richard Mycroft, USA; Kira Adaricheva, Nazarbayev Pilipczuk, University of Warsaw, University of Birmingham, United University, Kazakhstan Poland; Saket Saurabh, Institute of Kingdom Mathematical Sciences, India 11:00-11:25 Strong Splitter Theorem 10:00-10:25 Hypergraph Embeddings and its Applications 11:00-11:25 The Splitter Game on Peter Allen, Julia Boettcher, Ewan Sandra Kingan, Brooklyn College of the Nowhere Dense Classes of Graphs Davies, and Jozef Skokan, London City University of New York, USA Sebastian Siebertz, Technische School of Economics, United Kingdom Universität Berlin, Germany 11:30-11:55 Constructive Algorithm for Path-Width of Matroids Jisu Jeong, Korea Advanced Institute of Science and Technology, Korea; Eun Jung Kim, CNRS, France; Sang- Il Oum, Korea Advanced Institute of Science and Technology, Korea

continued on next page 2016 SIAM Conference on Discrete Mathematics 31

10:30-10:55 The Codegree Threshold of Thursday, June 9 Thursday, June 9 {abc, abd, abe, cde} Victor Falgas-Ravry, Vanderbilt CP13 IP7 University, USA; Edward Marchant, Trinity College, Cambridge, United Graph Theory IV Quasirandomness, Sidorenko’s Conjecture and Kingdom; Oleg Pikhurko, University 9:30 AM-11:50 AM of Warwick, United Kingdom; Emil Graph Norms Room:SCE 203 - Second Floor Vaughan, Queen Mary, University of 1:30 PM-2:15 PM London, United Kingdom Chair: To Be Determined Room:SCE Speakers Auditorium - First 11:00-11:25 Universal Hypergraphs 9:30-9:45 When Every Minimal Floor Samuel Hetterich, Olaf Parczyk, and Separator is Complete Multipartite Yury Person, University of Frankfurt, Terry McKee, Wright State University, Chair: To Be Determined Germany USA Using the theory of quasirandomness 11:30-11:55 Spectra of Random 9:50-10:05 Characterization of Unit as an underlying theme, we will discuss Symmetric Hypermatrices and Interval Bigraphs of Open and Closed recent progress on a number of problems Random Hypergraphs Intervals in extremal graph theory, including Joshua Cooper, University of South Ashok K. Das, University Of Calcutta, Sidorenko’s conjecture and a question Carolina, USA India of Lovász asking for a classification of 10:10-10:25 On Forbidden Induced graphs that define norms. Subgraphs for Unit Disk Graphs David Conlon Victor Zamaraev, University of Warwick, University of Oxford, United Kingdom United Kingdom; Aistis Atminas, The Open University, United Kingdom 10:30-10:45 A New Proof of Seymour’s 6-Flow Theorem Robert Samal, Charles University, Czech Coffee Break Republic; Matt DeVos, Simon Fraser 2:15 PM-2:45 PM University, Canada; Edita Rollova, University of West Bohemia, Pilsen, Room:SCE Ballroom Pre-function Area - Czech Republic First Floor 10:50-11:05 Large Induced Forests in Planar and Subcubic Graphs of Girth 4 and 5 Thomas Kelly, University of Waterloo, Canada; Chun-Hung Liu, Princeton University, USA 11:10-11:25 On the Largest Number of Colorings of a Graph Aysel Erey, University of Denver, USA; Jason Brown, Dalhousie University, Canada 11:30-11:45 Short Containers in Modified Line Digraphs Prashant D. Joshi, Cadence Design Systems, USA; Frank Hsu, Fordham University, USA; Arunabha Sen, Arizona State University, USA; Said Hamdioui and Koen Bertels, Delft University of Technology, Netherlands

Lunch Break 12:00 PM-1:30 PM Attendees on their own 32 2016 SIAM Conference on Discrete Mathematics

Thursday, June 9 Thursday, June 9 Thursday, June 9 MS36 MS37 MS38 Combinatorial Algorithms: Discrete Geometry Random Discrete Structures - How Do We Cope with Hard 2:45 PM-4:15 PM Part II of III Problems? Room:SCE House Salon - First Floor 2:45 PM-5:15 PM 2:45 PM-5:15 PM Organizer: Boris Bukh Room:SCE Senate Salon - First Floor Room:SCE Court Salon - First Floor Carnegie Mellon University, USA For Part 1 see MS32 This minisymposium will highlight a For Part 3 see MS43 2:45-3:10 Quantitative Helly-Type The aim of the minisymposium is to variety of computing options available for Results provide insight into recent advances combinatorial problems. Many problems Pablo Soberon, Northeastern University, in the area of random discrete from graph theory and combinatorics USA face the issue of combinatorial explosion, structures, which deals mainly with 3:15-3:40 Bounds on Equiangular Lines typical properties and parameters making it difficult to obtain exact and on Related Spherical Codes solutions. Even pure mathematicians of combinatorial objects (graphs, Boris Bukh, Carnegie Mellon University, hypergraphs, algebraic and data working strictly within the realm of USA theorems and proofs must derive base structures, etc), their limit distributions 3:45-4:10 Geometric Discrepancy and cases from which to make conjectures. as well as randomized algorithms for its Applications In the world of discrete mathematics, generating and analyzing the structures. Esther Ezra, Georgia Institute of Presented topics will cover objects of computing simple base cases can be a Technology, USA significant obstacle. To deal with this, we purely theoretical origin and also models showcase several different case studies of random discrete structures motivated and traditional algorithms, as well as a by other fields of science like statistical variety of new computing methods that physics, computer science and network some mathematicians may be unfamiliar engineering. with. Organizer: Andrzej Rucinski Organizer: Victoria Horan Adam Mickiewicz University, Poland, Air Force Research Laboratory, USA and Emory University, USA 2:45-3:10 A Comparison of Organizer: Matas Sileikis Approaches for Solving Hard Graph- Charles University in Prague, Czech Theoretic Problems Republic Victoria Horan, Air Force Research 2:45-3:10 Unsatisfiability Proofs of Laboratory, USA Random (2,3)-SAT Require Much 3:15-3:40 Techniques for Solving the Space Sudoku Puzzle Patrick Bennett, Western Michigan Eric Chi, North Carolina State University, University, USA; Michael Molloy, USA; Kenneth Lange, University of University of Toronto, Canada California, Los Angeles, USA 3:15-3:40 Online Sprinkling 3:45-4:10 Using the D-Wave Machine Asaf Ferber, Yale University and for Combinatorial Problems Massachusetts Institute of Technology, Andrew D. King, D-Wave Systems, Inc., USA Canada 3:45-4:10 Independence of Random 4:15-4:40 Algorithms for Combinatorial Sets in Hypergraphs Generation Karen Gunderson, University of Joe Sawada, University of Guelph, Manitoba, Canada Canada 4:45-5:10 The Graph Isomorphism Problem and Adiabatic Algorithms Omar Shehab, University of Maryland, Baltimore County, USA

continued on next page 2016 SIAM Conference on Discrete Mathematics 33

4:15-4:40 How to Determine if a Thursday, June 9 Thursday, June 9 Random Graph with a Fixed Degree Sequence has a Giant Component MS39 MS40 Felix Joos and Guillem Perarnau, University of Birmingham, United Discrete Mathematical Cops and Robbers and Kingdom; Dieter Rautenbach, Biology - Part II of II Pursuit-Evasion in Discrete Universität Ulm, Germany; Bruce Reed, 2:45 PM-5:15 PM Structures - Part III of III McGill University, Canada Room:SCE 217 - Second Floor 2:45 PM-5:15 PM 4:45-5:10 Using Pólya Urns to Show Normal Limit Laws for Fringe Subtrees For Part 1 see MS19 Room:SCE 216 - Second Floor in m -ary Search Trees and Preferential This minisymposium will focus on For Part 2 see MS29 Attachment Trees the importance of discrete models From Cops and Robbers and its many Cecilia Holmgren and Svante Janson, and methods across a spectrum of variants, to firefighting and graph Uppsala University, Sweden; Matas mathematical biology. Our goal is burning, pursuit-evasion is a trending Sileikis, Charles University in Prague, to highlight common mathematical topic within graph theory and discrete Czech Republic challenges motivated by different mathematics. Broadly speaking, pursuit- biological applications. evasion focuses on agents whose goal Organizer: Christine Heitsch is to capture, contain, or block intruders Georgia Institute of Technology, USA loose in a discrete structure. The analysis of pursuit-evasion games brings together Organizer: Heather C. Smith probabilistic, structural, and algorithmic Georgia Institute of Technology, USA techniques. Applications range from 2:45-3:10 Complexity of the Single mobile computing to modelling the Cut-Or-Join Model for Genome spread of influence in social networks. Rearrangement The goal of the minisymposium is to Istvan Miklos, Renyi Institute, Hungary; bring together researchers in the field to Heather C. Smith, Georgia Institute of present results on the state-of-the-art in Technology, USA the field. 3:15-3:40 A Topological Language of Organizer: Anthony Bonato Rna Structures Ryerson University, Canada Wenda Huang and Christian Reidys, Virginia Tech, USA 2:45-3:10 To Catch a Falling Robber Pawel Pralat, Ryerson University, 3:45-4:10 Convex Hulls in Canada; Douglas B. West, Zhejiang Phylogenetic Tree Space Normal University, China and Megan Owen, Lehman College, CUNY, University of Illinois, USA; Bill USA Kinnersley, University of Rhode 4:15-4:40 Predict, Prevent and Island, USA Manage Antimicrobial Drug Resistance: Discrete and Algebraic 3:15-3:40 The Prisoner’s Dilemma Approaches Game on Graphs Kristina Crona, American University, Jeannette Janssen, Dalhousie University, USA Canada 4:45-5:10 Emergent Dynamics from 3:45-4:10 Searching Graph Products Network Connectivity: A Minimal Margaret-Ellen Messinger, Mount Model Allison University, Canada Carina Curto, Pennsylvania State 4:15-4:40 Cops, Robbers, and Infinite University, USA Graphs Gena Hahn, Université de Montréal, Canada 4:45-5:10 Cops and Robbers and Barricades Erin Meger and Anthony Bonato, Ryerson University, Canada 34 2016 SIAM Conference on Discrete Mathematics

Thursday, June 9 4:15-4:40 Tiling Directed Graphs with Thursday, June 9 Tournaments MS41 Cyzgrinow Andrzej, Arizona State CP14 Graph Theory - Part III of III University, USA; DeBiasio Louis, Ramsey Miami University, USA; Theodore 2:45 PM-5:15 PM Molla, University of Illinois at Urbana- 2:45 PM-4:25 PM Room:SCE Speakers Auditorium - First Champaign, USA; Andrew Treglown, Room:SCE 203 - Second Floor Floor University of Birmingham, United Kingdom Chair: To Be Determined For Part 2 see MS30 2:45-3:00 Bounded Colorings of 4:45-5:10 On Box-Perfect Graphs This minisymposium consists of Multipartite Graphs Guoli Ding, Louisiana State University, three sessions covering various topics Nina Kamcev, Benny Sudakov, and Jan USA surrounding extremal graph theory, Volec, ETH Zürich, Switzerland structural graph theory, and cycles and 3:05-3:20 Online Ramsey Theory for C paths in graphs. 3 Hojin Choi, Ilkyoo Choi, Jisu Jeong, Organizer: Guantao Chen and Sang-Il Oum, Korea Advanced Georgia State University, USA Institute of Science and Technology, Organizer: Xingxing Yu Korea Georgia Institute of Technology, USA 3:25-3:40 Diagonal Forms of Incidence 2:45-3:10 Degree Sum and Dominating Matrices Arising from Bipartite Graphs Paths and Applications to Zero-Sum Ramsey Ronald Gould, Emory University, USA; Problems Wing Hong Tony Wong, Kutztown Jill Faudree, University of Alaska, University of Pennsylvania, USA Fairbanks, USA; Ralph Faudree, University of Memphis, USA; Paul 3:45-4:00 Ramsey Goodness of Horn, University of Denver, USA; Bounded Degree Trees Michael Jacobson, University of Igor Balla, Alexey Pokrovskiy, and Colorado at Denver, USA Benjamin Sudakov, ETH Zürich, Switzerland 3:15-3:40 Clique Degrees in Random Graphs 4:05-4:20 On Ordered Ramsey Anton Bernshteyn, University of Numbers of Bounded-Degree Graphs Illinois at Urbana-Champaign, USA; Martin Balko, Vít Jelínek, and Pavel Christopher Cox, Carnegie Mellon Valtr, Charles University in Prague, University, USA; Paul Horn, University Czech Republic of Denver, USA; Franklin Kenter, Rice University, USA; Bernard Lidicky and Bernard Lidicky, Iowa State University, USA; Humberto Naves, University of Minnesota, USA; Florian Pfender, University of Colorado, Denver, USA; Michael Tait, University of California, San Diego, USA 3:45-4:10 Packing and Covering Immersions in 4-Edge-Connected Graphs Chun-Hung Liu, Princeton University, USA

continued in next column 2016 SIAM Conference on Discrete Mathematics 35

Thursday, June 9 Friday, June 10 Friday, June 10 PP1 IP8 Poster Session Excluded Grid Theorem: Registration 5:30 PM-6:30 PM Improved and Simplified 7:30 AM-10:30 AM Room:SCE Ballroom Pre-function Area - 8:15 AM-9:00 AM Room:SCE Ballroom Pre-function Area First Floor Room:SCE Speakers Auditorium - First - First Floor Fast and Efficient High Order Sparse Floor Matrix Qr Factorization for Fpgas Chair: To Be Determined Semih Aslan, Texas State University, Closing Remarks One of the key results in Robertson USA and Seymour’s seminal work on graph Linear Sequential Dynamical Systems 8:10 AM-8:15 AM minors is the Excluded Grid Theorem. and the Moebius Functions of Partially Room:SCE Speakers Auditorium - First The theorem states that there is a Ordered Sets Floor function f, such that for every positive Ricky X. Chen, Virginia Tech, USA; integer g, every graph whose treewidth Christian Reidys, Los Alamos National is at least f(g) contains the (gxg)-grid Laboratory, USA as a minor. This theorem has found Method for Finding the Maximum many applications in graph theory and Region Disjoint Paths in a Network algorithms. An important open question Rucha M. Joshi, Westwood High School, is establishing tight bounds on f(g) for USA which the theorem holds. Robertson and Linear Feedback State Registers Fool Seymour showed that f(g)≥Ω(g2 logg), Finite Automata and this remains the best current lower Bjørn Kjos-Hanssen, Achilles Beros, and bound on f(g). Until recently, the best Mushfeq Khan, University of Hawaii, upper bound was super-exponential in Manoa, USA g. In this talk, we will give an overview Enumeration of Chord Diagrams of a recent sequence of results, that has Evgeniy Krasko and Alexander lead to the best current upper bound of 19 Omelchenko, St. Petersburg Academic f(g)=O(g polylog(g)). University, Russia Julia Chuzhoy Analyzing RNA Secondary Structures Toyota Technological Institute at with Fixed Percentage of Bases Chicago, USA Thomas J. Li and Christian Reidys, Virginia Tech, USA Moments and Cycle Structures for Random Permutations with Restricted Positions Enes Ozel, University of Southern California, USA Coffee Break A Combinatorial Approach to Deep 9:00 AM-9:30 AM Learning and Compression Room:SCE Ballroom Pre-function Area - Hristo S. Paskov, John C. Mitchell, and First Floor Trevor Hastie, Stanford University, USA 36 2016 SIAM Conference on Discrete Mathematics

Friday, June 10 Friday, June 10 11:00-11:25 On a Phase Transition of the Random Intersection Graph: MS42 MS43 Supercritical Region Jeong Han Kim, Korea Institute for Markov Chains in the Random Discrete Structures - Advanced Study, Korea; Sang June Sciences Part III of III Lee, Duksung Women’s University, 9:30 AM-12:00 PM 9:30 AM-12:00 PM Korea; Joohan Na, Korea Institute for Advanced Study, Korea Room:SCE Court Salon - First Floor Room:SCE Senate Salon - First Floor 11:30-11:55 Concentration of Markov chains are widely used For Part 2 see MS38 Extension Counts in G(n,p) throughout the sciences. Markov chain The aim of the minisymposium is to Matas Sileikis, Charles University in Monte Carlo methods provide a simple provide insight into recent advances Prague, Czech Republic; Lutz Warnke, way to sample from complex distributions in the area of random discrete University of Cambridge, United or to count combinatorial objects. Markov structures, which deals mainly with Kingdom chains also arise naturally as stochastic typical properties and parameters processes that are interesting in their of combinatorial objects (graphs, own right. The analysis of Markov hypergraphs, algebraic and data chains draws techniques and insights structures, etc), their limit distributions from probability, combinatorics, graph as well as randomized algorithms for theory, theoretical computer science generating and analyzing the structures. and the various scientific disciplines Presented topics will cover objects of using them. In this minisymposium, we purely theoretical origin and also models explore Markov chains from areas such of random discrete structures motivated as statistical physics and cryptography as by other fields of science like statistical well as the mathematical techniques used physics, computer science and network to understand and analyze them. engineering. Organizer: Sarah Miracle Organizer: Andrzej Rucinski University of St. Thomas, USA Adam Mickiewicz University, Poland, Organizer: Amanda Streib and Emory University, USA Center for Computing Sciences, USA Organizer: Matas Sileikis 9:30-9:55 Cycle Basis Markov Chain for Charles University in Prague, Czech the Ising Model Republic Amanda Streib and Noah Streib, Center 9:30-9:55 Multicolour Ramsey for Computing Sciences, USA; Isabel Properties of Random Graphs Beichl, National Institute of Standards Pawel Pralat, Ryerson University, and Technology, USA; Francis Sullivan, Canada; Andrzej Dudek, Western Center for Computing Sciences, USA Michigan University, USA 10:00-10:25 Reverse Cycle Walking 10:00-10:25 Folkman Numbers and and its Applications Hypergraph Containers Sarah Miracle and Scott Yilek, University Troy Retter, Emory University, USA of St. Thomas, USA 10:30-10:55 Finding Structures in 10:30-10:55 Sampling Integer Partitions Random Graphs Economically Using Biased Markov Chains Asaf Ferber, Yale University and Prateek Bhakta, Dana Randall, Ben Massachusetts Institute of Technology, Cousins, and Matthew Fahrbach, USA; Michael Krivelevich, Tel Aviv Georgia Institute of Technology, USA University, Israel; Benny Sudakov and 11:00-11:25 Sampling on Lattices Pedro Vieira, ETH Zürich, Switzerland with Free Boundary Conditions Using Randomized Extensions Sarah Cannon and Dana Randall, Georgia Institute of Technology, USA 11:30-11:55 On Sampling Crossing-Free Geometric Structures Ivona Bezakova, Rochester Institute of Technology, USA continued in next column 2016 SIAM Conference on Discrete Mathematics 37

Friday, June 10 Friday, June 10 Friday, June 10 MS44 MS45 MS46 Matroids Antimatroids - Parameterized Algorithms Extremal Combinatorics - Part II of II and Graph Decompositions Part III of III 9:30 AM-11:30 AM - Part II of II 9:30 AM-12:00 PM Room:SCE 217 - Second Floor 9:30 AM-12:00 PM Room:SCE Speakers Auditorium - First For Part 1 see MS33 Room:SCE 216 - Second Floor Floor Matroids and antimatroids are set For Part 1 see MS34 For Part 2 see MS26 systems that satisfy certain combinatorial The minisymposium will focus on Combinatorics is a fundamental properties. Matroid theory provides a the latest developments in the area of discipline of modern mathematics framework in which problems on graphs, parameterized algorithms and fixed- which studies discrete objects and matrices, designs, etc. become easy parameter tractability. Particular their properties. This minisymposium to understand and solve. Antimatroids emphasis is put on various graph we propose will focus on the subfield have many applications to the theory of decompositions and structural graph of extremal combinatorics and graph geometric spaces and knowledge spaces. theory with their application in graph theory, which has witnessed an These two areas have grown significantly algorithms. exciting development over the past in recent decades. This minisymposium decades, and also has many striking brings together researchers in both areas Organizer: Marek Cygan practical applications in mathematical to seek commonalities and extensions of University of Warsaw, Poland optimization, computer science, major work. Organizer: Marcin Pilipczuk statistical physics and voting society. Organizer: Kira Adaricheva University of Warsaw, Poland We aim to bring the top researchers to the minisymposium, where they will Nazarbayev University, Kazakhstan Organizer: Michal Pilipczuk present the recent progress, discuss open University of Warsaw, Poland Organizer: Sandra Kingan challenges, exchange research ideas, and Brooklyn College of the City University of 9:30-9:55 Modular Decomposition and initiate new collaborations. We expect New York, USA its Algorithmic Applications a minisymposium of this nature to have Yixin Cao, The Hong Kong Polytechnic 9:30-9:55 Clones in Matroids a lasting impact on the future of the Talmage J. Reid, University of University, Hong Kong subject. Mississippi, USA 10:00-10:25 Optimization Problems via Organizer: Hao Huang Minimal Triangulations and Potential 10:00-10:25 Effective Implicational Maximal Cliques Emory University, USA Bases of Convex Geometries Ioan Todinca, Universite d’Orleans, Kira Adaricheva, Nazarbayev University, Organizer: Yi Zhao France Kazakhstan Georgia State University, USA 10:30-10:55 Structural Sparseness and 9:30-9:55 On Some Turán and Dirac- 10:30-10:55 Coefficients of the Tutte Complex Networks Type Questions for Triple Systems Polynomial Felix J. Reidl, North Carolina State Andrzej Rucinski, Adam Mickiewicz Vaidyanathan Sivaraman, Binghamton University, USA University, Poland, and Emory University, USA 11:00-11:25 Color Coding-Related University, USA 11:00-11:25 Clones in Matroids Techniques Representable Over a Prime Field 10:00-10:25 Extremal Problems for Meirav Zehavi, Tel Aviv University, Xiangqian Zhou, Wright State University, Uniformly Dense Hypergraphs Israel Mathias Schacht, Universitat Hamburg, USA 11:30-11:55 Parameterized Algorithms Germany Using Matroids Saket Saurabh, Institute of Mathematical Sciences, India

continued on next page 38 2016 SIAM Conference on Discrete Mathematics

Friday, June 10 Friday, June 10 MS46 CP15 Extremal Combinatorics - Geometry Part III of III 9:30 AM-11:10 AM 9:30 AM-12:00 PM Room:SCE 203 - Second Floor Room:SCE Speakers Auditorium - First Chair: To Be Determined Floor 9:30-9:45 On the Widom-Rowlinson continued Occupancy Fraction in Regular Graphs Emma Cohen, Georgia Institute of Technology, USA; Will Perkins, 10:30-10:55 The Matching-Number University of Birmingham, United Process Kingdom; Prasad Tetali, Georgia Michael Krivelevich, Tel Aviv University, Institute of Technology, USA Israel; Po-Shen Loh, Carnegie Mellon University, USA; Benjamin Sudakov, 9:50-10:05 Discrete Curvature and ETH Zürich, Switzerland Abelian Groups Peter Ralli, Georgia Institute of 11:00-11:25 Problems and Results on Technology, USA Bisections Jie Ma, University of Science and 10:10-10:25 Local Polyhedrality of Technology of China, China; Hehui Integer Hulls of Strict Convex Sets Wu, University of Mississippi, USA Umakanta Pattanayak and Vishnu Narayanan, Indian Institute of 11:30-11:55 Saturation in Random Technology-Bombay, India Graphs Daniel Korandi and Benjamin Sudakov, 10:30-10:45 The Graded Lexicographic ETH Zürich, Switzerland Polytope and Two New Families of Dantzig Figures Akshay Gupte and Svetlana Poznanovic, Clemson University, USA 10:50-11:05 Reconstructing a Finite Topological Space from Quotient- Spaces J. M S. Simoes-Pereira, University of Coimbra, Portugal 2016 SIAM Conference on Discrete Mathematics 39

Abstracts

Abstracts are printed as submitted by the authors.

9440 2016 SIAM Conference on Discrete Mathematics

Notes 2016 SIAM Conference on Discrete Mathematics 95

Speaker and Organizer Index 96 2016 SIAM Conference on Discrete Mathematics

A Burnette, Charles D., CP12, 2:10 Wed Crona, Kristina, MS39, 4:15 Thu Abbe, Emmanuel, MS1, 10:00 Mon Cueto, Maria Angelica, MS27, 1:30 Wed C Cullina, Daniel, MS18, 3:15 Tue Adaricheva, Kira, MS33, 9:30 Thu Cameron, Amanda, MS24, 10:00 Wed Curto, Carina, MS39, 4:45 Thu Adaricheva, Kira, MS44, 9:30 Fri Candogan, Utkan Onur, MS23, 9:30 Wed Cygan, Marek, MS34, 9:30 Thu Adaricheva, Kira, MS44, 10:00 Fri Candogan, Utkan Onur, MS23, 9:30 Wed Cygan, Marek, MS45, 9:30 Fri Allen, Peter, MS35, 10:00 Thu Cannon, Sarah, MS42, 11:00 Fri Czabarka, Eva, MS2, 9:30 Mon Arsuaga, Javier, MS19, 4:45 Tue Cao, Yixin, MS45, 9:30 Fri Czabarka, Eva, MS22, 9:30 Wed Aslan, Semih, MS16, 11:00 Tue Chandrasekaran, Venkat, MS23, 9:30 Aslan, Semih, PP1, 5:30 Thu Wed Czabarka, Eva, MS22, 11:30 Wed Asplund, John, CP9, 9:50 Wed Chen, Guantao, MS11, 2:45 Mon D Chen, Guantao, MS30, 1:30 Wed Das, Ashok K., CP13, 9:50 Thu B Chen, Guantao, MS41, 2:45 Thu Babai, László, 4:30 Wed Davidson, Ruth, MS19, 3:15 Tue Chen, Ricky X., CP12, 2:50 Wed Babai, László, 5:30 Wed Davidson, Ruth, MS22, 11:00 Wed Chen, Ricky X., PP1, 5:30 Thu Baker, Matthew, MS8, 2:45 Mon Debiasio, Louis, MS9, 2:45 Mon Chi, Eric, MS12, 9:30 Tue Baker, Matthew, MS14, 9:30 Tue Debiasio, Louis, MS9, 2:45 Mon Chi, Eric, MS36, 3:15 Thu Baker, Matthew, MS27, 1:30 Wed Debiasio, Louis, MS28, 1:30 Wed Choi, Hojin, CP14, 3:05 Thu Bal, Deepak, MS9, 3:45 Mon Delcourt, Michelle, MS3, 10:00 Mon Choi, Jihoon, CP5, 9:50 Tue Balko, Martin, CP14, 4:05 Thu Dettmann, Carl, MS13, 11:30 Tue Choromanski, Krzysztof M., MS11, 4:15 Balla, Igor, CP14, 3:45 Thu Dettmann, Carl, CP8, 2:45 Tue Mon Barg, Alexander, MS1, 9:30 Mon Diaconis, Persi, IP2, 1:30 Mon Choromanski, Krzysztof M., MS32, Barg, Alexander, MS7, 2:45 Mon 11:00 Thu Diestel, Reinhard, IP5, 8:15 Wed Barg, Alexander, MS18, 2:45 Tue Chowdhury, Ameera, MS18, 2:45 Tue Ding, Guoli, MS41, 4:45 Thu Barrus, Michael D., CP7, 3:05 Tue Chun, Carolyn, MS4, 9:30 Mon Doignon, Jean-Paul, MS33, 9:30 Thu Baryshnikov, Yuliy, MS31, 10:00 Thu Chun, Carolyn, MS15, 9:30 Tue Draisma, Jan, IP3, 8:15 Tue Bau, Sheng, CP1, 9:50 Mon Chun, Carolyn, MS24, 9:30 Wed Draisma, Jan, MS8, 2:45 Mon Beelen, Peter, MS1, 9:30 Mon Churchley, Ross, MS3, 11:00 Mon Dudzik, Andrew, MS27, 2:30 Wed Bennett, Patrick, MS32, 11:30 Thu Chuzhoy, Julia, IP8, 8:15 Fri Duffy, Christopher, CP2, 10:10 Mon Bezakova, Ivona, MS42, 11:30 Fri Cifuentes, Diego, MS23, 11:00 Wed Dvorak, Zdenek, MS3, 9:30 Mon Bhakta, Prateek, MS42, 10:30 Fri Clark, Ben, MS15, 10:30 Tue Dvorak, Zdenek, MS5, 9:30 Mon Boettcher, Julia, MS32, 10:00 Thu Clarke, Nancy E., MS10, 3:15 Mon Dwork, Cynthia, IP1, 8:15 Mon Bonamy, Marthe, MS20, 2:45 Tue Cohen, Emma, CP15, 9:30 Fri Dyer, Danny, MS10, 3:45 Mon Bonamy, Marthe, MS25, 10:30 Wed Collins, Karen, CP1, 10:50 Mon E Bonato, Anthony, MS10, 2:45 Mon Conlon, David, IP7, 1:30 Thu Edwards, Katherine, MS22, 9:30 Wed Bonato, Anthony, MS10, 2:45 Mon Conlon, David, MS9, 4:15 Mon Elenberg, Ethan R., MS23, 10:00 Wed Bonato, Anthony, MS29, 1:30 Wed Cooper, Joshua, MS35, 11:30 Thu Ellingham, Mark, MS30, 2:00 Wed Bonato, Anthony, MS40, 2:45 Thu Costalonga, Joao Paulo, MS33, 10:00 Erey, Aysel, CP13, 11:10 Thu Thu Bowler, Nathan, MS4, 10:00 Mon Ezra, Esther, MS37, 3:45 Thu Bradonjic, Milan, CP2, 11:10 Mon Cranston, Daniel, MS5, 9:30 Mon Bukh, Boris, MS37, 2:45 Thu Cranston, Daniel, MS5, 11:00 Mon Bukh, Boris, MS37, 3:15 Thu Cranston, Daniel, MS25, 9:30 Wed

Italicized names indicate session organizers 2016 SIAM Conference on Discrete Mathematics 97

Hu, Ping, MS17, 10:30 Tue Korlakai Vinayak, Ramya, MS23, 10:30 F Wed Falgas-Ravry, Victor, MS35, 10:30 Thu Huang, Hao, MS6, 9:30 Mon Kothari, Nishad, CP7, 4:05 Tue Feghali, Carl, MS20, 3:15 Tue Huang, Hao, MS6, 9:30 Mon Kral, Daniel, MS25, 9:30 Wed Ferber, Asaf, MS38, 3:15 Thu Huang, Hao, MS26, 9:30 Wed Krasko, Evgeniy, PP1, 5:30 Thu Ferrero, Daniela, MS16, 9:30 Tue Huang, Hao, MS46, 9:30 Fri Kreutzer, Stephan, MS34, 9:30 Thu Ferrero, Daniela, MS16, 10:00 Tue Huang, Wenda, MS39, 3:15 Thu Kupavskii, Andrey, CP12, 1:30 Wed Fink, Alex, MS8, 3:15 Mon I Kwan, Matthew, CP2, 9:30 Mon Frieze, Alan, MS10, 4:15 Mon Ito, Takehiro, MS20, 2:45 Tue Frieze, Alan, MS32, 9:30 Thu L Funk, Daryl, MS24, 11:00 Wed J Lang, Richard, MS28, 2:30 Wed Jacobson, Sheldon H., CP8, 4:25 Tue Lanius, Melinda, CP1, 10:10 Mon G Janssen, Jeannette, MS40, 3:15 Thu Larsen, Victor, CP7, 2:45 Tue Gadiya, Mahaveer P., CP3, 3:25 Mon Jensen, Anders, MS14, 10:00 Tue Larson, Craig E., CP10, 10:30 Wed Gaubert, Stephane, MS14, 9:30 Tue Jeong, Jisu, MS34, 11:30 Thu Lee, Sang June, MS43, 11:00 Fri Giansiracusa, Noah, MS8, 3:45 Mon Jiang, Tao, MS6, 10:30 Mon Lee, Sooyeon, MS15, 9:30 Tue Gleich, David F., MS12, 9:30 Tue Jiang, Tao, MS21, 3:45 Tue Letzter, Shoham, MS28, 2:00 Wed Gleich, David F., MS12, 11:00 Tue Johnson, Katie V., CP4, 3:45 Mon Li, Thomas J., PP1, 5:30 Thu Gleich, David F., MS31, 9:30 Thu Joshi, Prashant D., CP13, 11:30 Thu Li, Wei-Tian, CP5, 10:10 Tue Glock, Stefan, CP9, 9:30 Wed Joshi, Rucha M., PP1, 5:30 Thu Lidicky, Bernard, MS5, 11:30 Mon Gonzalez Hermosillo, Sebastian, MS3, Lidicky, Bernard, MS17, 9:30 Tue 11:30 Mon K Lin, Bo, MS14, 10:30 Tue Gould, Ronald, MS41, 2:45 Thu Kabatiansky, Grigory, MS1, 11:00 Mon Liu, Chun-Hung, MS41, 3:45 Thu Grace, Kevin M., MS15, 11:00 Tue Kabatiansky, Grigory, MS1, 11:30 Mon Lo, Allan, CP9, 10:10 Wed Gunderson, Karen, MS38, 3:45 Thu Kamcev, Nina, CP14, 2:45 Thu Loh, Po-Shen, MS46, 10:30 Fri Gupte, Akshay, CP15, 10:30 Fri Kang, Dongyeap, CP6, 10:50 Tue Kashyap, Navin, MS18, 4:15 Tue Lohss, Amanda, CP8, 3:45 Tue H Kashyap, Navin, MS18, 4:45 Tue Lorscheid, Oliver, MS27, 3:00 Wed Hagiwara, Manabu, CP5, 10:30 Tue Keller, Mitchel T., CP11, 1:30 Wed Lovasz, Laszlo M., MS3, 10:30 Mon Hahn, Gena, MS40, 4:15 Thu Kelly, Thomas, CP13, 10:50 Thu Lu, Linyuan, MS26, 10:30 Wed Hamilton, Kathleen, CP8, 4:05 Tue Kenter, Franklin, MS16, 9:30 Tue Han, Jie, MS21, 4:45 Tue M Kenter, Franklin, MS16, 9:30 Tue Ma, Jie, MS46, 11:00 Fri Hancock, Robert A., CP11, 1:50 Wed Khokhlov, Vladimir I., CP8, 3:25 Tue MacGillivrary, Gary, MS29, 2:00 Wed Hartke, Stephen, CP4, 3:05 Mon King, Andrew D., MS36, 3:45 Thu Malik, Shabnam, CP7, 3:25 Tue Harutyunyan, Ararat, CP9, 10:50 Wed Kingan, Sandra, MS33, 9:30 Thu Margulies, Susan, MS4, 11:00 Mon Heitsch, Christine, MS19, 2:45 Tue Kingan, Sandra, MS33, 11:00 Thu Martin, Ryan R., MS6, 10:00 Mon Heitsch, Christine, MS19, 2:45 Tue Kingan, Sandra, MS44, 9:30 Fri Martin, William J., MS7, 3:45 Mon Heitsch, Christine, MS39, 2:45 Thu Kinnersley, Bill, MS29, 3:30 Wed Martins, Taisa, MS17, 11:30 Tue Hernandez-Velez, Cesar, CP3, 3:05 Mon Kjos-Hanssen, Bjørn, PP1, 5:30 Thu Mazumdar, Arya, MS7, 2:45 Mon Holmgren, Cecilia, MS38, 4:45 Thu Klostermeyer, Chip, MS29, 1:30 Wed McDonald, Jessica, MS5, 10:00 Mon Horan, Victoria, MS36, 2:45 Thu Koay, Cheng G., MS13, 10:30 Tue McDonald, Jessica, MS30, 2:30 Wed Horan, Victoria, MS36, 2:45 Thu Korandi, Daniel, MS46, 11:30 Fri Mcdowell, Andrew J., CP2, 9:50 Mon Hough, Wesley K., CP12, 2:30 Wed McKee, Terry, CP13, 9:30 Thu

Italicized names indicate session organizers 98 2016 SIAM Conference on Discrete Mathematics

Meger, Erin, MS40, 4:45 Thu Perarnau, Guillem, MS38, 4:15 Thu S Messinger, Margaret-Ellen, MS40, 3:45 Perez Gimenez, Xavier, MS29, 3:00 Wed Salas, Jesus, MS20, 3:45 Tue Thu Perkins, Will, MS32, 10:30 Thu Samal, Robert, CP13, 10:30 Thu Milans, Kevin, CP1, 10:30 Mon Person, Yury, MS35, 11:00 Thu Saurabh, Saket, MS45, 11:30 Fri Milenkovic, Olgica, MS7, 3:15 Mon Pfeil, Simon, MS24, 10:30 Wed Sawada, Joe, MS36, 4:15 Thu Miracle, Sarah, MS42, 9:30 Fri Pfender, Florian, MS17, 9:30 Tue Schacht, Mathias, MS46, 10:00 Fri Miracle, Sarah, MS42, 10:00 Fri Pfender, Florian, MS41, 3:15 Thu Schmitt, John, CP11, 2:30 Wed Mohar, Bojan, MS3, 9:30 Mon Pilipczuk, Marcin, MS34, 9:30 Thu Schweitzer, Pascal, MS34, 10:00 Thu Mohar, Bojan, MS3, 9:30 Mon Pilipczuk, Marcin, MS34, 10:30 Thu Seshadhri, C., MS12, 9:30 Tue Molla, Theodore, MS41, 4:15 Thu Pilipczuk, Marcin, MS45, 9:30 Fri Seshadhri, C., MS12, 10:30 Tue Molloy, Michael, MS38, 2:45 Thu Pilipczuk, Michal, MS34, 9:30 Thu Seshadhri, C., MS31, 9:30 Thu Montgomery, Richard, MS21, 4:15 Tue Pilipczuk, Michal, MS45, 9:30 Fri Shabanov, Dmitry, CP6, 9:30 Tue Moriyama, Sonoko, MS4, 10:30 Mon Pokrovskiy, Alexey, MS9, 2:45 Mon Shan, Songling, CP7, 3:45 Tue Morrison, Ralph, MS27, 2:00 Wed Pokrovskiy, Alexey, MS28, 1:30 Wed Shapira, Asaf, MS26, 10:00 Wed Moss, Tyler, MS24, 11:30 Wed Pokrovskiy, Alexey, MS28, 1:30 Wed Sharma, Aneesh, MS31, 10:30 Thu Mouawad, Amer, MS20, 4:15 Tue Polyanskiy, Yuri, MS18, 3:45 Tue Shehab, Omar, MS36, 4:45 Thu Mycroft, Richard, MS21, 2:45 Tue Postle, Luke, MS25, 11:30 Wed Shitov, Yaroslav, MS14, 11:00 Tue Mycroft, Richard, MS35, 9:30 Thu Poznanovikj, Svetlana, MS19, 3:45 Tue Siebertz, Sebastian, MS34, 11:00 Thu Mycroft, Richard, MS35, 9:30 Thu Pradhan, Sahadev, CP3, 4:05 Mon Sileikis, Matas, MS32, 9:30 Thu N Pralat, Pawel, MS40, 2:45 Thu Sileikis, Matas, MS38, 2:45 Thu Naia, T’assio, CP5, 9:30 Tue Pralat, Pawel, MS43, 9:30 Fri Sileikis, Matas, MS43, 9:30 Fri Nation, James B., MS33, 10:30 Thu Puleo, Gregory J., MS25, 10:00 Wed Sileikis, Matas, MS43, 11:30 Fri Naves, Humberto, MS6, 11:00 Mon R Simanjuntak, Rinovia, CP9, 11:10 Wed Naves, Humberto, MS22, 10:00 Wed Rabinoff, Joseph, MS27, 3:30 Wed Simoes-Pereira, J. M S., CP15, 10:50 Fri Nelson, Peter, MS15, 11:30 Tue Rajasekaran, Ramar, CP4, 2:45 Mon Singh, Satyanand, CP11, 2:50 Wed Nikiforov, Vladimir, MS11, 3:15 Mon Ralli, Peter, CP15, 9:50 Fri Sinkovic, John, MS16, 10:30 Tue Nikiforov, Vladimir, MS11, 4:45 Mon Ravikumar, Bala, CP10, 10:10 Wed Sivaraman, Vaidyanathan, MS44, 10:30 Fri Noel, Jonathan A., MS20, 4:45 Tue Reid, Talmage J., MS44, 9:30 Fri Skerman, Fiona, CP2, 10:50 Mon Norin, Sergey, MS11, 2:45 Mon Reidl, Felix J., MS45, 10:30 Fri Skokan, Jozef, MS28, 3:00 Wed Norin, Sergey, MS26, 11:00 Wed Retter, Troy, MS43, 10:00 Fri Skums, Pavel, CP3, 3:45 Mon Rincon, Felipe, MS8, 4:15 Mon O Smith, Heather C., MS2, 11:00 Mon Odlyzko, Andrew M., IP4, 1:30 Tue Rocha, Israel S., CP2, 10:30 Mon Smith, Heather C., MS19, 2:45 Tue Owen, Megan, MS39, 3:45 Thu Rok, Alexandre, CP4, 3:25 Mon Smith, Heather C., MS39, 2:45 Thu Oxley, James, MS4, 11:30 Mon Roychowdhury, Mrinal K., MS13, 9:30 Tue Smith, Heather C., MS39, 2:45 Thu Ozel, Enes, PP1, 5:30 Thu Roychowdhury, Mrinal K., MS13, 10:00 Soberon, Pablo, MS37, 2:45 Thu P Tue Soukup, Daniel, MS28, 3:30 Wed Panageas, Ioannis, CP8, 3:05 Tue Rucinski, Andrzej, MS32, 9:30 Thu Sritharan, R, CP9, 10:30 Wed Papadimitriou, Dimitri, CP10, 9:50 Wed Rucinski, Andrzej, MS38, 2:45 Thu St. John, Katherine, MS22, 10:30 Wed Paskov, Hristo S., PP1, 5:30 Thu Rucinski, Andrzej, MS43, 9:30 Fri Stein, Maya, MS9, 3:15 Mon Pattanayak, Umakanta, CP15, 10:10 Fri Rucinski, Andrzej, MS46, 9:30 Fri Peng, Yuejian, MS11, 3:45 Mon

Italicized names indicate session organizers 2016 SIAM Conference on Discrete Mathematics 99

Streib, Amanda, MS42, 9:30 Fri Wei, Huayi, MS13, 9:30 Tue Streib, Amanda, MS42, 9:30 Fri Wei, Huayi, MS13, 9:30 Tue Suagee, Jason, CP1, 9:30 Mon Wenger, Paul, CP12, 1:50 Wed Sudakov, Benny, IP6, 8:15 Thu West, Douglas B., MS30, 3:00 Wed Suk, Andrew, MS26, 11:30 Wed Westlund, Erik E., CP6, 10:30 Tue Sullivan, Blair, MS31, 9:30 Thu Wetzler, Kristen, MS24, 9:30 Wed Szekely, Laszlo, MS2, 9:30 Mon Wiechert, Veit, CP10, 9:30 Wed Szekely, Laszlo, MS2, 9:30 Mon Wollan, Paul, MS30, 1:30 Wed Szekely, Laszlo, MS22, 9:30 Wed Wong, Wing Hong Tony, CP14, 3:25 Thu T Woodruff, David, MS12, 10:00 Tue Thiel, Johann, CP11, 2:10 Wed Wrochna, Marcin, MS25, 11:00 Wed Todinca, Ioan, MS45, 10:00 Fri Wu, Hehui, MS5, 10:30 Mon Tran, Ngoc, MS8, 2:45 Mon Wu, Zijun, MS13, 11:00 Tue Tran, Ngoc, MS14, 9:30 Tue Tran, Ngoc, MS27, 1:30 Wed Y Treglown, Andrew, MS21, 2:45 Tue Yang, Boting, MS29, 2:30 Wed Treglown, Andrew, MS21, 2:45 Tue Yekhanin, Sergey, MS7, 4:15 Mon Treglown, Andrew, MS35, 9:30 Thu Yekhanin, Sergey, MS7, 4:45 Mon Trenk, Ann N., CP5, 10:50 Tue Yepremyan, Liana, MS17, 10:00 Tue Turner, Jacob, CP3, 2:45 Mon Yerger, Carl, CP10, 10:50 Wed Yoshida, Ruriko, MS19, 4:15 Tue V Young, Michael, MS17, 9:30 Tue Valiant, Gregory, MS12, 11:30 Tue Yu, Josephine, MS8, 2:45 Mon van der Holst, Hein, MS16, 11:30 Tue Yu, Josephine, MS14, 9:30 Tue van Der Pol, Jorn, MS15, 10:00 Tue Yu, Josephine, MS27, 1:30 Wed van Zwam, Stefan, MS4, 9:30 Mon Yu, Xingxing, MS11, 2:45 Mon van Zwam, Stefan, MS4, 9:30 Mon Yu, Xingxing, MS30, 1:30 Wed van Zwam, Stefan, MS15, 9:30 Tue Yu, Xingxing, MS41, 2:45 Thu van Zwam, Stefan, MS24, 9:30 Wed Yuditsky, Yelena, CP6, 11:10 Tue Vandenbussche, Jennifer, CP6, 9:50 Tue Verstraete, Jacques, MS26, 9:30 Wed Z Vieira, Pedro, MS43, 10:30 Fri Zamaraev, Victor, CP13, 10:10 Thu Volec, Jan, MS17, 11:00 Tue Zang, Wenan, MS30, 3:30 Wed Volk, Ben Lee, MS1, 10:30 Mon Zehavi, Meirav, MS45, 11:00 Fri Zhang, Xia, CP6, 10:10 Tue W Zhao, Yi, MS6, 9:30 Mon Wagner, Stephan, MS2, 10:00 Mon Zhao, Yi, MS21, 3:15 Tue Wang, Hua, MS2, 10:30 Mon Zhao, Yi, MS26, 9:30 Wed Warnke, Lutz, SP1, 5:30 Tue Zhao, Yi, MS46, 9:30 Fri Warnow, Tandy, MS2, 11:30 Mon Zhou, Xiangqian, MS44, 11:00 Fri Wei, Fan, MS6, 11:30 Mon

Italicized names indicate session organizers 100 2016 SIAM Conference on Discrete Mathematics 2016 SIAM Conference on Discrete Mathematics 101

DM16 Budget

Conference Budget SIAM Conference on Discrete Mathematics June 6-10, 2016 Atlanta, Georgia

Expected Paid Attendance 320

Revenue Registration Income $88,870.00 GSU Support $10,000.00 Total $98,870.00

Expenses Printing $2,200.00 Organizing Committee $3,800.00 Invited Speakers $10,500.00 Food and Beverage $15,000.00 Room Rental $9,000.00 Advertising $3,000.00 Conference Labor (including benefits) $38,512.00 Other (supplies, staff travel, freight, misc.) $3,550.00 Administrative $8,293.00 Accounting/Distribution & Shipping $4,450.00 Information Systems $8,247.00 Customer Service $3,002.00 Marketing $4,690.00 Office Space (Building) $3,050.00 Other SIAM Services $3,101.00 Total $120,395.00

Net Conference Expense -$21,525.00

Support Provided by SIAM $21,525.00 $0.00

Estimated Support for Travel Awards not included above:

Early Career and Students 22 $17,100.00 Georgia State University Student Center Floor Plan

Student Center East (SCE): 1st Floor Student Center East (SCE): 2nd Floor