On Independent Vertex Sets in Subclasses of Apple-Free Graphs Andreas BrandstädtTilo KlembtRaffaele Mosca OriginalPaper 14 March 2008 Pages: 383 - 393
A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph Vladimir Kolmogorov OriginalPaper 15 March 2008 Pages: 394 - 412
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs Toshimasa IshiiYoko AkiyamaHiroshi Nagamochi OriginalPaper 15 March 2008 Pages: 413 - 436
An Algorithm for Minimum Cost Arc-Connectivity Orientations Satoru IwataYusuke Kobayashi OriginalPaper 22 March 2008 Pages: 437 - 447
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly Sudheer SahuJohn H. Reif OriginalPaper 15 April 2008 Pages: 480 - 504
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing Danny SegevGil Segev OriginalPaper 15 April 2008 Pages: 529 - 549
A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems Antonio FernándezErnesto JiménezGilles Trédan OriginalPaper 19 April 2008 Pages: 550 - 576
ℓ 2 2 Spreading Metrics for Vertex Ordering Problems Moses CharikarMohammad Taghi HajiaghayiSatish Rao OriginalPaper 21 May 2008 Pages: 577 - 604
Random Matrices and Codes for the Erasure Channel Chris StudholmeIan F. Blake OriginalPaper 24 April 2008 Pages: 605 - 620