Table of Contents

• Graph Structure and Monadic Second-Order Logic: Language Theoretical AspectsBruno Courcelle. 1-13 [doi]
• Internet Ad Auctions: Insights and DirectionsS. Muthukrishnan. 14-23 [doi]
• The Complexity of Boolean Formula MinimizationDavid Buchfuhrer, Christopher Umans. 24-35 [doi]
• Optimal Cryptographic Hardness of Learning Monotone FunctionsDana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee. 36-47 [doi]
• On Berge Multiplication for Monotone Boolean DualizationEndre Boros, Khaled M. Elbassioni, Kazuhisa Makino. 48-59 [doi]
• Diagonal Circuit Identity Testing and Lower BoundsNitin Saxena. 60-71 [doi]
• Cell-Probe Proofs and Nondeterministic Cell-Probe ComplexityYitong Yin. 72-83 [doi]
• Constructing Efficient Dictionaries in Close to Sorting TimeMilan Ruzic. 84-95 [doi]
• On List Update with Locality of ReferenceSusanne Albers, Sonja Lauer. 96-107 [doi]
• A New Combinatorial Approach for Sparse Graph ProblemsGuy E. Blelloch, Virginia Vassilevska, Ryan Williams. 108-120 [doi]
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)Chen Avin, Michal Koucký, Zvi Lotker. 121-132 [doi]
• Networks Become Navigable as Nodes Move and ForgetAugustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar. 133-144 [doi]
• Fast Distributed Computation of Cuts Via Random CirculationsDavid Pritchard. 145-160 [doi]
• Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected TimePrasad Chebolu, Alan M. Frieze, Páll Melsted. 161-172 [doi]
• Function Evaluation Via Linear Programming in the Priced Information ModelFerdinando Cicalese, Eduardo Sany Laber. 173-185 [doi]
• Improved Approximation Algorithms for Budgeted AllocationsYossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen. 186-197 [doi]
• The Travelling Salesman Problem in Bounded Degree GraphsAndreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. 198-209 [doi]
• Treewidth Computation and Extremal CombinatoricsFedor V. Fomin, Yngve Villanger. 210-221 [doi]
• Fast Scheduling of Weighted Unit Jobs with Release Times and DeadlinesC. Greg Plaxton. 222-233 [doi]
• Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2Klaus Jansen, Ralf Thöle. 234-245 [doi]
• A PTAS for Static Priority Real-Time Scheduling with Resource AugmentationFriedrich Eisenbrand, Thomas Rothvoß. 246-257 [doi]
• Optimal Monotone EncodingsNoga Alon, Rani Hod. 258-270 [doi]
• Polynomial-Time Construction of Linear Network CodingKazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita. 271-282 [doi]
• Complexity of Decoding Positive-Rate Reed-Solomon CodesQi Cheng, Daqing Wan. 283-293 [doi]
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. 294-305 [doi]
• The Randomized Coloring Procedure with Symmetry-BreakingSriram Pemmaraju, Aravind Srinivasan. 306-319 [doi]
• The Local Nature of List Colorings for Graphs of High GirthFlavio Chierichetti, Andrea Vattani. 320-332 [doi]
• Approximating List-Coloring on a Fixed SurfaceKen-ichi Kawarabayashi. 333-344 [doi]
• Asymptotically Optimal Hitting Sets Against PolynomialsMarkus Bläser, Moritz Hardt, David Steurer. 345-356 [doi]
• The Smoothed Complexity of Edit DistanceAlexandr Andoni, Robert Krauthgamer. 357-369 [doi]
• Randomized Self-assembly for Approximate ShapesMing-Yang Kao, Robert T. Schweller. 370-384 [doi]
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)Martin Dietzfelbinger, Rasmus Pagh. 385-396 [doi]
• Competitive Weighted Matching in Transversal MatroidsNedialko B. Dimitrov, C. Greg Plaxton. 397-408 [doi]
• Scheduling for Speed Bounded ProcessorsNikhil Bansal, Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee. 409-420 [doi]
• Faster Algorithms for Incremental Topological OrderingBernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan. 421-433 [doi]
• Dynamic Normal Forms and Dynamic Characteristic PolynomialGudmund Skovbjerg Frandsen, Piotr Sankowski. 434-446 [doi]
• Algorithms for epsilon-Approximations of TerrainsJeff M. Phillips. 447-458 [doi]
• An Approximation Algorithm for Binary Searching in TreesEduardo Sany Laber, Marco Molinaro. 459-471 [doi]
• Algorithms for 2-Route Cut ProblemsChandra Chekuri, Sanjeev Khanna. 472-484 [doi]
• The Two-Edge Connectivity Survivable Network Problem in Planar GraphsGlencora Borradaile, Philip N. Klein. 485-501 [doi]
• Efficiently Testing Sparse GF(2) PolynomialsIlias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan. 502-514 [doi]
• Testing Properties of Sets of Points in Metric SpacesKrzysztof Onak. 515-526 [doi]
• An Expansion Tester for Bounded Degree GraphsSatyen Kale, C. Seshadhri. 527-538 [doi]
• Property Testing on k-Vertex-Connectivity of GraphsYuichi Yoshida, Hiro Ito. 539-550 [doi]
• Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)Igor Razgon, Barry O Sullivan. 551-562 [doi]
• On Problems without Polynomial Kernels (Extended Abstract)Hans Leo Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin. 563-574 [doi]
• Faster Algebraic Algorithms for Path and Packing ProblemsIoannis Koutis. 575-586 [doi]
• Understanding the Complexity of Induced Subgraph IsomorphismsYijia Chen, Marc Thurley, Mark Weyer. 587-596 [doi]
• Spanners in Sparse GraphsFeodor F. Dragan, Fedor V. Fomin, Petr A. Golovach. 597-608 [doi]
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive ErrorSurender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay. 609-621 [doi]
• All-Pairs Shortest Paths with a Sublinear Additive ErrorLiam Roditty, Asaf Shapira. 622-633 [doi]
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing PermutationsMarc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul. 634-645 [doi]
• The Complexity of the Counting Constraint Satisfaction ProblemAndrei A. Bulatov. 646-661 [doi]
• On the Hardness of Losing WeightAndrei A. Krokhin, Dániel Marx. 662-673 [doi]
• Product Theorems Via Semidefinite ProgrammingTroy Lee, Rajat Mittal. 674-685 [doi]
• Sound 3-Query PCPPs Are LongEli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah. 686-697 [doi]
• Approximative Methods for Monotone Systems of Min-Max-Polynomial EquationsJavier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl. 698-710 [doi]
• Recursive Stochastic Games with Positive RewardsKousha Etessami, Dominik Wojtczak, Mihalis Yannakakis. 711-723 [doi]
• Complementation, Disambiguation, and Determinization of Büchi Automata UnifiedDetlef Kähler, Thomas Wilke. 724-735 [doi]
• Tree Projections: Hypergraph Games and MinimalityGianluigi Greco, Francesco Scarcello. 736-747 [doi]
• Explicit Non-adaptive Combinatorial Group Testing SchemesEly Porat, Amir Rothschild. 748-759 [doi]
• Tight Lower Bounds for Multi-pass Stream Computation Via Pass EliminationSudipto Guha, Andrew McGregor. 760-772 [doi]
• Impossibility of a Quantum Speed-Up with a Faulty OracleOded Regev, Liron Schiff. 773-781 [doi]
• Superpolynomial Speedups Based on Almost Any Quantum CircuitSean Hallgren, Aram Wettroth Harrow. 782-795 [doi]
• The Speed of Convergence in Congestion Games under Best-Response DynamicsAngelo Fanelli, Michele Flammini, Luca Moscardelli. 796-807 [doi]
• Uniform Budgets and the Envy-Free Pricing ProblemPatrick Briest. 808-819 [doi]
• Bayesian Combinatorial AuctionsGeorge Christodoulou, Annamária Kovács, Michael Schapira. 820-832 [doi]
• Truthful Unification Framework for Packing Integer Programs with ChoicesYossi Azar, Iftah Gamzu. 833-844 [doi]
• Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum ComputingJulia Kempe, Oded Regev, Falk Unger, Ronald de Wolf. 845-856 [doi]
• Finding Optimal Flows EfficientlyMehdi Mhalla, Simon Perdrix. 857-868 [doi]
• Optimal Quantum Adversary Lower Bounds for Ordered SearchAndrew M. Childs, Troy Lee. 869-880 [doi]
• Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-CompleteLior Eldar, Oded Regev. 881-892 [doi]