Abstract is missing.
- How To Be FickleVasek Chvátal. 1 [doi]
- Finite Model Theory on Tame Classes of StructuresAnuj Dawar. 2-12 [doi]
- Minimum Cycle Bases in Graphs Algorithms and ApplicationsKurt Mehlhorn. 13-14 [doi]
- Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion SchemesC.-H. Luke Ong. 15-21 [doi]
- EvolvabilityLeslie G. Valiant. 22-43 [doi]
- Expander Properties and the Cover Time of Random Intersection GraphsSotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis. 44-55 [doi]
- Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular GraphsWilliam Duckworth, Michele Zito. 56-66 [doi]
- Transition Graphs of Rewriting Systems over Unranked TreesChristof Löding, Alex Spelten. 67-77 [doi]
- Rewriting Conjunctive Queries Determined by ViewsFoto N. Afrati. 78-89 [doi]
- Approximation Algorithms for the Maximum Internal Spanning Tree ProblemGábor Salamon. 90-102 [doi]
- New Approximability Results for 2-Dimensional Packing ProblemsKlaus Jansen, Roberto Solis-Oba. 103-114 [doi]
- On Approximation of Bookmark AssignmentsYuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono. 115-124 [doi]
- Height-Deterministic Pushdown AutomataDirk Nowotka, Jirí Srba. 125-134 [doi]
- Minimizing Variants of Visibly Pushdown AutomataPatrick Chervet, Igor Walukiewicz. 135-146 [doi]
- Linear Circuits, Two-Variable Logic and Weakly Blocked MonoidsChristoph Behle, Andreas Krebs, Mark Mercer. 147-158 [doi]
- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-CompleteJaroslav Nesetril, Mark H. Siggers. 159-170 [doi]
- NP by Means of Lifts and ShadowsGábor Kun, Jaroslav Nesetril. 171-181 [doi]
- The Complexity of SolitaireLuc Longpré, Pierre McKenzie. 182-193 [doi]
- Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph ProblemsCamil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini. 194-205 [doi]
- Space-Conscious CompressionTravis Gagie, Giovanni Manzini. 206-217 [doi]
- Small Alliances in GraphsRodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel. 218-227 [doi]
- The Maximum Solution Problem on GraphsPeter Jonsson, Gustav Nordh, Johan Thapper. 228-239 [doi]
- What Are Iteration Theories?Jirí Adámek, Stefan Milius, Jiri Velebil. 240-252 [doi]
- Properties Complementary to Program Self-referenceJohn Case, Samuel E. Moelius. 253-263 [doi]
- Dobrushin Conditions for Systematic Scan with Block DynamicsKasper Pedersen. 264-275 [doi]
- On the Complexity of Computing TreelengthDaniel Lokshtanov. 276-287 [doi]
- On Time Lookahead Algorithms for the Online Data Acknowledgement ProblemCsanád Imreh, Tamás Németh. 288-297 [doi]
- Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex NeighborhoodsMartin Delacourt, Victor Poupet. 298-309 [doi]
- Towards a Rice Theorem on Traces of Cellular AutomataJulien Cervelle, Pierre Guillon. 310-319 [doi]
- Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D MinorityDamien Regnault, Nicolas Schabanel, Eric Thierry. 320-332 [doi]
- Public Key Identification Based on the Equivalence of Quadratic FormsRupert J. Hartung, Claus-Peter Schnorr. 333-345 [doi]
- Reachability Problems in Quaternion Matrix and Rotation SemigroupsPaul Bell, Igor Potapov. 346-358 [doi]
- VPSPACE and a Transfer Theorem over the Complex FieldPascal Koiran, Sylvain Perifel. 359-370 [doi]
- Efficient Provably-Secure Hierarchical Key Assignment SchemesAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci. 371-382 [doi]
- Nearly Private Information RetrievalAmit Chakrabarti, Anna Shubina. 383-393 [doi]
- Packing and Squeezing Subgraphs into Planar GraphsFabrizio Frati, Markus Geyer, Michael Kaufmann. 394-405 [doi]
- Dynamic Matchings in Convex Bipartite GraphsGerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel. 406-417 [doi]
- Communication in Networks with Random Dependent FaultsEvangelos Kranakis, Michel Paquette, Andrzej Pelc. 418-429 [doi]
- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical FaultsAndrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri. 430-441 [doi]
- A Linear Time Algorithm for the ::::k:::: Maximal Sums ProblemGerth Stølting Brodal, Allan Grønlund Jørgensen. 442-453 [doi]
- A Lower Bound of 1+::::phi:::: for Truthful Scheduling MechanismsElias Koutsoupias, Angelina Vidali. 454-464 [doi]
- Analysis of Maximal Repetitions in StringsMaxime Crochemore, Lucian Ilie. 465-476 [doi]
- Series-Parallel Languages on Scattered and Countable PosetsNicolas Bedon, Chloe Rispal. 477-488 [doi]
- Traces of Term-Automatic GraphsAntoine Meyer. 489-500 [doi]
- State Complexity of Basic Operations on Suffix-Free Regular LanguagesYo-Sub Han, Kai Salomaa. 501-512 [doi]
- Exact Algorithms for ::::L:::: (2, 1)-Labeling of GraphsJan Kratochvíl, Dieter Kratsch, Mathieu Liedloff. 513-524 [doi]
- On ( ::::k:::: , ::::l::::)-Leaf PowersAndreas Brandstädt, Peter Wagner 0002. 525-535 [doi]
- An Improved Claw Finding Algorithm Using Quantum WalkSeiichiro Tani. 536-547 [doi]
- Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational ArgumentRahul Tripathi. 548-558 [doi]
- On the Complexity of Game IsomorphismJoaquim Gabarró, Alina García, Maria J. Serna. 559-571 [doi]
- Hardness Results for Tournament Isomorphism and AutomorphismFabian Wagner. 572-583 [doi]
- Relating Complete and Partial Solution for Problems Similar to Graph AutomorphismTakayuki Nagoya, Seinosuke Toda. 584-595 [doi]
- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic ApproachSpyros C. Kontogiannis, Paul G. Spirakis. 596-608 [doi]
- Selfish Load Balancing Under Partial KnowledgeElias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis. 609-620 [doi]
- Extending the Notion of Rationality of Selfish Agents: Second Order Nash EquilibriaVittorio Bilò, Michele Flammini. 621-632 [doi]
- Congestion Games with Player-Specific ConstantsMarios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann. 633-644 [doi]
- Finding Patterns in Given IntervalsMaxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman. 645-656 [doi]
- The Power of Two Prices: Beyond Cross-MonotonicityYvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann. 657-668 [doi]
- Semisimple Algebras of Almost Minimal Rank over the RealsMarkus Bläser, Andreas Meyer de Voltaire. 669-680 [doi]
- Structural Analysis of Gapped Motifs of a StringEsko Ukkonen. 681-690 [doi]
- Online and Offline Access to Short ListsTorben Hagerup. 691-702 [doi]
- Optimal Randomized Comparison Based Algorithms for CollisionRiko Jacob. 703-714 [doi]
- Randomized and Approximation Algorithms for Blue-Red MatchingChristos Nomikos, Aris Pagourtzis, Stathis Zachos. 715-725 [doi]
- Real Computational Universality: The Word Problem for a Class of Groups with Infinite PresentationKlaus Meer, Martin Ziegler. 726-737 [doi]
- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial DistancesPaul S. Bonsma, Luis Cereceda. 738-749 [doi]
- Shuffle Expressions and Words with Nested DataHenrik Björklund, Mikolaj Bojanczyk. 750-761 [doi]