1. A bicriteria approach to scheduling a single machine with job rejection and positional penalties

   • Dvir Shabtay
   • Nufar Gaspar
   • Liron Yedidsion

   OriginalPaper 16 September 2010 Pages: 395 - 424

2. A combinatorial model and algorithm for globally searching community structure in complex networks

   • Xiang-Sun Zhang
   • Zhenping Li
   • Yong Wang

   OriginalPaper 15 October 2010 Pages: 425 - 442

3. A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs

   • Xu Zhu
   • Wei Wang
   • Weili Wu

   OriginalPaper 07 October 2010 Pages: 443 - 450

4. Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks

   • Wei Zhang
   • Zhao Zhang
   • Wonjun Lee

   OriginalPaper 07 October 2010 Pages: 451 - 461

5. Hamiltonian numbers of Möbius double loop networks

   • Gerard J. Chang
   • Ting-Pang Chang
   • Li-Da Tong

   OriginalPaper 14 October 2010 Pages: 462 - 470

6. Fault-tolerant diameter for three family interconnection networks

   • Tongliang Shi
   • Mei Lu

   OriginalPaper 27 October 2010 Pages: 471 - 482

7. An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration

   • Ming Liu
   • Feifeng Zheng
   • Jiantong Zhang

   OriginalPaper 27 October 2010 Pages: 483 - 492

8. Exact and approximation algorithms for the complementary maximal strip recovery problem

   • Haitao Jiang
   • Zhong Li
   • Binhai Zhu

   OriginalPaper 13 November 2010 Pages: 493 - 506

9. Perfect matchings in paired domination vertex critical graphs

   • Shenwei Huang
   • Erfang Shan
   • Liying Kang

   OriginalPaper 10 December 2010 Pages: 507 - 518

10. Minimum common string partition revisited

    • Haitao Jiang
    • Binhai Zhu
    • Hong Zhu

    OriginalPaper 04 December 2010 Pages: 519 - 527

11. Algorithms for the minimum weight k-fold (connected) dominating set problem

    • Wenkai Ma
    • Deying Li
    • Zhao Zhang

    OriginalPaper 03 December 2010 Pages: 528 - 540