Abstract is missing.
- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman ProblemHyung-Chan An, Robert D. Kleinberg, David B. Shmoys. 1-11 [doi]
- Improved Inapproximability for Submodular MaximizationPer Austrin. 12-24 [doi]
- Approximation Algorithms for the Directed k-Tour and k-Stroll ProblemsMohammadHossein Bateni, Julia Chuzhoy. 25-38 [doi]
- Submodular Secretary Problem and ExtensionsMohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam. 39-52 [doi]
- Approximation Algorithms for Min-Max Generalization ProblemsPiotr Berman, Sofya Raskhodnikova. 53-66 [doi]
- Min-Power Strong ConnectivityGruia Calinescu. 67-80 [doi]
- The Complexity of Approximately Counting Stable MatchingsPrasad Chebolu, Leslie Ann Goldberg, Russell A. Martin. 81-94 [doi]
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar GraphsVictor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès. 95-109 [doi]
- Approximating Linear Threshold PredicatesMahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson. 110-123 [doi]
- Approximating Sparsest Cut in Graphs of Bounded TreewidthEden Chlamtac, Robert Krauthgamer, Prasad Raghavendra. 124-137 [doi]
- On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of ColorsIrit Dinur, Igor Shinkar. 138-151 [doi]
- Vertex Sparsifiers: New Results from Old TechniquesMatthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar. 152-165 [doi]
- PTAS for Weighted Set Cover on Unit SquaresThomas Erlebach, Erik Jan van Leeuwen. 166-177 [doi]
- Improved Lower Bounds for the Universal and ::::a priori:::: TSPIgor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer. 178-191 [doi]
- Proximity Algorithms for Nearly-Doubling SpacesLee-Ad Gottlieb, Robert Krauthgamer. 192-204 [doi]
- Matrix Sparsification and the Sparse Null Space ProblemLee-Ad Gottlieb, Tyler Neylon. 205-218 [doi]
- The Checkpoint ProblemMohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre. 219-231 [doi]
- The Euclidean Distortion of Flat ToriIshay Haviv, Oded Regev. 232-245 [doi]
- Online EmbeddingsPiotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias. 246-259 [doi]
- Approximation Algorithms for Intersection GraphsFrank Kammer, Torsten Tholey, Heiko Voepel. 260-273 [doi]
- An ::::O::::(log::::n::::)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar GraphsKen-ichi Kawarabayashi, Yusuke Kobayashi. 274-286 [doi]
- Improved Algorithm for the Half-Disjoint Paths ProblemKen-ichi Kawarabayashi, Yusuke Kobayashi. 287-297 [doi]
- Approximate Lasserre Integrality Gap for Unique GamesSubhash Khot, Preyas Popat, Rishi Saket. 298-311 [doi]
- Exploiting Concavity in Bimatrix Games: New Polynomially Tractable SubclassesSpyros C. Kontogiannis, Paul G. Spirakis. 312-325 [doi]
- Maximum Flows on Disjoint PathsGuyslain Naves, Nicolas Sonnerat, Adrian Vetta. 326-337 [doi]
- Approximation Algorithms for Reliable Stochastic Combinatorial OptimizationEvdokia Nikolova. 338-351 [doi]
- How to Schedule When You Have to Buy Your EnergyKirk Pruhs, Clifford Stein. 352-365 [doi]
- Improving Integrality Gaps via Chvátal-Gomory RoundingMohit Singh, Kunal Talwar. 366-379 [doi]
- Uniform Derandomization from Pathetic Lower BoundsEric Allender, Vikraman Arvind, Fengming Wang. 380-393 [doi]
- Testing Boolean Function IsomorphismNoga Alon, Eric Blais. 394-405 [doi]
- Better Size Estimation for Sparse Matrix ProductsRasmus Resen Amossen, Andrea Campagna, Rasmus Pagh. 406-419 [doi]
- Low Rate Is Insufficient for Local TestabilityEli Ben-Sasson, Michael Viderman. 420-433 [doi]
- Reconstruction Threshold for the Hardcore ModelNayantara Bhatnagar, Allan Sly, Prasad Tetali. 434-447 [doi]
- Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure SpannersArnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff. 448-461 [doi]
- Monotonicity Testing and Shortest-Path Routing on the CubeJop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah. 462-475 [doi]
- Better Gap-Hamming Lower Bounds via Better Round EliminationJoshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf. 476-489 [doi]
- Propagation Connectivity of Random HypergraphsAmin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe. 490-503 [doi]
- Improved Pseudorandom Generators for Depth 2 CircuitsAnindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani. 504-517 [doi]
- The Structure of Winning Strategies in Parallel Repetition GamesIrit Dinur, Elazar Goldenberg. 518-530 [doi]
- Distribution-Free Testing Algorithms for Monomials with a Sublinear Number of QueriesElya Dolev, Dana Ron. 531-544 [doi]
- Periodicity in StreamsFunda Ergün, Hossein Jowhari, Mert Saglam. 545-559 [doi]
- Rumor Spreading on Random Regular Graphs and ExpandersNikolaos Fountoulakis, Konstantinos Panagiotou. 560-573 [doi]
- On Testing Computability by Small Width OBDDsOded Goldreich. 574-587 [doi]
- Liftings of Tree-Structured Markov Chains - (Extended Abstract)Thomas P. Hayes, Alistair Sinclair. 602-616 [doi]
- Constructive Proofs of Concentration BoundsRussell Impagliazzo, Valentine Kabanets. 617-631 [doi]
- Almost-Euclidean Subspaces of ::::l::::::1:::::::::N:::::::/ell_1^N via Tensor Products: A Simple Approach to Randomness ReductionPiotr Indyk, Stanislaw Szarek. 632-641 [doi]
- Testing Outerplanarity of Bounded Degree GraphsYuichi Yoshida, Hiro Ito. 642-655 [doi]
- Two-Source Extractors Secure against Quantum AdversariesRoy Kasher, Julia Kempe. 656-669 [doi]
- Locally Testable vs. Locally Decodable CodesTali Kaufman, Michael Viderman. 670-682 [doi]
- Two Theorems on List Decoding - (Extended Abstract)Atri Rudra, Steve Uurtamo. 696-709 [doi]
- Delaying Satisfiability for Random 2SATAlistair Sinclair, Dan Vilenchik. 710-723 [doi]
- Improved Rounding for Parallel Repeated Unique GamesDavid Steurer. 724-737 [doi]
- A Query Efficient Non-adaptive Long Code Test with Perfect CompletenessSuguru Tamaki, Yuichi Yoshida. 738-751 [doi]
- Relativized Worlds without Worst-Case to Average-Case Reductions for NPThomas Watson. 752-765 [doi]
- A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any FieldDavid P. Woodruff. 766-779 [doi]