Survey speakers:
Invited talks:
- Xavier Allamigeon (INRIA) — No Self-concordant Barrier Interior Point Method is Strongly Polynomial
- Michael Anastos (Institute of Science and Technology Austria) — A Fast Algorithm on Average for Solving the Hamilton Cycle Problem
- Christian Coester (University of Oxford) — Shortest Paths without a Map, but with an Entropic Regularizer
- Ohad-Noy Feldheim (Hebrew University of Jerusalem) — The Power of Two Choices in Graphical Allocation
- Jie Gao (Rutgers University) — On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem
- Mohsen Ghaffari (Massachusetts Institute of Technology) — Local Computation of Maximum Independent Set
- Alexandros Hollender (École Polytechnique Fédérale de Lausanne) — Pure-Circuit: Strong Inapproximability for PPAD
- Linda Kleist (Technical University Braunschweig) — A Solution to Ringel's Circle Problem
- Ariel Kulik (CISPA Helmholtz Center for Information Security) — Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
- William Kuszmaul (Massachusetts Institute of Technology) — A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits
- Rasmus Kyng (ETH Zurich) — Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
- Kent Quanrud (Purdue University) — Densest Subgraph: Supermodularity, Iterative Peeling, and Flow
- Balasubramanian Sivan (Google Research) — Approximately Efficient Bilateral Trade
- Ola Svensson (École Polytechnique Fédérale de Lausanne) — Flow Time Scheduling and Prefix Beck-Fiala
- Nicole Wein (Rutgers University) — Online List Labeling: Breaking the log^2(n) Barrier
- Andreas Wiese (Technical University Munich) — A PTAS for Unsplittable Flow on a Path