1. Preface

   • Sergei Artemov
   • Volker Diekert
   • Alexander Razborov

   EditorialNotes 14 October 2009 Pages: 619 - 619

2. Comparing Universal Covers in Polynomial Time

   • Jiří Fiala
   • Daniël Paulusma

   OriginalPaper 07 March 2009 Pages: 620 - 635

3. Self-Referential Justifications in Epistemic Logic

   • Roman Kuznets

   OriginalPaper 07 April 2009 Pages: 636 - 661

4. Unidirectional Lambek Grammars in Polynomial Time

   • Yury Savateev

   OriginalPaper 28 March 2009 Pages: 662 - 672

5. A Semantic Proof of Polytime Soundness of Light Affine Logic

   • Ugo Dal Lago
   • Martin Hofmann

   OriginalPaper 07 April 2009 Pages: 673 - 689

6. Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions

   • Markus Bläser
   • Holger Dell
   • Johann A. Makowsky

   OriginalPaper 15 May 2009 Pages: 690 - 706

7. Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences

   • Marius Zimand

   OriginalPaper 13 May 2009 Pages: 707 - 722

8. Simple and Improved Parameterized Algorithms for Multiterminal Cuts

   • Mingyu Xiao

   OriginalPaper 08 May 2009 Pages: 723 - 736

9. Logic and Rational Languages of Words Indexed by Linear Orderings

   • Nicolas Bedon
   • Alexis Bès
   • Chloé Rispal

   OriginalPaper 11 June 2009 Pages: 737 - 760

10. On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth

    • Uffe Flarup
    • Laurent Lyaudet

    OriginalPaper 14 October 2009 Pages: 761 - 791