1. Foreword

   • Sergei Artemov
   • Volker Diekert
   • Dima Grigoriev

   EditorialNotes 24 October 2007 Pages: 99 - 99

2. SZK Proofs for Black-Box Group Problems

   • V. Arvind
   • Bireswar Das

   OriginalPaper 12 July 2007 Pages: 100 - 117

3. Tuples of Disjoint \(\mathsf{NP}\) -Sets

   • Olaf Beyersdorff

   OriginalPaper 29 June 2007 Pages: 118 - 135

4. The Complexity of Equality Constraint Languages

   • Manuel Bodirsky
   • Jan Kára

   OriginalPaper 19 October 2007 Pages: 136 - 158

5. Incremental Branching Programs

   • Anna Gál
   • Michal Koucký
   • Pierre McKenzie

   OriginalPaper 28 September 2007 Pages: 159 - 184

6. Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic

   • Evan Goris

   OriginalPaper 13 October 2007 Pages: 185 - 203

7. On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction

   • Leonid Khachiyan
   • Endre Boros
   • Jihui Zhao

   OriginalPaper Open access 10 July 2007 Pages: 204 - 233

8. Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

   • Daniel Mölle
   • Stefan Richter
   • Peter Rossmanith

   OriginalPaper 16 October 2007 Pages: 234 - 253

9. Branching Time Logics \(\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha }\) with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms

   • V. Rybakov

   OriginalPaper 06 October 2007 Pages: 254 - 271

10. Interacting Explicit Evidence Systems

    • Tatiana Yavorskaya (Sidon)

    OriginalPaper 25 October 2007 Pages: 272 - 293