Abstract is missing.
- Near-Optimal Asymmetric Binary Matrix PartitionsFidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris. 1-13 [doi]
- Dual VP ClassesEric Allender, Anna Gál, Ian Mertz. 14-25 [doi]
- On Tinhofer's Linear Programming Approach to Isomorphism TestingVikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky. 26-37 [doi]
- On the Complexity of Noncommutative Polynomial FactorizationVikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar. 38-49 [doi]
- An Algebraic Proof of the Real Number PCP TheoremMartijn Baartse, Klaus Meer. 50-61 [doi]
- On the Complexity of Hub Labeling (Extended Abstract)Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller. 62-74 [doi]
- On the Complexity of Speed ScalingNeal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato. 75-89 [doi]
- Almost All Functions Require Exponential EnergyNeal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato. 90-101 [doi]
- On Dynamic DFS Tree in Directed GraphsSurender Baswana, Keerti Choudhary. 102-114 [doi]
- Metric Dimension of Bounded Width GraphsRémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan. 115-126 [doi]
- Equality, RevisitedRalph Bottesch, Dmitry Gavinsky, Hartmut Klauck. 127-138 [doi]
- Bounding the Clique-Width of H-free Chordal GraphsAndreas Brandstädt, Konrad Dabrowski, Shenwei Huang, Daniël Paulusma. 139-150 [doi]
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition TheoryVladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang. 151-162 [doi]
- QMA with Subset State WitnessesAlex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora. 163-174 [doi]
- Phase Transition for Local Search on Planted SATAndrei A. Bulatov, Evgeny S. Skvortsov. 175-186 [doi]
- Optimal Bounds for Estimating Entropy with PMF QueriesCafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say. 187-198 [doi]
- Mutual Dimension and Random SequencesAdam Case, Jack H. Lutz. 199-210 [doi]
- Optimal Algorithms and a PTAS for Cost-Aware SchedulingLin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae. 211-222 [doi]
- Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite BasesRuiwen Chen. 223-234 [doi]
- Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf ProblemDaniyar Chumbalov, Andrei E. Romashchenko. 235-247 [doi]
- Network Creation Games: Think Global - Act LocalAndreas Cord-Landwehr, Pascal Lenzner. 248-260 [doi]
- Oblivious Transfer from Weakly Random Self-Reducible Public-Key CryptosystemClaude Crépeau, Raza Ali Kazmi. 261-273 [doi]
- Efficient Computations over Encrypted Data BlocksGiovanni Di Crescenzo, Brian A. Coan, Jonathan Kirsch. 274-286 [doi]
- Polynomial Kernels for Weighted ProblemsMichael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin. 287-298 [doi]
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear TimeStefan Fafianie, Stefan Kratsch. 299-310 [doi]
- Metastability of Asymptotically Well-Behaved Potential Games - (Extended Abstract)Diodato Ferraioli, Carmine Ventre. 311-323 [doi]
- The Shifted Partial Derivative Complexity of Elementary Symmetric PolynomialsHervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan. 324-335 [doi]
- Parameterized Algorithms for Parity GamesJakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak. 336-347 [doi]
- Algorithmic Applications of Tree-Cut WidthRobert Ganian, Eun Jung Kim 0002, Stefan Szeider. 348-360 [doi]
- Log-Concavity and Lower Bounds for Arithmetic CircuitsIgnacio García-Marco, Pascal Koiran, Sébastien Tavenas. 361-371 [doi]
- Easy Multiple-Precision Divisors and Word-RAM ConstantsTorben Hagerup. 372-383 [doi]
- Visibly Counter Languages and the Structure of \mathrm NC^1Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig. 384-394 [doi]
- The Price of Connectivity for Cycle TransversalsTatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma. 395-406 [doi]
- Upper and Lower Bounds on Long Dual Paths in Line ArrangementsUdo Hoffmann, Linda Kleist, Tillmann Miltzow. 407-419 [doi]
- A Numbers-on-Foreheads GameSune K. Jakobsen. 420-431 [doi]
- Faster Lightweight Lempel-Ziv ParsingDmitry Kosolobov. 432-444 [doi]
- Parallel Identity Testing for Skew Circuits with Big Powers and ApplicationsDaniel König, Markus Lohrey. 445-458 [doi]
- On Probabilistic Space-Bounded Machines with Multiple Access to Random TapeDebasis Mandal, A. Pavan, N. V. Vinodchandran. 459-471 [doi]
- Densest Subgraph in Dynamic Graph StreamsAndrew McGregor, David Tench, Sofya Vorotnikova, Hoa T. Vu. 472-482 [doi]
- The Offline Carpool Problem RevisitedSaad Mneimneh, Saman Farhat. 483-492 [doi]
- On Sampling Simple Paths in Planar Graphs According to Their LengthsSandro Montanari, Paolo Penna. 493-504 [doi]
- Degree-Constrained Subgraph Reconfiguration is in PMoritz Mühlenthaler. 505-516 [doi]
- Generalized Pseudoforest Deletion: Algorithms and Uniform KernelGeevarghese Philip, Ashutosh Rai, Saket Saurabh. 517-528 [doi]
- Efficient Equilibria in Polymatrix Coordination GamesMona Rahn, Guido Schäfer. 529-541 [doi]
- Finding Consensus Strings with Small Length Difference Between Input and Solution StringsMarkus L. Schmid. 542-554 [doi]
- Active Linking AttacksHenning Schnoor, Oliver Woizekowski. 555-566 [doi]
- On the Complexity of Master ProblemsMartijn van Ee, René Sitters. 567-576 [doi]
- Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed GraphsXiaowei Wu, Chenzi Zhang. 577-588 [doi]
- Maximum Minimal Vertex Cover Parameterized by Vertex CoverMeirav Zehavi. 589-600 [doi]
- Fast Dynamic Weight Matchings in Convex Bipartite GraphsQuan Zu, Miaomiao Zhang, Bin Yu. 601-612 [doi]