Abstract is missing.
- New Tools for Graph ColoringSanjeev Arora, Rong Ge. 1-12 [doi]
- Inapproximability of NP-Complete Variants of Nash EquilibriumPer Austrin, Mark Braverman, Eden Chlamtac. 13-25 [doi]
- Sparse Recovery with Partial Support KnowledgeKhanh Do Ba, Piotr Indyk. 26-37 [doi]
- On Capacitated Set Cover ProblemsNikhil Bansal, Ravishankar Krishnaswamy, Barna Saha. 38-49 [doi]
- Bandwidth and Low Dimensional EmbeddingYair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman. 50-61 [doi]
- O(1)-Approximations for Maximum Movement ProblemsPiotr Berman, Erik D. Demaine, Morteza Zadimoghaddam. 62-74 [doi]
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPsAnand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna. 75-86 [doi]
- Social Welfare in One-Sided Matching Markets without MoneyAnand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna. 87-98 [doi]
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing ProblemTim Carnes, David B. Shmoys. 99-110 [doi]
- Scheduling Resources for Throughput MaximizationVenkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal. 111-122 [doi]
- Coloring and Maximum Independent Set of RectanglesParinya Chalermsook. 123-134 [doi]
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling ProblemsMaurice Cheung, David B. Shmoys. 135-146 [doi]
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant RadiusNachshon Cohen, Zeev Nutov. 147-157 [doi]
- Periodicity and Cyclic Shifts via Linear SketchesMichael S. Crouch, Andrew McGregor. 158-170 [doi]
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal GraphsFeodor F. Dragan, Ekkehard Köhler. 171-183 [doi]
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector OracleChandan K. Dubey, Thomas Holenstein. 184-193 [doi]
- Opaque SetsAdrian Dumitrescu, Minghui Jiang, János Pach. 194-205 [doi]
- Exploring and Triangulating a Region by a Swarm of RobotsSándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt. 206-217 [doi]
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)Moran Feldman, Joseph Naor, Roy Schwartz. 218-229 [doi]
- Locating Depots for Capacitated Vehicle RoutingInge Li Gørtz, Viswanath Nagarajan. 230-241 [doi]
- Satisfying Degree-d Equations over GF[2] nJohan Håstad. 242-253 [doi]
- Black-Box Reductions in Mechanism DesignZhiyi Huang, Lei Wang, Yuan Zhou. 254-265 [doi]
- Multiplicative Approximations of Random Walk Transition ProbabilitiesMichael Kapralov, Rina Panigrahy. 266-276 [doi]
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking ProblemsMarek Karpinski, Warren Schudy. 277-288 [doi]
- Network-Design with Degree ConstraintsRohit Khandekar, Guy Kortsarz, Zeev Nutov. 289-301 [doi]
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover ProblemsM. Reza Khani, Mohammad R. Salavatipour. 302-314 [doi]
- Algorithmic Extensions of Cheeger s Inequality to Higher Eigenvalues and PartitionsAnand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala. 315-326 [doi]
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite HypergraphsSushant Sachdeva, Rishi Saket. 327-338 [doi]
- A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled InputsSagi Snir, Raphael Yuster. 339-350 [doi]
- Viral Processes by Random Walks on Random Regular GraphsMohammed Abdullah, Colin Cooper, Moez Draief. 351-364 [doi]
- Quantum Property Testing for Bounded-Degree GraphsAndris Ambainis, Andrew M. Childs, Yi-Kai Liu. 365-376 [doi]
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness AmplificationSergei Artemenko, Ronen Shaltiel. 377-388 [doi]
- Testing Graph Blow-UpLidor Avigad, Oded Goldreich. 389-399 [doi]
- On Sums of Locally Testable Affine Invariant PropertiesEli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan. 400-411 [doi]
- Limits on the Rate of Locally Testable Affine-Invariant CodesEli Ben-Sasson, Madhu Sudan. 412-423 [doi]
- The Computational Complexity of Estimating MCMC Convergence TimeNayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel. 424-435 [doi]
- Streaming Algorithms with One-Sided EstimationJoshua Brody, David P. Woodruff. 436-447 [doi]
- Everywhere-Tight Information Cost Tradeoffs for Augmented IndexAmit Chakrabarti, Ranganath Kondapally. 448-459 [doi]
- A Canonical Form for Testing Boolean Function PropertiesDana Dachman-Soled, Rocco A. Servedio. 460-471 [doi]
- Independent Sets in Random Graphs from the Weighted Second Moment MethodVarsha Dani, Cristopher Moore. 472-482 [doi]
- Extractors and Lower Bounds for Locally Samplable SourcesAnindya De, Thomas Watson. 483-494 [doi]
- A Deterministic Algorithm for the Frieze-Kannan Regularity LemmaDomingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira. 495-506 [doi]
- Dense Locally Testable Codes Cannot Have Constant Rate and DistanceIrit Dinur, Tali Kaufman. 507-518 [doi]
- Efficient Probabilistically Checkable DebatesAndrew Drucker. 519-529 [doi]
- An Efficient Partitioning Oracle for Bounded-Treewidth GraphsAlan Edelman, Avinatan Hassidim, Huy N. Nguyen, Krzysztof Onak. 530-541 [doi]
- Inflatable Graph Properties and Natural Property TestsEldar Fischer, Eyal Rozenberg. 542-554 [doi]
- Fast Simulation of Large-Scale Growth ModelsTobias Friedrich, Lionel Levine. 555-566 [doi]
- Improved Inapproximability Results for Counting Independent Sets in the Hard-Core ModelAndreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang. 567-578 [doi]
- Proximity Oblivious Testing and the Role of InvariancesOded Goldreich, Tali Kaufman. 579-592 [doi]
- Optimal Rate List Decoding via Derivative CodesVenkatesan Guruswami, Carol Wang. 593-604 [doi]
- Public Key Locally Decodable Codes with Short KeysBrett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters. 605-615 [doi]
- On Sampling from Multivariate DistributionsZhiyi Huang, Sampath Kannan. 616-627 [doi]
- Almost Optimal Explicit Johnson-Lindenstrauss FamiliesDaniel M. Kane, Raghu Meka, Jelani Nelson. 628-639 [doi]
- Correlation Bounds for Poly-size /mbox{/rm AC}^0 Circuits with n 1 - o(1) Symmetric GatesShachar Lovett, Srikanth Srinivasan. 640-651 [doi]
- Clustering in Interfering Binary MixturesSarah Miracle, Dana Randall, Amanda Pascoe Streib. 652-663 [doi]
- Approximating the Influence of Monotone Boolean Functions in O(/sqrt{n}) Query ComplexityDana Ron, Ronitt Rubinfeld, Muli Safra, Omri Weinstein. 664-675 [doi]
- On Approximating the Number of Relevant Variables in a FunctionDana Ron, Gilad Tsur. 676-687 [doi]
- Query Complexity in Errorless Hardness AmplificationThomas Watson. 688-699 [doi]