1. A parameterized perspective on packing paths of length two

   • Henning Fernau
   • Daniel Raible

   OriginalPaper 23 May 2009 Pages: 319 - 341

2. Node-weighted Steiner tree approximation in unit disk graphs

   • Feng Zou
   • Xianyue Li
   • Weili Wu

   OriginalPaper 21 May 2009 Pages: 342 - 349

3. The robot cleans up

   • M. E. Messinger
   • R. J. Nowakowski

   OriginalPaper 02 June 2009 Pages: 350 - 361

4. Fixed-parameter tractability of anonymizing data by suppressing entries

   • Patricia A. Evans
   • H. Todd Wareham
   • Rhonda Chaytor

   OriginalPaper 18 August 2009 Pages: 362 - 375

5. New algorithms for k-center and extensions

   • René Brandenberg
   • Lucia Roth

   OriginalPaper 21 May 2009 Pages: 376 - 392

6. Separating sublinear time computations by approximate diameter

   • Bin Fu
   • Zhiyu Zhao

   OriginalPaper 19 August 2009 Pages: 393 - 416

7. Edge-colouring of joins of regular graphs, I

   • Caterina De Simone
   • Anna Galluccio

   OriginalPaper 23 May 2009 Pages: 417 - 428