1. On Independent Vertex Sets in Subclasses of Apple-Free Graphs

   • Andreas Brandstädt
   • Tilo Klembt
   • Raffaele Mosca

   OriginalPaper 14 March 2008 Pages: 383 - 393

2. A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph

   • Vladimir Kolmogorov

   OriginalPaper 15 March 2008 Pages: 394 - 412

3. Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs

   • Toshimasa Ishii
   • Yoko Akiyama
   • Hiroshi Nagamochi

   OriginalPaper 15 March 2008 Pages: 413 - 436

4. An Algorithm for Minimum Cost Arc-Connectivity Orientations

   • Satoru Iwata
   • Yusuke Kobayashi

   OriginalPaper 22 March 2008 Pages: 437 - 447

5. Approximation Algorithms for Treewidth

   • Eyal Amir

   OriginalPaper 02 April 2008 Pages: 448 - 479

6. Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly

   • Sudheer Sahu
   • John H. Reif

   OriginalPaper 15 April 2008 Pages: 480 - 504

7. Bin Packing with Rejection Revisited

   • Leah Epstein

   OriginalPaper 08 April 2008 Pages: 505 - 528

8. Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing

   • Danny Segev
   • Gil Segev

   OriginalPaper 15 April 2008 Pages: 529 - 549

9. A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems

   • Antonio Fernández
   • Ernesto Jiménez
   • Gilles Trédan

   OriginalPaper 19 April 2008 Pages: 550 - 576

10. ℓ ₂ ² Spreading Metrics for Vertex Ordering Problems

    • Moses Charikar
    • Mohammad Taghi Hajiaghayi
    • Satish Rao

    OriginalPaper 21 May 2008 Pages: 577 - 604

11. Random Matrices and Codes for the Erasure Channel

    • Chris Studholme
    • Ian F. Blake

    OriginalPaper 24 April 2008 Pages: 605 - 620