Abstract is missing.
- A New Point of NP-Hardness for 2-to-1 Label CoverPer Austrin, Ryan O'Donnell, John Wright. 1-12 [doi]
- Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout ProblemsPer Austrin, Toniann Pitassi, Yu Wu. 13-24 [doi]
- Additive Approximation for Near-Perfect Phylogeny ConstructionPranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet. 25-36 [doi]
- Improved Spectral-Norm Bounds for ClusteringPranjal Awasthi, Or Sheffet. 37-49 [doi]
- Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar GraphsPiotr Berman, Grigory Yaroslavtsev. 50-60 [doi]
- What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the GridPetros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss. 61-72 [doi]
- Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited SupplyParinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna. 73-84 [doi]
- Online Flow Time Scheduling in the Presence of Preemption OverheadHo-Leung Chan, Tak Wah Lam, Rongbin Li. 85-97 [doi]
- Prize-Collecting Survivable Network Design in Node-Weighted GraphsChandra Chekuri, Alina Ene, Ali Vakilian. 98-109 [doi]
- Approximating Minimum-Cost Connected T-JoinsJoseph Cheriyan, Zachary Friggstad, Zhihan Gao. 110-121 [doi]
- iBGP and Constrained ConnectivityMichael Dinitz, Gordon T. Wilfong. 122-133 [doi]
- Online Scheduling of Jobs with Fixed Start Times on Related MachinesLeah Epstein, Lukasz Jez, Jiri Sgall, Rob van Stee. 134-145 [doi]
- A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location ProblemsCristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa. 146-157 [doi]
- Approximating Bounded Occurrence Ordering CSPsVenkatesan Guruswami, Yuan Zhou. 158-169 [doi]
- On the NP-Hardness of Max-Not-2Johan Håstad. 170-181 [doi]
- The Remote Set Problem on LatticesIshay Haviv. 182-193 [doi]
- Approximation Algorithms for Generalized and Variable-Sized Bin CoveringMatthias Hellwig, Alexander Souza. 194-205 [doi]
- Approximating Minimum Linear Ordering ProblemsSatoru Iwata, Prasad Tetali, Pushkar Tripathi. 206-217 [doi]
- New Approximation Results for Resource Replication ProblemsSamir Khuller, Barna Saha, Kanthi K. Sarpatwar. 218-230 [doi]
- Maximum Matching in Semi-streaming with Few PassesChristian Konrad, Frédéric Magniez, Claire Mathieu. 231-242 [doi]
- Improved Inapproximability for TSPMichael Lampis. 243-253 [doi]
- Approximation Algorithm for Non-boolean MAX k-CSPKonstantin Makarychev, Yury Makarychev. 254-265 [doi]
- Planarizing an Unknown SurfaceYury Makarychev, Anastasios Sidiropoulos. 266-275 [doi]
- The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-CoverDana Moshkovitz. 276-287 [doi]
- New and Improved Bounds for the Minimum Set Cover ProblemRishi Saket, Maxim Sviridenko. 288-300 [doi]
- Hardness of Vertex Deletion and Project SchedulingOla Svensson. 301-312 [doi]
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher EigenvaluesSuguru Tamaki, Yuichi Yoshida. 313-324 [doi]
- Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract)Cenny Wenner. 325-337 [doi]
- Spectral Norm of Symmetric FunctionsAnil Ada, Omar Fawzi, Hamed Hatami. 338-349 [doi]
- Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group ActionsNoga Alon, Shachar Lovett. 350-361 [doi]
- Testing Permanent Oracles - RevisitedSanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran, Sushant Sachdeva. 362-373 [doi]
- Limitations of Local Filters of Lipschitz and Monotone FunctionsPranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova. 374-386 [doi]
- Testing Lipschitz Functions on Hypergrid DomainsPranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova. 387-398 [doi]
- Extractors for Polynomials Sources over Constant-Size Fields of Small CharacteristicEli Ben-Sasson, Ariel Gabizon. 399-410 [doi]
- Multiple-Choice Balanced Allocation in (Almost) ParallelPetra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel. 411-422 [doi]
- Optimal Hitting Sets for Combinatorial ShapesAditya Bhaskara, Devendra Desai, Srikanth Srinivasan. 423-434 [doi]
- Tight Bounds for Testing k-LinearityEric Blais, Daniel M. Kane. 435-446 [doi]
- Pseudorandomness for Linear Length Branching Programs and Stack MachinesAndrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan. 447-458 [doi]
- A Discrepancy Lower Bound for Information ComplexityMark Braverman, Omri Weinstein. 459-470 [doi]
- On the Coin Weighing Problem with the Presence of NoiseNader H. Bshouty. 471-482 [doi]
- Information Complexity versus Corruption and Applications to Orthogonality and Gap-HammingAmit Chakrabarti, Ranganath Kondapally, Zhenghui Wang. 483-494 [doi]
- An Explicit VC-Theorem for Low-Degree PolynomialsEshan Chattopadhyay, Adam Klivans, Pravesh Kothari. 495-504 [doi]
- Tight Bounds on the Threshold for Permuted k-ColorabilityVarsha Dani, Cristopher Moore, Anna Olson. 505-516 [doi]
- Sparse and Lopsided Set Disjointness via Information TheoryAnirban Dasgupta, Ravi Kumar, D. Sivakumar. 517-528 [doi]
- Maximal Empty Boxes Amidst Random PointsAdrian Dumitrescu, Minghui Jiang. 529-540 [doi]
- Rainbow Connectivity of Sparse Random GraphsAlan M. Frieze, Charalampos E. Tsourakakis. 541-552 [doi]
- Invertible Zero-Error Dispersers and Defective Memory with Stuck-At ErrorsAriel Gabizon, Ronen Shaltiel. 553-564 [doi]
- Two-Sided Error Proximity Oblivious Testing - (Extended Abstract)Oded Goldreich, Igor Shinkar. 565-578 [doi]
- Mirror Descent Based Database PrivacyPrateek Jain 0002, Abhradeep Thakurta. 579-590 [doi]
- Analysis of k-Means++ for Separable DataRagesh Jaiswal, Nitin Garg. 591-602 [doi]
- A Sharper Local Lemma with Improved ApplicationsKashyap Babu Rao Kolipaka, Mario Szegedy, Yixin Xu. 603-614 [doi]
- Finding Small Sparse Cuts by Random WalkTsz Chiu Kwok, Lap Chi Lau. 615-626 [doi]
- On Deterministic Sketching and Streaming for Sparse Recovery and Norm EstimationJelani Nelson, Huy L. Nguyên, David P. Woodruff. 627-638 [doi]
- A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codesNoga Ron-Zewi, Madhu Sudan. 639-650 [doi]
- A Combination of Testability and Decodability by Tensor ProductsMichael Viderman. 651-662 [doi]
- Extractors for Turing-Machine SourcesEmanuele Viola. 663-671 [doi]