Table of Contents

• Local Search: Simple, Successful, But Sometimes SluggishBurkhard Monien, Dominic Dumrauf, Tobias Tscheuschner. 1-17 [doi]
• When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and SatisfiabilityEmo Welzl. 18 [doi]
• Plane Spanners of Maximum Degree SixNicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. 19-30 [doi]
• The Positive Semidefinite Grothendieck Problem with Rank ConstraintJop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin. 31-42 [doi]
• Cycle Detection and CorrectionAmihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira. 43-54 [doi]
• Decomposition Width of MatroidsDaniel Král. 55-66 [doi]
• The Cooperative Game Theory Foundations of Network Bargaining GamesMohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini. 67-78 [doi]
• On the Existence of Pure Nash Equilibria in Weighted Congestion GamesTobias Harks, Max Klimm. 79-89 [doi]
• On the Limitations of Greedy Mechanism Design for Truthful Combinatorial AuctionsAllan Borodin, Brendan Lucier. 90-101 [doi]
• Mean-Payoff Games and Propositional ProofsAlbert Atserias, Elitza N. Maneva. 102-113 [doi]
• Online Network Design with OutliersAris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski. 114-126 [doi]
• Efficient Completely Non-malleable Public Key EncryptionBenoît Libert, Moti Yung. 127-139 [doi]
• Polynomial-Space Approximation of No-Signaling ProversTsuyoshi Ito. 140-151 [doi]
• From Secrecy to Soundness: Efficient Verification via Secure ComputationBenny Applebaum, Yuval Ishai, Eyal Kushilevitz. 152-163 [doi]
• Mergeable DictionariesJohn Iacono, Özgür Özkan. 164-175 [doi]
• Faster Algorithms for Semi-matching Problems (Extended Abstract)Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai. 176-187 [doi]
• Clustering with DiversityJian Li, Ke Yi, Qin Zhang. 188-200 [doi]
• New Data Structures for Subgraph ConnectivityRan Duan. 201-212 [doi]
• Tight Thresholds for Cuckoo Hashing via XORSATMartin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink. 213-225 [doi]
• Resource Oblivious Sorting on MulticoresRichard Cole, Vijaya Ramachandran. 226-237 [doi]
• Interval SortingRosa M. Jiménez, Conrado Martínez. 238-249 [doi]
• Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling ProblemsNikhil Bansal, Subhash Khot. 250-261 [doi]
• Thresholded Covering Algorithms for Robust and Max-min OptimizationAnupam Gupta, Viswanath Nagarajan, R. Ravi. 262-274 [doi]
• Graph Homomorphisms with Complex Values: A Dichotomy TheoremJin-yi Cai, Xi Chen, Pinyan Lu. 275-286 [doi]
• Metrical Task Systems and the ::::k::::-Server Problem on HSTsNikhil Bansal, Niv Buchbinder, Joseph Naor. 287-298 [doi]
• Scheduling Periodic Tasks in a Hard Real-Time EnvironmentFriedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese. 299-311 [doi]
• Scalably Scheduling Power-Heterogeneous ProcessorsAnupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs. 312-323 [doi]
• Better Scalable Algorithms for Broadcast SchedulingNikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan. 324-335 [doi]
• Max-min Online Allocations with a Reordering BufferLeah Epstein, Asaf Levin, Rob van Stee. 336-347 [doi]
• Orientability of Random Hypergraphs and the Power of Multiple ChoicesNikolaos Fountoulakis, Konstantinos Panagiotou. 348-359 [doi]
• On the Inapproximability of Vertex Cover on ::::k::::-Partite ::::k::::-Uniform HypergraphsVenkatesan Guruswami, Rishi Saket. 360-371 [doi]
• Dynamic Programming for Graphs on SurfacesJuanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. 372-383 [doi]
• Interval Graphs: Canonical Representation in LogspaceJohannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky. 384-395 [doi]
• Approximating the Partition Function of the Ferromagnetic Potts ModelLeslie Ann Goldberg, Mark Jerrum. 396-407 [doi]
• On the Relation between Polynomial Identity Testing and Finding Variable Disjoint FactorsAmir Shpilka, Ilya Volkovich. 408-419 [doi]
• On Sums of Roots of UnityBruce E. Litow. 420-425 [doi]
• Exponential Time Complexity of the Permanent and the Tutte PolynomialHolger Dell, Thore Husfeldt, Martin Wahlen. 426-437 [doi]
• On Approximate Horn Formula MinimizationAmitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán. 438-450 [doi]
• Choosing, Agreeing, and Eliminating in Communication ComplexityAmos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb. 451-462 [doi]
• Additive Spanners in Nearly Quadratic TimeDavid P. Woodruff. 463-474 [doi]
• Composition Theorems in Communication ComplexityTroy Lee, Shengyu Zhang. 475-489 [doi]
• Network Design via Core Detouring for Problems without a CoreFabrizio Grandoni, Thomas Rothvoß. 490-502 [doi]
• Weak Completeness Notions for Exponential TimeKlaus Ambos-Spies, Timur Bakibayev. 503-514 [doi]
• Efficient Evaluation of Nondeterministic Automata Using Factorization ForestsMikolaj Bojanczyk, Pawel Parys. 515-526 [doi]
• On the Complexity of Searching in Trees: Average-Case MinimizationTobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro. 527-539 [doi]
• Finding Is as Easy as Detecting for Quantum WalksHari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland. 540-551 [doi]
• Testing Non-uniform ::::k::::-Wise Independent Distributions over Product SpacesRonitt Rubinfeld, Ning Xie. 565-581 [doi]
• A Sublogarithmic Approximation for Highway and Tollbooth PricingIftah Gamzu, Danny Segev. 582-593 [doi]
• Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation AlgorithmKonstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko. 594-604 [doi]
• Cell Probe Lower Bounds and Approximations for Range ModeMark Greve, Allan Grønlund Jørgensen, Kasper Dalgaard Larsen, Jakob Truelsen. 605-616 [doi]
• SDP Gaps for 2-to-1 and Other Label-Cover VariantsVenkatesan Guruswami, Subhash Khot, Ryan O Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu. 617-628 [doi]
• Data Stream Algorithms for Codeword TestingAtri Rudra, Steve Uurtamo. 629-640 [doi]
• Streaming Algorithms for Independent SetsBjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy. 641-652 [doi]
• Preprocessing of Min Ones Problems: A DichotomyStefan Kratsch, Magnus Wahlström. 653-665 [doi]
• Holographic Reduction: A Domain Changed Application and Its Partial Converse TheoremsMingji Xia. 666-677 [doi]
• Optimal Trade-Offs for Succinct String IndexesRoberto Grossi, Alessio Orlandi, Rajeev Raman. 678-689 [doi]
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP ProblemsAnupam Gupta, Viswanath Nagarajan, R. Ravi. 690-701 [doi]
• Concurrent Knowledge Extraction in the Public-Key ModelAndrew Chi-Chih Yao, Moti Yung, Yunlei Zhao. 702-714 [doi]
• On the ::::k::::-Independence Required by Linear Probing and Minwise IndependenceMihai Patrascu, Mikkel Thorup. 715-726 [doi]
• Covering and Packing in Linear SpaceAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. 727-737 [doi]
• Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint ::::s::::-::::t:::: Paths in DigraphsLoukas Georgiadis. 738-749 [doi]