1. \(L(2,1)\)-labeling for brick product graphs

   • Zehui Shao
   • Jin Xu
   • Roger K. Yeh

   OriginalPaper 12 June 2014 Pages: 447 - 462

   

2. On the best possible competitive ratio for the multislope ski-rental problem

   • Hiroshi Fujiwara
   • Takuma Kitano
   • Toshihiro Fujito

   OriginalPaper 14 June 2014 Pages: 463 - 490

   

3. On single machine scheduling with resource constraint

   • Lidong Wu
   • Cong-Dian Cheng

   OriginalPaper 20 June 2014 Pages: 491 - 505

   

4. Integral packing of branchings in capacitaded digraphs

   • Mario Leston-Rey

   OriginalPaper 28 June 2014 Pages: 506 - 514

   

5. Multi-depot vehicle routing problem with time windows under shared depot resources

   • Jian Li
   • Yang Li
   • Panos M. Pardalos

   OriginalPaper 05 July 2014 Pages: 515 - 532

   

6. Crossing edges and faces of line arrangements in the plane

   • Rom Pinchasi

   OriginalPaper 11 July 2014 Pages: 533 - 545

7. Modified differential evolution with self-adaptive parameters method

   • Xiangtao Li
   • Minghao Yin

   OriginalPaper 22 July 2014 Pages: 546 - 576

   

8. Verifying safety critical task scheduling systems in PPTL axiom system

   • Nan Zhang
   • Mengfei Yang
   • Cong Tian

   OriginalPaper 30 July 2014 Pages: 577 - 603

   

9. \(L(j,k)\)-labeling number of Cartesian product of path and cycle

   • Qiong Wu
   • Wai Chee Shiu
   • Pak Kiu Sun

   OriginalPaper 02 August 2014 Pages: 604 - 634

   

10. Extremal polyomino chains with respect to general Randić index

    • Mingqiang An
    • Liming Xiong

    OriginalPaper 06 August 2014 Pages: 635 - 647

    

11. Further results on the reciprocal degree distance of graphs

    • Shuchao Li
    • Huihui Zhang
    • Minjie Zhang

    OriginalPaper 08 August 2014 Pages: 648 - 668

    

12. Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph

    • M. Reza Khani
    • Mohammad R. Salavatipour

    OriginalPaper 13 August 2014 Pages: 669 - 685

    

13. Semi-online scheduling with combined information on two identical machines in parallel

    • Qian Cao
    • Guohua Wan

    OriginalPaper 13 August 2014 Pages: 686 - 695

    

14. Approximation algorithms for minimum weight partial connected set cover problem

    • Dongyue Liang
    • Zhao Zhang
    • Yaolin Jiang

    OriginalPaper 20 August 2014 Pages: 696 - 712

    

15. 2-Edge connected dominating sets and 2-Connected dominating sets of a graph

    • Hengzhe Li
    • Yuxing Yang
    • Baoyindureng Wu

    OriginalPaper 21 August 2014 Pages: 713 - 724

    

16. Power domination with bounded time constraints

    • Chung-Shou Liao

    OriginalPaper 23 August 2014 Pages: 725 - 742

    

17. Team selection for prediction tasks

    • MohammadAmin Fazli
    • Azin Ghazimatin
    • Hamid Haghshenas

    OriginalPaper 31 August 2014 Pages: 743 - 757

    

18. Degree-constrained orientations of embedded graphs

    • Yann Disser
    • Jannik Matuschke

    OriginalPaper 02 September 2014 Pages: 758 - 773

    

19. Scheduling dedicated jobs with variative processing times

    • Maksim Barketau
    • Erwin Pesch
    • Yakov Shafransky

    OriginalPaper 03 September 2014 Pages: 774 - 785

    

20. Bounding the scaling window of random constraint satisfaction problems

    • Jing Shen
    • Yaofeng Ren

    OriginalPaper 17 September 2014 Pages: 786 - 801

    

21. Algorithms for finding maximum transitive subtournaments

    • Lasse Kiviluoto
    • Patric R. J. Östergård
    • Vesa P. Vaskelainen

    OriginalPaper 20 September 2014 Pages: 802 - 814

    

22. Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis

    • Chun-Ying Chiang
    • Wei-Ting Huang
    • Hong-Gwa Yeh

    OriginalPaper 20 September 2014 Pages: 815 - 832

    

23. Two cases of polynomial-time solvability for the coloring problem

    • D. S. Malyshev

    OriginalPaper 23 September 2014 Pages: 833 - 845

    

24. An approximation algorithm for the partial vertex cover problem in hypergraphs

    • Mourad El Ouali
    • Helena Fohlin
    • Anand Srivastav

    OriginalPaper 26 September 2014 Pages: 846 - 864

    

25. \(k\)-Power domination in block graphs

    • Chao Wang
    • Lei Chen
    • Changhong Lu

    OriginalPaper 26 September 2014 Pages: 865 - 873

    

26. Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs

    • Yi Wang
    • Jian Cheng
    • Gregory Mulley

    OriginalPaper 26 September 2014 Pages: 874 - 880

27. Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs

    • Yanming Chang
    • Yuejian Peng
    • Yuping Yao

    OriginalPaper 27 September 2014 Pages: 881 - 892

28. A sufficient condition for a tree to be \((\Delta +1)\)-\((2,1)\)-totally labelable

    • Zhengke Miao
    • Qiaojun Shu
    • Dong Chen

    OriginalPaper 30 September 2014 Pages: 893 - 901

    

29. Acyclic 3-coloring of generalized Petersen graphs

    • Enqiang Zhu
    • Zepeng Li
    • Chanjuan Liu

    OriginalPaper 05 October 2014 Pages: 902 - 911

    

30. Degree conditions for weakly geodesic pancyclic graphs and their exceptions

    • Emlee W. Nicholson
    • Bing Wei

    OriginalPaper 11 October 2014 Pages: 912 - 917

31. Evaluating entity-description conflict on duplicated data

    • Lingli Li
    • Jianzhong Li
    • Hong Gao

    OriginalPaper 14 October 2014 Pages: 918 - 941