Efficient feature selection for logical analysis of large-scale multi-class datasets Kedong YanDongjing MiaoChanying Huang OriginalPaper 09 April 2021 Pages: 1 - 23
(Strong) Total proper connection of some digraphs Yingbin MaKairui Nie OriginalPaper 16 April 2021 Pages: 24 - 39
Complexity results for two kinds of colored disconnections of graphs You ChenPing LiYindi Weng OriginalPaper 16 April 2021 Pages: 40 - 55
Algorithmic aspects of 2-secure domination in graphs Pavan Kumar JakkepalliVenkata Subba Reddy Palagiri OriginalPaper 16 April 2021 Pages: 56 - 70
A 3/2-approximation for big two-bar charts packing Adil ErzinGeorgii MelidiRoman Plotnikov OriginalPaper 18 April 2021 Pages: 71 - 84
Declawing a graph: polyhedra and Branch-and-Cut algorithms Felipe C. FragosoGilberto F. de Sousa FilhoFábio Protti ReviewPaper 19 April 2021 Pages: 85 - 124
A unifying model for locally constrained spanning tree problems Luiz VianaManoel CampêloAna Silva OriginalPaper 19 April 2021 Pages: 125 - 150
Suboptimal sliding manifold For nonlinear supply chain with time delay Sajjad Aslani KhiaviHamid KhaloozadehFahimeh Soltanian OriginalPaper 21 April 2021 Pages: 151 - 173
Roman {k}-domination in trees and complexity results for some classes of graphs Cai-Xia WangYu YangShou-Jun Xu OriginalPaper 22 April 2021 Pages: 174 - 186
Efficient algorithms for support path with time constraint Lili ZhangCheng-Kuan LinYuan-Hsiang Teng OriginalPaper 22 April 2021 Pages: 187 - 205