Table of Contents

• When Are Welfare Guarantees Robust?Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák. [doi]
• Min-Cost Bipartite Perfect Matching with DelaysItai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul M. Makhijani, Yuyi Wang, Roger Wattenhofer. [doi]
• Traveling in Randomly Embedded Random GraphsAlan M. Frieze, Wesley Pegden. [doi]
• Locality via Partially Lifted CodesS. Luna Frank-Fischer, Venkatesan Guruswami, Mary Wootters. [doi]
• Efficient Removal Lemmas for MatricesNoga Alon, Omri Ben-Eliezer. [doi]
• Approximating Incremental Combinatorial Optimization ProblemsMichel X. Goemans, Francisco Unda. [doi]
• Renyi Entropy Estimation RevisitedMaciej Obremski, Maciej Skorski. [doi]
• On Some Computations on Sparse PolynomialsIlya Volkovich. [doi]
• On the Expansion of Group-Based LiftsNaman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, Vivek Madan. [doi]
• Efficiently Decodable Codes for the Binary Deletion ChannelVenkatesan Guruswami, Ray Li. [doi]
• Glauber Dynamics for Ising Model on Convergent Dense Graph SequencesRupam Acharyya, Daniel Stefankovic. [doi]
• Maximum Matching in Two, Three, and a Few More Passes Over Graph StreamsSagar Kale, Sumedh Tirodkar. [doi]
• Density Independent Algorithms for Sparsifying k-Step Random WalksGorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani. [doi]
• Streaming Periodicity with MismatchesFunda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou. [doi]
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard RegimeJess Banks, Robert Kleinberg, Cristopher Moore. [doi]
• Testing Hereditary Properties of SequencesCody R. Freitag, Eric Price, William J. Swartworth. [doi]
• On the Complexity of Constrained Determinantal Point ProcessesL. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi. [doi]
• Fractional Set Cover in the Streaming ModelPiotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, Anak Yodpinyanee. [doi]
• Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic TilingsSarah Cannon, David A. Levin, Alexandre Stauffer. [doi]
• Symmetric Interdiction for Matching ProblemsSamuel Haney, Bruce M. Maggs, Biswaroop Maiti, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram. [doi]
• The String of Diamonds Is Tight for Rumor SpreadingOmer Angel, Abbas Mehrabian, Yuval Peres. [doi]
• Vertex Isoperimetry and Independent Set Stability for Tensor Powers of CliquesJoshua Brakensiek. [doi]
• Frontmatter, Table of Contents, Preface, Organization, External Reviewers, List of Authors [doi]
• On Axis-Parallel Tests for Tensor Product CodesAlessandro Chiesa, Peter Manohar, Igor Shinkar. [doi]
• A PTAS for Three-Edge-Connected Survivable Network Design in Planar GraphsGlencora Borradaile, Baigong Zheng. [doi]
• Probabilistic Logarithmic-Space Algorithms for Laplacian SolversDean Doron, François Le Gall, Amnon Ta-Shma. [doi]
• The Quest for Strong Inapproximability Results with Perfect CompletenessJoshua Brakensiek, Venkatesan Guruswami. [doi]
• Sum-of-Squares Certificates for Maxima of Random Tensors on the SphereVijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee. [doi]
• Continuous Monitoring of l_p Norms in Data StreamsJaroslaw Blasiok, Jian Ding, Jelani Nelson. [doi]
• Stochastic Unsplittable FlowsAnupam Gupta, Archit Karandikar. [doi]
• Adaptivity Is Exponentially Powerful for Testing Monotonicity of HalfspacesXi Chen 0001, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten. [doi]
• A Lottery Model for Center-Type Problems with OutliersDavid G. Harris, Thomas Pensyl, Aravind Srinivasan, Khoa Trinh. [doi]
• Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional SpacesYuval Rabani, Rakesh Venkat. [doi]
• Cutoff for a Stratified Random Walk on the HypercubeAnna Ben-Hamou, Yuval Peres. [doi]
• Global and Fixed-Terminal Cuts in DigraphsKristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu. [doi]
• The Minrank of Random GraphsAlexander Golovnev, Oded Regev 0001, Omri Weinstein. [doi]
• Submodular Secretary Problems: Cardinality, Matching, and Linear ConstraintsThomas Kesselheim, Andreas Tönnis. [doi]
• Online Strip Packing with Polynomial MigrationKlaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig. [doi]
• Approximating Unique Games Using Low Diameter Graph DecompositionVedat Levi Alev, Lap Chi Lau. [doi]
• Agnostic Learning from Tolerant Natural ProofsMarco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. [doi]
• Sharper Bounds for Regularized Data FittingHaim Avron, Kenneth L. Clarkson, David P. Woodruff. [doi]
• Lower Bounds for 2-Query LCCs over Large AlphabetArnab Bhattacharyya, Sivakanth Gopi, Avishay Tal. [doi]
• Streaming Complexity of Approximating Max 2CSP and Max Acyclic SubgraphVenkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy. [doi]
• Sample-Based High-Dimensional Convexity TestingXi Chen 0001, Adam Freilich, Rocco A. Servedio, Timothy Sun. [doi]
• Scheduling Problems over Network of MachinesZachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang. [doi]
• On the Integrality Gap of the Prize-Collecting Steiner Forest LPJochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi 0001, Chaitanya Swamy, Jens Vygen. [doi]
• Communication Complexity of Statistical DistanceThomas Watson. [doi]
• Charting the Replica Symmetric PhaseAmin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, Tobias Kapetanopoulos. [doi]
• Greedy Minimization of Weakly Supermodular Set FunctionsEdo Liberty, Maxim Sviridenko. [doi]
• Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack ConstraintChien-Chung Huang, Naonori Kakimura, Yuichi Yoshida. [doi]