1. Approximation algorithms for two-stage flexible flow shop scheduling

   • Minghui Zhang
   • Yan Lan
   • Xin Han

   OriginalPaper 23 September 2019 Pages: 1 - 14

   

2. The seeding algorithm for k-means problem with penalties

   • Min Li
   • Dachuan Xu
   • Peng Zhang

   OriginalPaper 26 September 2019 Pages: 15 - 32

   

3. Less is more approach for competing groups scheduling with different learning effects

   • Baoyu Liao
   • Xingming Wang
   • Panos M. Pardalos

   OriginalPaper 04 October 2019 Pages: 33 - 54

   

4. Graphs with equal domination and covering numbers

   • Andrzej Lingas
   • Mateusz Miotk
   • Paweł Żyliński

   OriginalPaper Open access 25 October 2019 Pages: 55 - 71

   

5. Neighbor product distinguishing total colorings of 2-degenerate graphs

   • Enqiang Zhu
   • Chanjuan Liu
   • Jiguo Yu

   OriginalPaper 19 October 2019 Pages: 72 - 76

6. Bounds on upper transversals in hypergraphs

   • Michael A. Henning
   • Anders Yeo

   OriginalPaper 19 October 2019 Pages: 77 - 89

   

7. Algorithmic results on double Roman domination in graphs

   • S. Banerjee
   • Michael A. Henning
   • D. Pradhan

   OriginalPaper 19 October 2019 Pages: 90 - 114

   

8. On the extremal graphs with respect to the total reciprocal edge-eccentricity

   • Lifang Zhao
   • Hongshuai Li
   • Yuping Gao

   OriginalPaper 21 October 2019 Pages: 115 - 137

   

9. Approximation algorithm for a generalized Roman domination problem in unit ball graphs

   • Limin Wang
   • Yalin Shi
   • Xiaoyan Zhang

   OriginalPaper 24 October 2019 Pages: 138 - 148

   

10. Remarks on Barnette’s conjecture

    • Jan Florek

    OriginalPaper Open access 11 November 2019 Pages: 149 - 155

    

11. Tree-coloring problems of bounded treewidth graphs

    • Bi Li
    • Xin Zhang

    OriginalPaper 19 October 2019 Pages: 156 - 169

    

12. The structure of graphs with given number of blocks and the maximum Wiener index

    • Stéphane Bessy
    • François Dross
    • Riste Škrekovski

    OriginalPaper 24 October 2019 Pages: 170 - 184

    

13. Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs

    • Shuwan Zhu
    • Wenjuan Fan
    • Panos M. Pardalos

    OriginalPaper 29 October 2019 Pages: 185 - 215

    

14. Efficient algorithms for measuring the funnel-likeness of DAGs

    • Marcelo Garlet Millani
    • Hendrik Molter
    • Manuel Sorge

    OriginalPaper 07 November 2019 Pages: 216 - 245

    

15. Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve

    • Jingjing Huo
    • Yiqiao Wang
    • Wenjing Xia

    OriginalPaper 22 October 2019 Pages: 246 - 272

    

16. On the König deficiency of zero-reducible graphs

    • Miklós Bartha
    • Miklós Krész

    OriginalPaper Open access 06 November 2019 Pages: 273 - 292

    

17. Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13

    • Chao Song
    • Changqing Xu

    OriginalPaper 07 November 2019 Pages: 293 - 303