1. Approximate Range Searching in External Memory

   • Micha Streppel
   • Ke Yi

   OriginalPaper 14 March 2009 Pages: 115 - 128

2. The Stackelberg Minimum Spanning Tree Game

   • Jean Cardinal
   • Erik D. Demaine
   • Oren Weimann

   OriginalPaper 21 March 2009 Pages: 129 - 144

3. Augmenting the Rigidity of a Graph in R ²

   • A. García
   • J. Tejel

   OriginalPaper 28 March 2009 Pages: 145 - 168

4. Exact Algorithms for L(2,1)-Labeling of Graphs

   • Frédéric Havet
   • Martin Klazar
   • Mathieu Liedloff

   OriginalPaper 28 March 2009 Pages: 169 - 194

5. Improved Algorithms for Maximum Agreement and Compatible Supertrees

   • Viet Tung Hoang
   • Wing-Kin Sung

   OriginalPaper 07 April 2009 Pages: 195 - 214

6. Linear-Time Recognition of Helly Circular-Arc Models and Graphs

   • Benson L. Joeris
   • Min Chih Lin
   • Jayme L. Szwarcfiter

   OriginalPaper 08 April 2009 Pages: 215 - 239

7. 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality

   • Lukasz Kowalik
   • Marcin Mucha

   OriginalPaper 16 April 2009 Pages: 240 - 255

8. Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

   • Christoph Dürr
   • Mathilde Hurand

   OriginalPaper 22 April 2009 Pages: 256 - 268

9. Linear-Time Construction of Two-Dimensional Suffix Trees

   • Dong Kyue Kim
   • Joong Chae Na
   • Kunsoo Park

   OriginalPaper 11 August 2009 Pages: 269 - 297