Abstract is missing.
- Improved Approximation for the Directed Spanner ProblemPiotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev. 1-12 [doi]
- An Improved Approximation Algorithm for Minimum-Cost Subset ::::k::::-Connectivity - (Extended Abstract)Bundit Laekhanukit. 13-24 [doi]
- Approximation Schemes for Capacitated Geometric Network DesignAnna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk. 25-36 [doi]
- An ::::O::::(log::::n::::)-Competitive Algorithm for Online Constrained Forest ProblemsJiawei Qian, David P. Williamson. 37-48 [doi]
- On the Power of Lower Bound Methods for One-Way Quantum Communication ComplexityShengyu Zhang. 49-60 [doi]
- Quantum Commitments from Complexity AssumptionsAndré Chailloux, Iordanis Kerenidis, Bill Rosgen. 73-85 [doi]
- Limitations on Quantum Dimensionality ReductionAram Wettroth Harrow, Ashley Montanaro, Anthony J. Short. 86-97 [doi]
- On Tree-Constrained Matchings and GeneralizationsStefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julián Mestre. 98-109 [doi]
- Tight Bounds for Linkages in Planar GraphsIsolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. 110-121 [doi]
- A Tighter Insertion-Based Approximation of the Crossing NumberMarkus Chimani, Petr Hlinený. 122-134 [doi]
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free GraphsKen-ichi Kawarabayashi, Philip N. Klein, Christian Sommer 0002. 135-146 [doi]
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation SchemesEndre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey. 147-158 [doi]
- Pairwise-Interaction GamesMartin E. Dyer, Velumailum Mohanaraj. 159-170 [doi]
- Settling the Complexity of Local Max-Cut (Almost) CompletelyRobert Elsässer, Tobias Tscheuschner. 171-182 [doi]
- Clique Clustering Yields a PTAS for max-Coloring Interval GraphsTim Nonner. 183-194 [doi]
- On Variants of File CachingLeah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György. 195-206 [doi]
- On the Advice Complexity of the k-Server ProblemHans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic. 207-218 [doi]
- Sleep Management on Multiple Machines for Energy and Flow TimeSze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Chi-Man Liu, Hing-Fung Ting. 219-231 [doi]
- Meeting Deadlines: How Much Speed Suffices?S. Anand, Naveen Garg, Nicole Megow. 232-243 [doi]
- Range Majority in Constant Time and Linear SpaceStephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala. 244-255 [doi]
- Dynamic Planar Range Maxima QueriesGerth Stølting Brodal, Konstantinos Tsakalidis. 256-267 [doi]
- Compact Navigation and Distance Oracles for Graphs with Small TreewidthArash Farzan, Shahin Kamali. 268-280 [doi]
- Player-Centric Byzantine AgreementMartin Hirt, Vassilis Zikas. 281-292 [doi]
- Limits on the Computational Power of Random StringsEric Allender, Luke Friedman, William I. Gasarch. 293-304 [doi]
- The Decimation Process in Random ::::k::::-SATAmin Coja-Oghlan, Angelica Y. Pachon-Pinzon. 305-316 [doi]
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive MajorityFrédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao. 317-329 [doi]
- The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean FunctionsRyan O Donnell, John Wright, Yuan Zhou. 330-341 [doi]
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract)Moran Feldman, Joseph Naor, Roy Schwartz. 342-353 [doi]
- Submodular Cost Allocation Problem and ApplicationsChandra Chekuri, Alina Ene. 354-366 [doi]
- Robust Independence SystemsNaonori Kakimura, Kazuhisa Makino. 367-378 [doi]
- Buyback Problem - Approximate Matroid Intersection with Cancellation CostsAshwinkumar Badanidiyuru Varadaraja. 379-390 [doi]
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-ResilienceSebastian Faust, Krzysztof Pietrzak, Daniele Venturi. 391-402 [doi]
- New Algorithms for Learning in Presence of ErrorsSanjeev Arora, Rong Ge. 403-415 [doi]
- Exact Learning Algorithms, Betting Games, and Circuit Lower BoundsRyan C. Harkins, John M. Hitchcock. 416-423 [doi]
- Constraint Satisfaction Parameterized by Solution SizeAndrei A. Bulatov, Dániel Marx. 424-436 [doi]
- Preprocessing for Treewidth: A Combinatorial Analysis through KernelizationHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch. 437-448 [doi]
- Subset Feedback Vertex Set Is Fixed-Parameter TractableMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 449-461 [doi]
- Domination When the Stars Are OutDanny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger. 462-473 [doi]
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code ProblemPer Austrin, Subhash Khot. 474-485 [doi]
- Recoverable Values for Independent SetsUriel Feige, Daniel Reichman. 486-497 [doi]
- Vertex Cover in Graphs with Locally Few ColorsFabian Kuhn, Monaldo Mastrolilli. 498-509 [doi]
- Maximizing Polynomials Subject to Assignment ConstraintsKonstantin Makarychev, Maxim Sviridenko. 510-520 [doi]
- A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular MatroidLeslie Ann Goldberg, Mark Jerrum. 521-532 [doi]
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-WidthMagnus Bordewich, Ross J. Kang. 533-544 [doi]
- Efficient Sample Extractors for Juntas with ApplicationsSourav Chakraborty, David García-Soriano, Arie Matsliah. 545-556 [doi]
- Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)Hung Q. Ngo, Ely Porat, Atri Rudra. 557-568 [doi]
- Robust Simulations and Significant SeparationsLance Fortnow, Rahul Santhanam. 569-580 [doi]
- A PCP Characterization of AMAndrew Drucker. 581-592 [doi]
- Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe ModelRaphaël Clifford, Markus Jalsenius. 593-604 [doi]
- Automatizability and Simple Stochastic GamesLei Huang, Toniann Pitassi. 605-617 [doi]
- Exponential Lower Bounds for AC:::0:::-Frege Imply Superpolynomial Frege Lower BoundsYuval Filmus, Toniann Pitassi, Rahul Santhanam. 618-629 [doi]
- Parameterized Bounded-Depth Frege Is Not OptimalOlaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov. 630-641 [doi]
- On Minimal Unsatisfiability and Time-Space Trade-offs for ::::k::::-DNF ResolutionJakob Nordström, Alexander A. Razborov. 642-653 [doi]
- Sorting by Transpositions Is DifficultLaurent Bulteau, Guillaume Fertin, Irena Rusu. 654-665 [doi]
- Popular Matchings in the Stable Marriage ProblemChien-Chung Huang, Telikepalli Kavitha. 666-677 [doi]
- Center Stable Matchings and Centers of Cover Graphs of Distributive LatticesChristine T. Cheng, Eric McDermid, Ichiro Suzuki. 678-689 [doi]
- VC-Dimension and Shortest Path AlgorithmsIttai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck. 690-699 [doi]
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract)Stefan Mengel. 700-711 [doi]
- The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract)Heng Guo, Pinyan Lu, Leslie G. Valiant. 712-723 [doi]
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant DepthMaurice Jansen, Rahul Santhanam. 724-735 [doi]
- On the Power of Algebraic Branching Programs of Width TwoEric Allender, Fengming Wang. 736-747 [doi]
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar GraphsCarsten Moldenhauer. 748-759 [doi]
- Steiner Transitive-Closure Spanners of Low-Dimensional PosetsPiotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev. 760-772 [doi]
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning SphereHu Ding, Jinhui Xu. 773-784 [doi]
- Clustering with Local RestrictionsDaniel Lokshtanov, Dániel Marx. 785-797 [doi]