1. Preface

   • Maciej Liskiewicz and Rudiger Reischuk, Special Issue Editors

   EditorialNotes Pages: 209 - 210

2. On the Incompressibility of Monotone DNFs

   • Matthias P. Krieger

   OriginalPaper Pages: 211 - 231

3. Leftist Grammars and the Chomsky Hierarchy

   • Tomasz Jurdzinski
   • Krzysztof Lorys

   OriginalPaper Pages: 233 - 256

4. Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

   • Daniel Meister

   OriginalPaper Pages: 257 - 289

5. On the Power of Unambiguity in Alternating Machines

   • Holger Spakowski
   • Rahul Tripathi

   OriginalPaper Pages: 291 - 326

6. Logspace Optimization Problems and Their Approximability Properties

   • Till Tantau

   OriginalPaper Pages: 327 - 350

7. Average-Case Non-Approximability of Optimisation Problems

   • Birgit Schelm

   OriginalPaper Pages: 351 - 368

8. A Simple and Fast Min-Cut Algorithm

   • Michael Brinkmeier

   OriginalPaper Pages: 369 - 380

9. Exact Algorithms for Graph Homomorphisms

   • Fedor V. Fomin
   • Pinar Heggernes
   • Dieter Kratsch

   OriginalPaper Pages: 381 - 393