1. The k-metric dimension

   • Ron Adar
   • Leah Epstein

   OriginalPaper 01 September 2016 Pages: 1 - 30

   

2. Lawler’s minmax cost problem under uncertainty

   • Nadia Brauner
   • Gerd Finke
   • Yakov Shafransky

   OriginalPaper 02 July 2016 Pages: 31 - 46

3. Parameterized algorithms for min–max 2-cluster editing

   • Li-Hsuan Chen
   • Bang Ye Wu

   OriginalPaper 19 July 2016 Pages: 47 - 63

   

4. Neighbor sum distinguishing total coloring of 2-degenerate graphs

   • Jingjing Yao
   • Xiaowei Yu
   • Changqing Xu

   OriginalPaper 07 July 2016 Pages: 64 - 70

   

5. An exact semidefinite programming approach for the max-mean dispersion problem

   • Michele Garraffa
   • Federico Della Croce
   • Fabio Salassa

   OriginalPaper 26 August 2016 Pages: 71 - 93

   

6. On zero-sum \(\mathbb {Z}_{2j}^k\)-magic graphs

   • J. P. Georges
   • D. Mauro
   • K. Wash

   OriginalPaper 30 August 2016 Pages: 94 - 113

   

7. Modified linear programming and class 0 bounds for graph pebbling

   • Daniel W. Cranston
   • Luke Postle
   • Carl Yerger

   OriginalPaper 20 July 2016 Pages: 114 - 132

   

8. Minimizing the number of tardy jobs in two-machine settings with common due date

   • Federico Della Croce
   • Christos Koulamas
   • Vincent T’kindt

   OriginalPaper 12 July 2016 Pages: 133 - 140

   

9. On minimally 2-connected graphs with generalized connectivity \(\kappa _{3}=2\)

   • Shasha Li
   • Wei Li
   • Haina Sun

   OriginalPaper 06 September 2016 Pages: 141 - 164

   

10. Upper bounds of proper connection number of graphs

    • Fei Huang
    • Xueliang Li
    • Shujing Wang

    OriginalPaper 07 July 2016 Pages: 165 - 173

11. Note on incidence chromatic number of subquartic graphs

    • Petr Gregor
    • Borut Lužar
    • Roman Soták

    OriginalPaper 27 August 2016 Pages: 174 - 181

    

12. Rainbow connection numbers of Cayley graphs

    • Yingbin Ma
    • Zaiping Lu

    OriginalPaper 04 July 2016 Pages: 182 - 193

13. The thickness of the complete multipartite graphs and the join of graphs

    • Yichao Chen
    • Yan Yang

    OriginalPaper 14 July 2016 Pages: 194 - 202

    

14. A faster strongly polynomial time algorithm to solve the minimum cost tension problem

    • Mehdi Ghiyasvand

    OriginalPaper 25 August 2016 Pages: 203 - 217

    

15. The minimum value of geometric-arithmetic index of graphs with minimum degree 2

    • Mahdi Sohrabi-Haghighat
    • Mohammadreza Rostami

    OriginalPaper 08 August 2016 Pages: 218 - 232

    

16. Characterizations of k-cutwidth critical trees

    • Zhen-Kun Zhang
    • Hong-Jian Lai

    OriginalPaper 20 July 2016 Pages: 233 - 244

    

17. Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields

    • Yingmo Jie
    • Cheng Guo
    • Zhangjie Fu

    OriginalPaper 23 August 2016 Pages: 245 - 256

    

18. Total coloring of planar graphs without adjacent chordal 6-cycles

    • Huijuan Wang
    • Bin Liu
    • Hongwei Gao

    OriginalPaper 03 September 2016 Pages: 257 - 265

    

19. Approximation algorithms for k-level stochastic facility location problems

    • Lucas P. Melo
    • Flávio K. Miyazawa
    • Rafael C. S. Schouery

    OriginalPaper 12 August 2016 Pages: 266 - 278

    

20. Maximizing target-temporal coverage of mission-driven camera sensor networks

    • Yi Hong
    • Deying Li
    • Alade O. Tokuta

    OriginalPaper 25 August 2016 Pages: 279 - 301

    

21. Local ratio method on partial set multi-cover

    • Yingli Ran
    • Yishuo Shi
    • Zhao Zhang

    OriginalPaper 17 August 2016 Pages: 302 - 313

    

22. Centralized and decentralized rumor blocking problems

    • Xin Chen
    • Qingqin Nong
    • Ker-I Ko

    OriginalPaper 17 August 2016 Pages: 314 - 329