1. Some further results on minimum distribution cost flow problems

   • Haiyan Lu
   • Enyu Yao
   • Liqun Qi

   OriginalPaper 17 May 2006 Pages: 351 - 371

2. A “maximum node clustering” problem

   • Giuliana Carello
   • Federico Della Croce
   • Marco Locatelli

   OriginalPaper 17 May 2006 Pages: 373 - 385

3. Inapproximability results for the lateral gene transfer problem

   • Bhaskar Dasgupta
   • Sergio Ferrarini
   • Nisha Raj Paryani

   OriginalPaper 17 May 2006 Pages: 387 - 405

4. Strongly 2-shape-sortability of vector partitions

   • Huilan Chang
   • Junyi Guo

   OriginalPaper 17 May 2006 Pages: 407 - 410

5. A combinatorial theorem on labeling squares with points and its application

   • Binhai Zhu
   • Minghui Jiang

   OriginalPaper 17 May 2006 Pages: 411 - 420

6. Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

   • Vicky Mak
   • Tommy Thomadsen

   OriginalPaper 17 May 2006 Pages: 421 - 434

7. Construction of the nearest neighbor embracing graph of a point set

   • M. Y. Chan
   • Danny Z. Chen
   • Cao An Wang

   OriginalPaper 17 May 2006 Pages: 435 - 443

8. Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

   • Zemin Jin
   • Mikio Kano
   • Bing Wei

   OriginalPaper 17 May 2006 Pages: 445 - 454