1. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

   • Glencora Borradaile
   • Erik D. Demaine
   • Siamak Tazari

   OriginalPaper 29 June 2012 Pages: 287 - 311

   

2. Approximation Algorithms for Intersection Graphs

   • Frank Kammer
   • Torsten Tholey

   OriginalPaper 04 July 2012 Pages: 312 - 336

   

3. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

   • Davide Bilò
   • Luciano Gualà
   • Guido Proietti

   OriginalPaper 20 July 2012 Pages: 337 - 357

   

4. Emergency Connectivity in Ad-hoc Networks with Selfish Nodes

   • George Karakostas
   • Euripides Markou

   OriginalPaper 03 August 2012 Pages: 358 - 389

   

5. A Randomized O(log² k)-Competitive Algorithm for Metric Bipartite Matching

   • Nikhil Bansal
   • Niv Buchbinder
   • Joseph (Seffi) Naor

   OriginalPaper 04 August 2012 Pages: 390 - 403

   

6. Speed Scaling on Parallel Processors

   • Susanne Albers
   • Fabian Müller
   • Swen Schmelzer

   OriginalPaper 09 August 2012 Pages: 404 - 425

   

7. An Optimal Lower Bound for Buffer Management in Multi-Queue Switches

   • Marcin Bienkowski

   OriginalPaper Open access 10 August 2012 Pages: 426 - 447

   

8. Relative Convex Hulls in Semi-Dynamic Arrangements

   • Mashhood Ishaque
   • Csaba D. Tóth

   OriginalPaper 11 August 2012 Pages: 448 - 482

   

9. The Complexity of the Empire Colouring Problem

   • Andrew R. A. McGrae
   • Michele Zito

   OriginalPaper 16 August 2012 Pages: 483 - 503

   

10. The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles

    • Neeldhara Misra
    • Geevarghese Philip
    • Saket Saurabh

    OriginalPaper 23 August 2012 Pages: 504 - 530

    

11. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs

    • Xin He
    • Huaming Zhang

    OriginalPaper 25 August 2012 Pages: 531 - 544