1. Lower bounds for independence numbers of some locally sparse graphs

   • Yusheng Li
   • Qizhong Lin

   OriginalPaper 08 December 2012 Pages: 717 - 725

2. Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees

   • Asaf Levin
   • Uri Yovel

   OriginalPaper 11 December 2012 Pages: 726 - 747

   

3. 2-Rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)

   • Zofia Stępień
   • Maciej Zwierzchowski

   OriginalPaper Open access 14 December 2012 Pages: 748 - 755

   

4. Strategyproof mechanism design for facility location games with weighted agents on a line

   • Qiang Zhang
   • Minming Li

   OriginalPaper 27 February 2013 Pages: 756 - 773

5. Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable

   • Lingji Xu
   • Zhengke Miao
   • Yingqian Wang

   OriginalPaper 23 January 2013 Pages: 774 - 786

   

6. \(\lambda \)-numbers of several classes of snarks

   • Dengju Ma
   • Hengfeng Zhu
   • Jianbao He

   OriginalPaper 29 December 2012 Pages: 787 - 799

   

7. Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion

   • Hsing-Yen Ann
   • Chang-Biau Yang
   • Chiou-Ting Tseng

   OriginalPaper 03 January 2013 Pages: 800 - 813

   

8. On metric dimension of permutation graphs

   • Michael Hallaway
   • Cong X. Kang
   • Eunjeong Yi

   OriginalPaper 03 January 2013 Pages: 814 - 826

   

9. 2-Distance paired-dominating number of graphs

   • Kan Yu
   • Mei Lu

   OriginalPaper 05 January 2013 Pages: 827 - 836

10. Algorithms for the minimum diameter terminal Steiner tree problem

    • Wei Ding
    • Ke Qiu

    OriginalPaper 03 January 2013 Pages: 837 - 853

    

11. An upper bound of Heilbronn number for eight points in triangles

    • Liangyu Chen
    • Zhenbing Zeng
    • Wei Zhou

    OriginalPaper 08 January 2013 Pages: 854 - 874

    

12. Online scheduling with rejection and reordering: exact algorithms for unit size jobs

    • Leah Epstein
    • Hanan Zebedat-Haider

    OriginalPaper 09 January 2013 Pages: 875 - 892

    

13. Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

    • Chengchao Yan
    • Danjun Huang
    • Weifan Wang

    OriginalPaper 26 January 2013 Pages: 893 - 909

    

14. Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable

    • Chenxia Zhao
    • Xianyue Li

    OriginalPaper 02 February 2013 Pages: 910 - 916