1. Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect

   • Dexin Zou
   • Chong Jiang
   • Weiwei Liu

   OriginalPaper 04 August 2020 Pages: 861 - 868

2. Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)

   • Brahim Chaourar

   OriginalPaper 10 August 2020 Pages: 869 - 875

3. A characterization of optimal multiprocessor schedules and new dominance rules

   • Rico Walter
   • Alexander Lawrinenko

   OriginalPaper Open access 12 August 2020 Pages: 876 - 900

   

4. A short proof for stronger version of DS decomposition in set function optimization

   • Xiang Li
   • H. George Du

   OriginalPaper 19 August 2020 Pages: 901 - 906

5. Influence maximization problem: properties and algorithms

   • Wenguo Yang
   • Yapu Zhang
   • Ding-Zhu Du

   OriginalPaper 26 August 2020 Pages: 907 - 928

   

6. New approximation algorithms for machine scheduling with rejection on single and parallel machine

   • Peihai Liu
   • Xiwen Lu

   OriginalPaper 01 September 2020 Pages: 929 - 952

7. General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number

   • Tomáš Vetrík
   • Selvaraj Balachandran

   OriginalPaper 01 September 2020 Pages: 953 - 973

   

8. Online maximum matching with recourse

   • Spyros Angelopoulos
   • Christoph Dürr
   • Shendan Jin

   OriginalPaper 03 September 2020 Pages: 974 - 1007

   

9. Some algorithmic results for finding compatible spanning circuits in edge-colored graphs

   • Zhiwei Guo
   • Hajo Broersma
   • Shenggui Zhang

   OriginalPaper Open access 04 September 2020 Pages: 1008 - 1019

   

10. Intersecting families in \(\left( {\begin{array}{c}{[m]}\\ \ell \end{array}}\right) \cup \left( {\begin{array}{c}{[n]}\\ k\end{array}}\right) \)

    • Jun Wang
    • Huajun Zhang

    OriginalPaper 12 September 2020 Pages: 1020 - 1029

11. A linear time algorithm for the p-maxian problem on trees with distance constraint

    • Trung Kien Nguyen
    • Nguyen Thanh Hung
    • Huong Nguyen-Thu

    OriginalPaper 14 September 2020 Pages: 1030 - 1043

    

12. Minimizing maximum delivery completion time for order scheduling with rejection

    • Ren-Xia Chen
    • Shi-Sheng Li

    OriginalPaper 16 September 2020 Pages: 1044 - 1064

13. An approximation algorithm for submodular hitting set problem with linear penalties

    • Shaojing Du
    • Suogang Gao
    • Wen Liu

    OriginalPaper 25 September 2020 Pages: 1065 - 1074

14. Partial inverse min–max spanning tree problem

    • Javad Tayyebi
    • Ali Reza Sepasian

    OriginalPaper 27 September 2020 Pages: 1075 - 1091

    

15. Maximizing user type diversity for task assignment in crowdsourcing

    • Ana Wang
    • Meirui Ren
    • Longjiang Guo

    OriginalPaper 03 October 2020 Pages: 1092 - 1120

    

16. The maximum Wiener index of maximal planar graphs

    • Debarun Ghosh
    • Ervin Győri
    • Oscar Zamora

    OriginalPaper Open access 03 October 2020 Pages: 1121 - 1135