1. Price of dependence: stochastic submodular maximization with dependent items

   • Shaojie Tang

   OriginalPaper 29 October 2019 Pages: 305 - 314

   

2. The average covering tree value for directed graph games

   • Anna Khmelnitskaya
   • Özer Selçuk
   • Dolf Talman

   OriginalPaper Open access 30 October 2019 Pages: 315 - 333

   

3. On the edge metric dimension of convex polytopes and its related graphs

   • Yuezhong Zhang
   • Suogang Gao

   OriginalPaper 28 October 2019 Pages: 334 - 350

   

4. The Wiener index of hypergraphs

   • Xiangxiang Liu
   • Ligong Wang
   • Xihe Li

   OriginalPaper 31 October 2019 Pages: 351 - 364

5. On the zero forcing number of a graph involving some classical parameters

   • Shuchao Li
   • Wanting Sun

   OriginalPaper 07 November 2019 Pages: 365 - 384

   

6. A new approximate cluster deletion algorithm for diamond-free graphs

   • Sabrine Malek
   • Wady Naanaa

   OriginalPaper 02 November 2019 Pages: 385 - 411

   

7. On the total neighbour sum distinguishing index of graphs with bounded maximum average degree

   • H. Hocquard
   • J. Przybyło

   OriginalPaper 20 November 2019 Pages: 412 - 424

   

8. Domination and matching in power and generalized power hypergraphs

   • Yanxia Dong
   • Moo Young Sohn
   • Zuosong Liang

   OriginalPaper 16 November 2019 Pages: 425 - 436

   

9. Nontrivial path covers of graphs: existence, minimization and maximization

   • Renzo Gómez
   • Yoshiko Wakabayashi

   OriginalPaper 30 November 2019 Pages: 437 - 456

   

10. Degree bounded bottleneck spanning trees in three dimensions

    • Patrick J. Andersen
    • Charl J. Ras

    OriginalPaper 29 November 2019 Pages: 457 - 491

    

11. Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem

    • Jianping Li
    • Suding Liu
    • Yujie Zheng

    OriginalPaper 30 November 2019 Pages: 492 - 508

    

12. A new upper bound on the work function algorithm for the k-server problem

    • Wenming Zhang
    • Yongxi Cheng

    OriginalPaper 28 November 2019 Pages: 509 - 518

13. Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain

    • Chunmei Ma
    • Dan Huang

    OriginalPaper 09 December 2019 Pages: 519 - 546

    

14. A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm

    • Wenjuan Fan
    • Yi Wang
    • Guixian Tong

    OriginalPaper 07 December 2019 Pages: 547 - 580

    

15. Equitable partition of graphs into induced linear forests

    • Xin Zhang
    • Bei Niu

    OriginalPaper 02 December 2019 Pages: 581 - 588

16. On alternating paths and the smallest positive eigenvalue of trees

    • Sonu Rani
    • Sasmita Barik

    OriginalPaper 12 December 2019 Pages: 589 - 601

    

17. A new leader guided optimization for the flexible job shop problem

    • Fraj Naifar
    • Mariem Gzara
    • Moalla Taicir Loukil

    OriginalPaper 03 January 2019 Pages: 602 - 617

    

18. Local search strikes again: PTAS for variants of geometric covering and packing

    • Pradeesha Ashok
    • Aniket Basu Roy
    • Sathish Govindarajan

    OriginalPaper 21 June 2019 Pages: 618 - 635