Edge-disjoint spanning trees and the number of maximum state circles of a graph Xiaoli MaBaoyindureng WuXian’an Jin OriginalPaper 27 January 2018 Pages: 997 - 1008
Integer programming approach to static monopolies in graphs Babak MoazzezHossein Soltani OriginalPaper 07 February 2018 Pages: 1009 - 1041
Smart elements in combinatorial group testing problems Dániel GerbnerMáté Vizer OriginalPaper 10 February 2018 Pages: 1042 - 1060
A feasibility approach for constructing combinatorial designs of circulant type Francisco J. Aragón ArtachoRubén CampoyMatthew K. Tam OriginalPaper 12 February 2018 Pages: 1061 - 1085
An optimal Tate pairing computation using Jacobi quartic elliptic curves Srinath DossRoselyn Kaondera-Shava OriginalPaper 12 February 2018 Pages: 1086 - 1103
The number of edges, spectral radius and Hamilton-connectedness of graphs Ming-Zhu ChenXiao-Dong Zhang OriginalPaper 15 February 2018 Pages: 1104 - 1127
FPT-algorithms for some problems related to integer programming D. V. GribanovD. S. MalyshevS. I. Veselov OriginalPaper 17 February 2018 Pages: 1128 - 1146
Channel assignment problem and n-fold t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labeling of graphs Wensong LinChenli Shen OriginalPaper 20 February 2018 Pages: 1147 - 1167
A local search approximation algorithm for a squared metric k-facility location problem Dongmei ZhangDachuan XuZhenning Zhang OriginalPaper 20 February 2018 Pages: 1168 - 1184
Dynamic work hour optimization for casual workers Weimin MaWei ShaoXiaodong Ji OriginalPaper 21 February 2018 Pages: 1185 - 1201
Maximizing misinformation restriction within time and budget constraints Canh V. PhamMy T. ThaiHuan X. Hoang OriginalPaper 21 February 2018 Pages: 1202 - 1240
Greedy Nim\(_\mathrm{{k}}\) Game Xinzhong LvRongxing XuXuding Zhu OriginalPaper 22 February 2018 Pages: 1241 - 1249
A continuous characterization of the maximum vertex-weighted clique in hypergraphs Qingsong TangXiangde ZhangCheng Zhao OriginalPaper 24 February 2018 Pages: 1250 - 1260
Quantile and mean value measures of search process complexity Jaromír KukalMatej Mojzeš OriginalPaper 26 February 2018 Pages: 1261 - 1285
On the lower bounds of random Max 3 and 4-SAT Guangyan ZhouZongsheng Gao OriginalPaper 27 February 2018 Pages: 1286 - 1299
Some extremal results on the colorful monochromatic vertex-connectivity of a graph Qingqiong CaiXueliang LiDi Wu OriginalPaper 28 February 2018 Pages: 1300 - 1311
On the algorithmic aspects of strong subcoloring M. A. ShaluS. VijayakumarT. P. Sandhya OriginalPaper 06 March 2018 Pages: 1312 - 1329