Some further results on minimum distribution cost flow problems Haiyan LuEnyu YaoLiqun Qi OriginalPaper 17 May 2006 Pages: 351 - 371
A “maximum node clustering” problem Giuliana CarelloFederico Della CroceMarco Locatelli OriginalPaper 17 May 2006 Pages: 373 - 385
Inapproximability results for the lateral gene transfer problem Bhaskar DasguptaSergio FerrariniNisha Raj Paryani OriginalPaper 17 May 2006 Pages: 387 - 405
Strongly 2-shape-sortability of vector partitions Huilan ChangJunyi Guo OriginalPaper 17 May 2006 Pages: 407 - 410
A combinatorial theorem on labeling squares with points and its application Binhai ZhuMinghui Jiang OriginalPaper 17 May 2006 Pages: 411 - 420
Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem Vicky MakTommy Thomadsen OriginalPaper 17 May 2006 Pages: 421 - 434
Construction of the nearest neighbor embracing graph of a point set M. Y. ChanDanny Z. ChenCao An Wang OriginalPaper 17 May 2006 Pages: 435 - 443
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees Zemin JinMikio KanoBing Wei OriginalPaper 17 May 2006 Pages: 445 - 454
