1. Near-Linear Approximation Algorithms for Geometric Hitting Sets

   • Pankaj K. Agarwal
   • Esther Ezra
   • Micha Sharir

   OriginalPaper 06 May 2011 Pages: 1 - 25

2. Graph Decomposition for Memoryless Periodic Exploration

   • Adrian Kosowski
   • Alfredo Navarra

   OriginalPaper 03 May 2011 Pages: 26 - 38

3. Almost Exact Matchings

   • Raphael Yuster

   OriginalPaper 30 April 2011 Pages: 39 - 50

4. Contribution Games in Networks

   • Elliot Anshelevich
   • Martin Hoefer

   OriginalPaper 06 May 2011 Pages: 51 - 90

5. On the Hitting Times of Quantum Versus Random Walks

   • Frédéric Magniez
   • Ashwin Nayak
   • Miklos Santha

   OriginalPaper 10 May 2011 Pages: 91 - 116

6. Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming

   • Scott M. Summers

   OriginalPaper 06 May 2011 Pages: 117 - 136

7. Maximum Series-Parallel Subgraph

   • Gruia Călinescu
   • Cristina G. Fernandes
   • Alexander Zelikovsky

   OriginalPaper 11 May 2011 Pages: 137 - 157

8. A Distributed Algorithm for Computing the Node Search Number in Trees

   • David Coudert
   • Florian Huc
   • Dorian Mazauric

   OriginalPaper 07 May 2011 Pages: 158 - 190

9. A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

   • Donglei Du
   • Ruixing Lu
   • Dachuan Xu

   OriginalPaper 10 May 2011 Pages: 191 - 200

10. Succinct and I/O Efficient Data Structures for Traversal in Trees

    • Craig Dillabaugh
    • Meng He
    • Anil Maheshwari

    OriginalPaper 17 May 2011 Pages: 201 - 223

11. Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs

    • Telikepalli Kavitha

    OriginalPaper 01 June 2011 Pages: 224 - 245

12. On Equilibria for ADM Minimization Games

    • Leah Epstein
    • Asaf Levin

    OriginalPaper 08 June 2011 Pages: 246 - 273

13. Minimize the Maximum Duty in Multi-interface Networks

    • Gianlorenzo D’Angelo
    • Gabriele Di Stefano
    • Alfredo Navarra

    OriginalPaper 07 June 2011 Pages: 274 - 295

14. A Competitive Analysis for Balanced Transactional Memory Workloads

    • Gokarna Sharma
    • Costas Busch

    OriginalPaper 04 June 2011 Pages: 296 - 322

15. An Exact Exponential Time Algorithm for Power Dominating Set

    • Daniel Binkele-Raible
    • Henning Fernau

    OriginalPaper 08 June 2011 Pages: 323 - 346

16. Improved Approximation Algorithms for Data Migration

    • Samir Khuller
    • Yoo-Ah Kim
    • Azarakhsh Malekian

    OriginalPaper 06 July 2011 Pages: 347 - 362

17. Interval Partitions and Polynomial Factorization

    • Joachim von zur Gathen
    • Daniel Panario
    • Bruce Richmond

    OriginalPaper 14 June 2011 Pages: 363 - 397

18. Approximating Node-Connectivity Augmentation Problems

    • Zeev Nutov

    OriginalPaper 14 June 2011 Pages: 398 - 410

19. Improved Competitive Performance Bounds for CIOQ Switches

    • Alex Kesselman
    • Kirill Kogan
    • Michael Segal

    OriginalPaper 21 June 2011 Pages: 411 - 424

20. Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

    • A. Aazami
    • J. Cheriyan
    • K. R. Jampani

    OriginalPaper 15 June 2011 Pages: 425 - 456

21. External Memory Planar Point Location with Logarithmic Updates

    • Lars Arge
    • Gerth Stølting Brodal
    • S. Srinivasa Rao

    OriginalPaper 15 June 2011 Pages: 457 - 475

22. Layered Working-Set Trees

    • Prosenjit Bose
    • Karim Douïeb
    • John Howat

    OriginalPaper 21 June 2011 Pages: 476 - 489

23. Bipartite Matching in the Semi-streaming Model

    • Sebastian Eggert
    • Lasse Kliemann
    • Anand Srivastav

    OriginalPaper 24 August 2011 Pages: 490 - 508

24. Average Case Analysis of Moore’s State Minimization Algorithm

    • Frédérique Bassino
    • Julien David
    • Cyril Nicaud

    OriginalPaper 12 October 2011 Pages: 509 - 531

25. Polynomial Kernelizations for MIN F⁺Π₁ and MAX NP

    • Stefan Kratsch

    OriginalPaper Open access 31 August 2011 Pages: 532 - 550

26. Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm

    • N. Catusse
    • V. Chepoi
    • Y. Vaxès

    OriginalPaper 31 August 2011 Pages: 551 - 567