Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2 Zengti LiSuogang GaoWeili Wu OriginalPaper 16 January 2009 Pages: 325 - 334
Separator-based data reduction for signed graph balancing Falk HüffnerNadja BetzlerRolf Niedermeier OriginalPaper 31 January 2009 Pages: 335 - 360
An approximation algorithm for the k-level capacitated facility location problem Donglei DuXing WangDachuan Xu OriginalPaper 27 January 2009 Pages: 361 - 368
Semi-online scheduling with known maximum job size on two uniform machines Qian CaoZhaohui Liu OriginalPaper 06 February 2009 Pages: 369 - 384
Strong formulation for the spot 5 daily photograph scheduling problem Glaydston Mattos RibeiroMiguel Fragoso ConstantinoLuiz Antonio Nogueira Lorena OriginalPaper 05 March 2009 Pages: 385 - 398
Polynomial time approximation schemes for minimum disk cover problems Chen LiaoShiyan Hu OriginalPaper 28 February 2009 Pages: 399 - 412
Constructing error-correcting pooling designs with symplectic space Jun GuoYuexuan WangWeili Wu OriginalPaper 24 February 2009 Pages: 413 - 421
A polynomially solvable case of optimal linear extension problem of a poset Biao WuEnyu YaoLongcheng Liu OriginalPaper 24 February 2009 Pages: 422 - 428
On the max-weight edge coloring problem Giorgio LucarelliIoannis MilisVangelis T. Paschos OriginalPaper 14 March 2009 Pages: 429 - 442