Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs Glencora BorradaileErik D. DemaineSiamak Tazari OriginalPaper 29 June 2012 Pages: 287 - 311
Approximation Algorithms for Intersection Graphs Frank KammerTorsten Tholey OriginalPaper 04 July 2012 Pages: 312 - 336
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
Emergency Connectivity in Ad-hoc Networks with Selfish Nodes George KarakostasEuripides Markou OriginalPaper 03 August 2012 Pages: 358 - 389
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching Nikhil BansalNiv BuchbinderJoseph (Seffi) Naor OriginalPaper 04 August 2012 Pages: 390 - 403
Speed Scaling on Parallel Processors Susanne AlbersFabian MüllerSwen Schmelzer OriginalPaper 09 August 2012 Pages: 404 - 425
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches Marcin Bienkowski OriginalPaper Open access 10 August 2012 Pages: 426 - 447
Relative Convex Hulls in Semi-Dynamic Arrangements Mashhood IshaqueCsaba D. Tóth OriginalPaper 11 August 2012 Pages: 448 - 482
The Complexity of the Empire Colouring Problem Andrew R. A. McGraeMichele Zito OriginalPaper 16 August 2012 Pages: 483 - 503
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles Neeldhara MisraGeevarghese PhilipSaket Saurabh OriginalPaper 23 August 2012 Pages: 504 - 530
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs Xin HeHuaming Zhang OriginalPaper 25 August 2012 Pages: 531 - 544