1. Improved algorithmic results for unsplittable stable allocation problems

   • Ágnes Cseh
   • Brian C. Dean

   OriginalPaper 05 May 2015 Pages: 657 - 671

   

2. Solving constrained optimization problems by solution-based decomposition search

   • Amine Lamine
   • Mahdi Khemakhem
   • Habib Chabchoub

   OriginalPaper 09 May 2015 Pages: 672 - 695

   

3. Robustness of power-law networks: its assessment and optimization

   • Huiling Zhang
   • Yilin Shen
   • My T. Thai

   OriginalPaper 14 May 2015 Pages: 696 - 720

   

4. On strongly planar not-all-equal 3SAT

   • Ali Dehghan

   OriginalPaper 12 May 2015 Pages: 721 - 724

5. Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs

   • Shasha Ma
   • Liancui Zuo

   OriginalPaper 13 May 2015 Pages: 725 - 740

   

6. The extremal spectral radii of \(k\)-uniform supertrees

   • Honghai Li
   • Jia-Yu Shao
   • Liqun Qi

   OriginalPaper 20 May 2015 Pages: 741 - 764

7. A combinatorial proof for the circular chromatic number of Kneser graphs

   • Daphne Der-Fen Liu
   • Xuding Zhu

   OriginalPaper 16 May 2015 Pages: 765 - 774

   

8. First-Fit colorings of graphs with no cycles of a prescribed even length

   • Manouchehr Zaker
   • Hossein Soltani

   OriginalPaper 14 May 2015 Pages: 775 - 783

9. Scheduling two job families on a single machine with two competitive agents

   • Shi-Sheng Li
   • Ren-Xia Chen
   • Qi Feng

   OriginalPaper 19 May 2015 Pages: 784 - 799

10. Characterisation of forests with trivial game domination numbers

    • M. J. Nadjafi-Arani
    • Mark Siggers
    • Hossein Soltani

    OriginalPaper 24 May 2015 Pages: 800 - 811

    

11. A minimized-rule based approach for improving data currency

    • Mohan Li
    • Jianzhong Li

    OriginalPaper 24 May 2015 Pages: 812 - 841

    

12. The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation

    • Sabine Büttner
    • Sven O. Krumke

    OriginalPaper 22 May 2015 Pages: 842 - 854

    

13. Signed total Roman domination in graphs

    • Lutz Volkmann

    OriginalPaper 22 May 2015 Pages: 855 - 871

14. The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance

    • Kien Trung Nguyen
    • Ali Reza Sepasian

    OriginalPaper 24 May 2015 Pages: 872 - 884

    

15. Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period

    • Natashia Boland
    • Thomas Kalinowski
    • Simranjit Kaur

    OriginalPaper 29 May 2015 Pages: 885 - 905

    

16. Neighbor sum distinguishing total choosability of planar graphs

    • Cunquan Qu
    • Guanghui Wang
    • Xiaowei Yu

    OriginalPaper 02 June 2015 Pages: 906 - 916

    

17. Finding a contra-risk path between two nodes in undirected graphs

    • Mehdi Ghiyasvand
    • Iman Keshtkar

    OriginalPaper 04 June 2015 Pages: 917 - 926

    

18. A \((3,1)^{*}\)-choosable theorem on planar graphs

    • Min Chen
    • André Raspaud
    • Weifan Wang

    OriginalPaper 13 June 2015 Pages: 927 - 940

    

19. Maximum size of digraphs with some parameters

    • Huiqiu Lin
    • Jinlong Shu
    • Baoyindureng Wu

    OriginalPaper 09 June 2015 Pages: 941 - 950

20. Packing feedback arc sets in reducible flow graphs

    • Han Xiao

    OriginalPaper 20 June 2015 Pages: 951 - 959

    

21. A diagnosis algorithm by using graph-coloring under the PMC model

    • Qiang Zhu
    • Guodong Guo
    • Cun-Quan Zhang

    OriginalPaper 28 June 2015 Pages: 960 - 969

    

22. Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval

    • Imed Kacem
    • Hans Kellerer
    • Maryam Seifaddini

    OriginalPaper 16 July 2015 Pages: 970 - 981