1. Efficient feature selection for logical analysis of large-scale multi-class datasets

   • Kedong Yan
   • Dongjing Miao
   • Chanying Huang

   OriginalPaper 09 April 2021 Pages: 1 - 23

   

2. (Strong) Total proper connection of some digraphs

   • Yingbin Ma
   • Kairui Nie

   OriginalPaper 16 April 2021 Pages: 24 - 39

   

3. Complexity results for two kinds of colored disconnections of graphs

   • You Chen
   • Ping Li
   • Yindi Weng

   OriginalPaper 16 April 2021 Pages: 40 - 55

   

4. Algorithmic aspects of 2-secure domination in graphs

   • Pavan Kumar Jakkepalli
   • Venkata Subba Reddy Palagiri

   OriginalPaper 16 April 2021 Pages: 56 - 70

   

5. A 3/2-approximation for big two-bar charts packing

   • Adil Erzin
   • Georgii Melidi
   • Roman Plotnikov

   OriginalPaper 18 April 2021 Pages: 71 - 84

   

6. Declawing a graph: polyhedra and Branch-and-Cut algorithms

   • Felipe C. Fragoso
   • Gilberto F. de Sousa Filho
   • Fábio Protti

   ReviewPaper 19 April 2021 Pages: 85 - 124

   

7. A unifying model for locally constrained spanning tree problems

   • Luiz Viana
   • Manoel Campêlo
   • Ana Silva

   OriginalPaper 19 April 2021 Pages: 125 - 150

   

8. Suboptimal sliding manifold For nonlinear supply chain with time delay

   • Sajjad Aslani Khiavi
   • Hamid Khaloozadeh
   • Fahimeh Soltanian

   OriginalPaper 21 April 2021 Pages: 151 - 173

   

9. Roman {k}-domination in trees and complexity results for some classes of graphs

   • Cai-Xia Wang
   • Yu Yang
   • Shou-Jun Xu

   OriginalPaper 22 April 2021 Pages: 174 - 186

   

10. Efficient algorithms for support path with time constraint

    • Lili Zhang
    • Cheng-Kuan Lin
    • Yuan-Hsiang Teng

    OriginalPaper 22 April 2021 Pages: 187 - 205