1. Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design

   • Xujin Chen
   • Bo Chen

   OriginalPaper 08 September 2007 Pages: 263 - 297

2. Fast Algorithms for the Density Finding Problem

   • D. T. Lee
   • Tien-Ching Lin
   • Hsueh-I Lu

   OriginalPaper 14 September 2007 Pages: 298 - 313

3. Real Two Dimensional Scaled Matching

   • Amihood Amir
   • Ayelet Butman
   • Ely Porat

   OriginalPaper 21 September 2007 Pages: 314 - 336

4. Approximability of Minimum AND-Circuits

   • Jan Arpe
   • Bodo Manthey

   OriginalPaper 28 September 2007 Pages: 337 - 357

5. Nondeterministic Graph Searching: From Pathwidth to Treewidth

   • Fedor V. Fomin
   • Pierre Fraigniaud
   • Nicolas Nisse

   OriginalPaper 28 September 2007 Pages: 358 - 373

6. Sorting Networks of Logarithmic Depth, Further Simplified

   • Joel Seiferas

   OriginalPaper 28 September 2007 Pages: 374 - 384

7. Variable Sized Online Interval Coloring with Bandwidth

   • Leah Epstein
   • Thomas Erlebach
   • Asaf Levin

   OriginalPaper 13 October 2007 Pages: 385 - 401

8. Minimum Weakly Fundamental Cycle Bases Are Hard To Find

   • Romeo Rizzi

   OriginalPaper 27 October 2007 Pages: 402 - 424

9. An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments

   • Pangfeng Liu
   • May-Chen Kuo
   • Da-Wei Wang

   OriginalPaper 30 October 2007 Pages: 425 - 453