1. An efficient local search algorithm for solving maximum edge weight clique problem in large graphs

   • Yi Chu
   • Boxiao Liu
   • Haihang You

   OriginalPaper 04 February 2020 Pages: 933 - 954

   

2. Co-density and fractional edge cover packing

   • Qiulan Zhao
   • Zhibin Chen
   • Jiajun Sang

   OriginalPaper 04 February 2020 Pages: 955 - 987

3. On the robustness of a synchronized multi-robot system

   • Sergey Bereg
   • Andrew Brunner
   • Mario A. Lopez

   OriginalPaper 07 February 2020 Pages: 988 - 1016

   

4. Maximum independent and disjoint coverage

   • Amit Kumar Dhar
   • Raghunath Reddy Madireddy
   • Jagpreet Singh

   OriginalPaper 14 February 2020 Pages: 1017 - 1037

   

5. Neighbour-distinguishing labellings of powers of paths and powers of cycles

   • Atílio G. Luiz
   • C. N. Campos
   • Diana Sasaki

   OriginalPaper 18 February 2020 Pages: 1038 - 1059

   

6. Two-machine flow shop scheduling with an operator non-availability period to minimize makespan

   • Dawei Li
   • Xiwen Lu

   OriginalPaper 23 February 2020 Pages: 1060 - 1078

   

7. Stabilizing social structure via modifying local patterns

   • Sajjad Salehi
   • Fattaneh Taghiyareh

   OriginalPaper 25 February 2020 Pages: 1079 - 1095

   

8. The quadratic cycle cover problem: special cases and efficient bounds

   • Frank de Meijer
   • Renata Sotirov

   OriginalPaper Open access 25 February 2020 Pages: 1096 - 1128

   

9. Local antimagic orientation of graphs

   • Yulin Chang
   • Fei Jing
   • Guanghui Wang

   OriginalPaper 27 February 2020 Pages: 1129 - 1152

   

10. Efficient reassembling of three-regular planar graphs

    • Assaf Kfoury
    • Laura Sisson

    OriginalPaper 07 March 2020 Pages: 1153 - 1207

    

11. A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice

    • Qingqin Nong
    • Jiazhu Fang
    • Xiaoying Qu

    OriginalPaper 12 March 2020 Pages: 1208 - 1220