Theory of Computing Systems, Volume 43

Volume 43, Number 1, July 2008

• Thomas Erlebach, Giuseppe Persiano:
  WAOA 2005 Special Issue of TOCS. 1-2
  
• Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
  Improved Approximation Algorithm for Convex Recoloring of Trees. 3-18
  
• Markus Bläser, L. Shankar Ram:
  Approximately Fair Cost Allocation in Metric Traveling Salesman Games. 19-37
  
• Xin Han, Kazuo Iwama, Guochuan Zhang:
  Online Removable Square Packing. 38-55
  
• Ronald Koch, Martin Skutella, Ines Spenke:
  Maximum k -Splittable s , t -Flows. 56-66
  
• Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
  Speed Scaling of Tasks with Precedence Constraints. 67-80
  
• Hadas Shachnai, Tami Tamir, Omer Yehezkely:
  Approximation Schemes for Packing with Item Fragmentation. 81-98
  

Volume 43, Number 2, August 2008

• Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
  Foreword. 99
  
• Vikraman Arvind, Bireswar Das:
  SZK Proofs for Black-Box Group Problems. 100-117
  
• Olaf Beyersdorff:
  Tuples of Disjoint NP-Sets. 118-135
  
• Manuel Bodirsky, Jan Kára:
  The Complexity of Equality Constraint Languages. 136-158
  
• Anna Gál, Michal Koucký, Pierre McKenzie:
  Incremental Branching Programs. 159-184
  
• Evan Goris:
  Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic. 185-203
  
• 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. 204-233
  
• Daniel Mölle, Stefan Richter, Peter Rossmanith:
  Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. 234-253
  
• 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. 254-271
  
• Tatiana Yavorskaya:
  Interacting Explicit Evidence Systems. 272-293