1. A lower bound for the adaptive two-echelon capacitated vehicle routing problem

   • Liang Song
   • Hao Gu
   • Hejiao Huang

   OriginalPaper 13 May 2016 Pages: 1145 - 1167

   

2. Optimal RSUs deployment with delay bound along highways in VANET

   • Chunyan Liu
   • Hejiao Huang
   • Hongwei Du

   OriginalPaper 19 May 2016 Pages: 1168 - 1182

   

3. A tighter insertion-based approximation of the crossing number

   • Markus Chimani
   • Petr Hliněný

   OriginalPaper 25 May 2016 Pages: 1183 - 1225

   

4. Maximum flows in generalized processing networks

   • Michael Holzhauser
   • Sven O. Krumke
   • Clemens Thielen

   OriginalPaper 21 May 2016 Pages: 1226 - 1256

   

5. Lambda number for the direct product of some family of graphs

   • Byeong Moon Kim
   • Yoomi Rho
   • Byung Chul Song

   OriginalPaper 21 May 2016 Pages: 1257 - 1265

   

6. Paired-domination number of claw-free odd-regular graphs

   • Wei Yang
   • Xinhui An
   • Baoyindureng Wu

   OriginalPaper 26 May 2016 Pages: 1266 - 1275

   

7. Optimal RSUs placement with delay bounded message dissemination in vehicular networks

   • Chunyan Liu
   • Hejiao Huang
   • Xiaohua Jia

   OriginalPaper 01 June 2016 Pages: 1276 - 1299

   

8. Approximation of knapsack problems with conflict and forcing graphs

   • Ulrich Pferschy
   • Joachim Schauer

   OriginalPaper Open access 06 June 2016 Pages: 1300 - 1323

9. On the coefficients of the independence polynomial of graphs

   • Shuchao Li
   • Lin Liu
   • Yueyu Wu

   OriginalPaper 15 July 2016 Pages: 1324 - 1342

10. Even factors of graphs

    • Jian Cheng
    • Cun-Quan Zhang
    • Bao-Xuan Zhu

    OriginalPaper 17 June 2016 Pages: 1343 - 1353

    

11. Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable

    • Ying Bai
    • Xiangwen Li
    • Gexin Yu

    OriginalPaper 13 June 2016 Pages: 1354 - 1364

12. A new graph parameter and a construction of larger graph without increasing radio k-chromatic number

    • Ushnish Sarkar
    • Avishek Adhikari

    OriginalPaper 18 June 2016 Pages: 1365 - 1377

    

13. Bounds for the traveling salesman paths of two-dimensional modular lattices

    • Florian Pausinger

    OriginalPaper 21 June 2016 Pages: 1378 - 1394

    

14. A new effective branch-and-bound algorithm to the high order MIMO detection problem

    • Ye Tian
    • Ke Li
    • Zhiyong Li

    OriginalPaper 28 June 2016 Pages: 1395 - 1410

    

15. A new upper bound for the online square packing problem in a strip

    • Guosong Yu
    • Yanling Mao
    • Jiaoliao Xiao

    OriginalPaper 23 June 2016 Pages: 1411 - 1420

    

16. On irreducible no-hole L(2, 1)-coloring of subdivision of graphs

    • Nibedita Mandal
    • Pratima Panigrahi

    OriginalPaper 27 June 2016 Pages: 1421 - 1442

    

17. The (vertex-)monochromatic index of a graph

    • Xueliang Li
    • Di Wu

    OriginalPaper 28 June 2016 Pages: 1443 - 1453

    

18. A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

    • Baruch Mor
    • Gur Mosheiov

    OriginalPaper 29 June 2016 Pages: 1454 - 1468

    

19. The solution of a generalized secretary problem via analytic expressions

    • Adam Woryna

    OriginalPaper Open access 27 June 2016 Pages: 1469 - 1491