1. A randomized competitive group testing procedure

   • Guiqing Zhang
   • Yongxi Cheng
   • Yinfeng Xu

   OriginalPaper 13 November 2017 Pages: 667 - 683

   

2. Minimal path decomposition of complete bipartite graphs

   • Costas K. Constantinou
   • Georgios Ellinas

   OriginalPaper 14 November 2017 Pages: 684 - 702

   

3. The Best-or-Worst and the Postdoc problems

   • L. Bayón
   • P. Fortuny Ayuso
   • M. M. Ruiz

   OriginalPaper 16 November 2017 Pages: 703 - 723

4. Sparse multipartite graphs as partition universal for graphs with bounded degree

   • Qizhong Lin
   • Yusheng Li

   OriginalPaper 16 November 2017 Pages: 724 - 739

5. An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs

   • Xing Feng
   • Lianzhu Zhang
   • Mingzu Zhang

   OriginalPaper 28 November 2017 Pages: 740 - 753

   

6. Special cases of the quadratic shortest path problem

   • Hao Hu
   • Renata Sotirov

   OriginalPaper Open access 28 November 2017 Pages: 754 - 777

   

7. Neighbor sum distinguishing list total coloring of subcubic graphs

   • You Lu
   • Chuandong Xu
   • Zhengke Miao

   OriginalPaper 14 December 2017 Pages: 778 - 793

8. Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem

   • Asaf Levin
   • Aleksander Vainer

   OriginalPaper 14 December 2017 Pages: 794 - 813

   

9. The Wiener index of Sierpiński-like graphs

   • Chunmei Luo
   • Liancui Zuo
   • Philip B. Zhang

   OriginalPaper 16 December 2017 Pages: 814 - 841

   

10. Critical objective function values in linear sum assignment problems

    • Ivan Belik
    • Kurt Jornsten

    OriginalPaper 16 December 2017 Pages: 842 - 852

11. The matching extension problem in general graphs is co-NP-complete

    • Jan Hackfeld
    • Arie M. C. A. Koster

    OriginalPaper 21 December 2017 Pages: 853 - 859

    

12. Race to idle or not: balancing the memory sleep time with DVS for energy minimization

    • Chenchen Fu
    • Vincent Chau
    • Chun Jason Xue

    OriginalPaper 22 December 2017 Pages: 860 - 894

    

13. Complexity and inapproximability results for the Power Edge Set problem

    • Sonia Toubaline
    • Claudia D’Ambrosio
    • Hadas Shachnai

    OriginalPaper 27 December 2017 Pages: 895 - 905

    

14. Generalized acyclic edge colorings via entropy compression

    • Laihao Ding
    • Guanghui Wang
    • Jianliang Wu

    OriginalPaper 03 January 2018 Pages: 906 - 920

    

15. Reliability evaluation of a multicast over coded packet networks

    • M. A. Raayatpanah
    • P. M. Pardalos

    OriginalPaper 04 January 2018 Pages: 921 - 940

    

16. Online covering salesman problem

    • Huili Zhang
    • Yinfeng Xu

    OriginalPaper 12 January 2018 Pages: 941 - 954

    

17. An approximation algorithm for maximum internal spanning tree

    • Zhi-Zhong Chen
    • Youta Harada
    • Lusheng Wang

    OriginalPaper 15 January 2018 Pages: 955 - 979

    

18. Planar graphs without chordal 5-cycles are 2-good

    • Weifan Wang
    • Tingting Wu
    • Yiqiao Wang

    OriginalPaper 29 January 2018 Pages: 980 - 996