99 | -- | 0 | Sergei N. Artëmov, Volker Diekert, Dima Grigoriev. Foreword |
100 | -- | 117 | Vikraman Arvind, Bireswar Das. SZK Proofs for Black-Box Group Problems |
118 | -- | 135 | Olaf Beyersdorff. Tuples of Disjoint NP-Sets |
136 | -- | 158 | Manuel Bodirsky, Jan Kára. The Complexity of Equality Constraint Languages |
159 | -- | 184 | Anna Gál, Michal Koucký, Pierre McKenzie. Incremental Branching Programs |
185 | -- | 203 | Evan Goris. Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic |
204 | -- | 233 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao. On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction |
234 | -- | 253 | Daniel Mölle, Stefan Richter, Peter Rossmanith. Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover |
254 | -- | 271 | Vladimir V. Rybakov. Branching Time Logics ::::BTL:::::::U, S:::::N, N:::-1:::::(::::Z::::)::a:: with Operations ::::Until:::: and ::::Since:::: Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms |
272 | -- | 293 | Tatiana Yavorskaya. Interacting Explicit Evidence Systems |