1. Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2

   • Zengti Li
   • Suogang Gao
   • Weili Wu

   OriginalPaper 16 January 2009 Pages: 325 - 334

2. Separator-based data reduction for signed graph balancing

   • Falk Hüffner
   • Nadja Betzler
   • Rolf Niedermeier

   OriginalPaper 31 January 2009 Pages: 335 - 360

3. An approximation algorithm for the k-level capacitated facility location problem

   • Donglei Du
   • Xing Wang
   • Dachuan Xu

   OriginalPaper 27 January 2009 Pages: 361 - 368

4. Semi-online scheduling with known maximum job size on two uniform machines

   • Qian Cao
   • Zhaohui Liu

   OriginalPaper 06 February 2009 Pages: 369 - 384

5. Strong formulation for the spot 5 daily photograph scheduling problem

   • Glaydston Mattos Ribeiro
   • Miguel Fragoso Constantino
   • Luiz Antonio Nogueira Lorena

   OriginalPaper 05 March 2009 Pages: 385 - 398

6. Polynomial time approximation schemes for minimum disk cover problems

   • Chen Liao
   • Shiyan Hu

   OriginalPaper 28 February 2009 Pages: 399 - 412

7. Constructing error-correcting pooling designs with symplectic space

   • Jun Guo
   • Yuexuan Wang
   • Weili Wu

   OriginalPaper 24 February 2009 Pages: 413 - 421

8. A polynomially solvable case of optimal linear extension problem of a poset

   • Biao Wu
   • Enyu Yao
   • Longcheng Liu

   OriginalPaper 24 February 2009 Pages: 422 - 428

9. On the max-weight edge coloring problem

   • Giorgio Lucarelli
   • Ioannis Milis
   • Vangelis T. Paschos

   OriginalPaper 14 March 2009 Pages: 429 - 442