Table of Contents

• An ~O(n) Queries Adaptive Tester for UnatenessSubhash Khot, Igor Shinkar. [doi]
• Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than OneNoah Stephens-Davidowitz. [doi]
• Proving Weak Approximability Without AlgorithmsRidwan Syed, Madhur Tulsiani. [doi]
• Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin SystemsHeng Guo, Pinyan Lu. [doi]
• On Polynomial Approximations to AC^0Prahladh Harsha, Srikanth Srinivasan. [doi]
• Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable GraphsDániel Marx, Ario Salmasi, Anastasios Sidiropoulos. [doi]
• Every Property of Outerplanar Graphs is TestableJasine Babu, Areej Khoury, Ilan Newman. [doi]
• Belief Propagation on Replica Symmetric Random Factor Graph ModelsAmin Coja-Oghlan, Will Perkins. [doi]
• On the Beck-Fiala Conjecture for Random Set SystemsEsther Ezra, Shachar Lovett. [doi]
• Lower Bounds for CSP Refutation by SDP HierarchiesRyuhei Mori, David Witmer. [doi]
• Approximating Subadditive Hadamard Functions on Implicit MatricesVladimir Braverman, Alan Roytman, Gregory Vorsanger. [doi]
• Sampling in Potts Model on Sparse Random GraphsYitong Yin, Chihao Zhang. [doi]
• Online Row SamplingMichael B. Cohen, Cameron Musco, Jakub W. Pachocki. [doi]
• Stable Matching with Evolving PreferencesVarun Kanade, Nikos Leonardos, Frédéric Magniez. [doi]
• Bounds on the Norms of Uniform Low Degree Graph MatricesDhruv Medarametla, Aaron Potechin. [doi]
• Bounded Independence vs. ModuliRavi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola. [doi]
• A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope ConstraintsSungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala. [doi]
• A Robust and Optimal Online Algorithm for Minimum Metric Bipartite MatchingSharath Raghvendra. [doi]
• The Densest k-Subhypergraph ProblemEden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca. [doi]
• Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded ChannelsRonen Shaltiel, Jad Silbak. [doi]
• LP-Relaxations for Tree AugmentationGuy Kortsarz, Zeev Nutov. [doi]
• On Approximating Target Set SelectionMoses Charikar, Yonatan Naamad, Anthony Wirth. [doi]
• A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made EasyNir Halman. [doi]
• Approximation Algorithms for Parallel Machine Scheduling with Speed-up ResourcesLin Chen 0011, Deshi Ye, Guochuan Zhang. [doi]
• On the Structure of Quintic PolynomialsPooya Hatami. [doi]
• Computing Approximate PSD FactorizationsAmitabh Basu, Michael Dinitz, Xin Li 0006. [doi]
• Revisiting Connected Dominating Sets: An Optimal Local Algorithm?Samir Khuller, Sheng Yang. [doi]
• The Niceness of Unique Sink OrientationsBernd Gärtner, Antonis Thomas. [doi]
• Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p SpacesArturs Backurs, Anastasios Sidiropoulos. [doi]
• Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace EmbeddingsYi Li, David P. Woodruff. [doi]
• Counting Hypergraph Matchings up to Uniqueness ThresholdRenjie Song, Yitong Yin, Jinman Zhao. [doi]
• Lower Bounds on Same-Set Inner Product in Correlated SpacesJan Hazla, Thomas Holenstein, Elchanan Mossel. [doi]
• Online Energy Storage Management: an Algorithmic ApproachAnthony Kim, Vahid Liaghat, Junjie Qin, Amin Saberi. [doi]
• Oblivious Rounding and the Integrality GapUriel Feige, Michal Feldman, Inbal Talgam-Cohen. [doi]
• Towards a Constructive Version of Banaszczyk's Vector Balancing TheoremDaniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov. [doi]
• Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors [doi]
• A Local Algorithm for Constructing Spanners in Minor-Free GraphsReut Levi, Dana Ron, Ronitt Rubinfeld. [doi]
• Near-Optimal UGC-hardness of Approximating Max k-CSP_RPasin Manurangsi, Preetum Nakkiran, Luca Trevisan. [doi]
• On Higher-Order Fourier Analysis over Non-Prime FieldsArnab Bhattacharyya, Abhishek Bhowmick, Chetan Gupta. [doi]
• A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-KilianDana Moshkovitz, Govind Ramnarayan, Henry Yuen. [doi]
• Local Convergence and Stability of Tight Bridge-Addable Graph ClassesGuillaume Chapuy, Guillem Perarnau. [doi]
• Planar Matching in Streams RevisitedAndrew McGregor, Sofya Vorotnikova. [doi]
• Estimating Parameters Associated with Monotone PropertiesCarlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni. [doi]
• A Direct-Sum Theorem for Read-Once Branching ProgramsAnup Rao, Makrand Sinha. [doi]
• The Condensation Phase Transition in the Regular k-SAT ModelVictor Bapst, Amin Coja-Oghlan. [doi]
• A Bi-Criteria Approximation Algorithm for k-MeansKonstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward. [doi]
• Hardness of Approximation for H-Free Edge Modification ProblemsIvan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk. [doi]
• Fast Synchronization of Random AutomataCyril Nicaud. [doi]