Abstract is missing.
- Frontmatter, Table of Contents, Preface, Conference OrganizationKlaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore. [doi]
- Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) BarrierIttai Abraham, Shiri Chechik, Kunal Talwar. 1-16 [doi]
- Approximation Algorithms for Minimum-Load k-Facility LocationSara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy. 17-33 [doi]
- The Cover Number of a Matrix and its Algorithmic ApplicationsNoga Alon, Troy Lee, Adi Shraibman. 34-47 [doi]
- Network Design with Coverage CostsSiddharth Barman, Shuchi Chawla, Seeun Umboh. 48-63 [doi]
- Online Set Cover with Set RequestsKshipra Bhawalkar, Sreenivas Gollapudi, Debmalya Panigrahi. 64-79 [doi]
- Lowest Degree k-Spanner: Approximation and HardnessEden Chlamtác, Michael Dinitz. 80-95 [doi]
- Improved Streaming Algorithms for Weighted Matching, via Unweighted MatchingMichael Crouch, Daniel Stubbs. 96-104 [doi]
- Guruswami-Sinop Rounding without Higher Level LasserreAmit Deshpande, Rakesh Venkat. 105-114 [doi]
- Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform WeightsMichael Dinitz, Guy Kortsarz, Zeev Nutov. 115-127 [doi]
- Computing Opaque Interior Barriers à la ShermerAdrian Dumitrescu, Minghui Jiang, Csaba D. Tóth. 128-143 [doi]
- Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring ConjectureAlina Ene, Jan Vondrák. 144-159 [doi]
- Constrained Monotone Function Maximization and the Supermodular DegreeMoran Feldman, Rani Izsak. 160-175 [doi]
- On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner TreeAndreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità. 176-191 [doi]
- Reaching Consensus via Non-Bayesian Asynchronous Learning in Social NetworksMichal Feldman, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg. 192-208 [doi]
- Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing ProblemTakuro Fukunaga, Afshin Nikzad, R. Ravi. 209-225 [doi]
- Complexity and Approximation of the Continuous Network Design ProblemMartin Gairing, Tobias Harks, Max Klimm. 226-241 [doi]
- Approximate Pure Nash Equilibria in Weighted Congestion GamesChristoph Hansknecht, Max Klimm, Alexander Skopalik. 242-257 [doi]
- Discrepancy Without Partial ColoringsNicholas J. A. Harvey, Roy Schwartz, Mohit Singh. 258-273 [doi]
- Universal Factor Graphs for Every NP-Hard Boolean CSPShlomo Jozeph. 274-283 [doi]
- A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite GraphsJeremy Karp, R. Ravi. 284-296 [doi]
- Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility LocationStavros G. Kolliopoulos, Yannis Moysoglou. 297-312 [doi]
- Lower Bounds on Expansions of Graph PowersTsz Chiu Kwok, Lap Chi Lau. 313-324 [doi]
- An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median ProblemShanfei Li. 325-338 [doi]
- Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex ExpansionAnand Louis, Yury Makarychev. 339-355 [doi]
- Robust Appointment SchedulingShashi Mittal, Andreas S. Schulz, Sebastian Stiller. 356-370 [doi]
- Computational Complexity of Certifying Restricted Isometry PropertyAbhiram Natarajan, Yi Wu. 371-380 [doi]
- Gap Amplification for Small-Set Expansion via Random WalksPrasad Raghavendra, Tselil Schramm. 381-391 [doi]
- Power of Preemption on Uniform Parallel MachinesAlan J. Soper, Vitaly A. Strusevich. 392-402 [doi]
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and ApplicationsChaitanya Swamy. 403-418 [doi]
- Robust Approximation of Temporal CSPSuguru Tamaki, Yuichi Yoshida. 419-432 [doi]
- Parity is Positively UselessCenny Wenner. 433-448 [doi]
- The Condensation Phase Transition in Random Graph ColoringVictor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, Dan Vilenchik. 449-464 [doi]
- The Information Complexity of Hamming DistanceEric Blais, Joshua Brody, Badih Ghazi. 465-489 [doi]
- An Approximate Version of the Tree Packing Conjecture via Random EmbeddingsJulia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz. 490-499 [doi]
- On Sharp Thresholds in Random Geometric GraphsMilan Bradonjic, Will Perkins. 500-514 [doi]
- Average Case Polyhedral Complexity of the Maximum Stable Set ProblemGábor Braun, Samuel Fiorini, Sebastian Pokutta. 515-530 [doi]
- An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) BitsVladimir Braverman, Jonathan Katzman, Charles Seidell, Gregory Vorsanger. 531-544 [doi]
- Certifying Equality With Limited InteractionJoshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev. 545-581 [doi]
- #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness RegionJin-yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda. 582-595 [doi]
- The Power of Super-logarithmic Number of PlayersArkadev Chattopadhyay, Michael E. Saks. 596-603 [doi]
- On Reconstructing a Hidden PermutationFlavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi. 604-617 [doi]
- Two Sides of the Coin ProblemGil Cohen, Anat Ganor, Ran Raz. 618-629 [doi]
- Absorption Time of the Moran ProcessJosep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna. 630-642 [doi]
- Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime PowerChandan K. Dubey, Thomas Holenstein. 643-653 [doi]
- Unidirectional Input/Output Streaming Complexity of Reversal and SortingNathanaël François, Rahul Jain, Frédéric Magniez. 654-668 [doi]
- Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix MultiplicationHu Fu, Robert D. Kleinberg. 669-676 [doi]
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related ResultsAndreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang. 677-691 [doi]
- Space Pseudorandom Generators by Communication Complexity Lower BoundsAnat Ganor, Ran Raz. 692-703 [doi]
- On Multiple Input Problems in Property TestingOded Goldreich. 704-720 [doi]
- Communication Complexity of Set-Disjointness for All ProbabilitiesMika Göös, Thomas Watson. 721-736 [doi]
- List Decoding Group Homomorphisms Between Supersolvable GroupsAlan Guo, Madhu Sudan. 737-747 [doi]
- Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric CodesVenkatesan Guruswami, Carol Wang. 748-761 [doi]
- Exchangeability and Realizability: De Finetti Theorems on GraphsT. S. Jayram, Jan Vondrák. 762-778 [doi]
- Global and Local Information in Clustering Labeled Block ModelsVarun Kanade, Elchanan Mossel, Tselil Schramm. 779-792 [doi]
- Embedding Hard Learning Problems Into Gaussian SpaceAdam R. Klivans, Pravesh Kothari. 793-809 [doi]
- Smoothed Analysis on Connected GraphsMichael Krivelevich, Daniel Reichman, Wojciech Samotij. 810-825 [doi]
- Local Algorithms for Sparse Spanning GraphsReut Levi, Dana Ron, Ronitt Rubinfeld. 826-842 [doi]
- The Complexity of Ferromagnetic Two-spin Systems with External FieldsJingcheng Liu, Pinyan Lu, Chihao Zhang. 843-856 [doi]
- It's a Small World for Random SurfersAbbas Mehrabian, Nick Wormald. 857-871 [doi]
- Deterministic Coupon Collection and Better Strong DispersersRaghu Meka, Omer Reingold, Yuan Zhou. 872-884 [doi]
- Pseudorandomness and Fourier Growth Bounds for Width-3 Branching ProgramsThomas Steinke, Salil P. Vadhan, Andrew Wan. 885-899 [doi]