1. Edge-disjoint spanning trees and the number of maximum state circles of a graph

   • Xiaoli Ma
   • Baoyindureng Wu
   • Xian’an Jin

   OriginalPaper 27 January 2018 Pages: 997 - 1008

   

2. Integer programming approach to static monopolies in graphs

   • Babak Moazzez
   • Hossein Soltani

   OriginalPaper 07 February 2018 Pages: 1009 - 1041

   

3. Smart elements in combinatorial group testing problems

   • Dániel Gerbner
   • Máté Vizer

   OriginalPaper 10 February 2018 Pages: 1042 - 1060

4. A feasibility approach for constructing combinatorial designs of circulant type

   • Francisco J. Aragón Artacho
   • Rubén Campoy
   • Matthew K. Tam

   OriginalPaper 12 February 2018 Pages: 1061 - 1085

   

5. An optimal Tate pairing computation using Jacobi quartic elliptic curves

   • Srinath Doss
   • Roselyn Kaondera-Shava

   OriginalPaper 12 February 2018 Pages: 1086 - 1103

   

6. The number of edges, spectral radius and Hamilton-connectedness of graphs

   • Ming-Zhu Chen
   • Xiao-Dong Zhang

   OriginalPaper 15 February 2018 Pages: 1104 - 1127

   

7. FPT-algorithms for some problems related to integer programming

   • D. V. Gribanov
   • D. S. Malyshev
   • S. I. Veselov

   OriginalPaper 17 February 2018 Pages: 1128 - 1146

8. Channel assignment problem and n-fold t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labeling of graphs

   • Wensong Lin
   • Chenli Shen

   OriginalPaper 20 February 2018 Pages: 1147 - 1167

   

9. A local search approximation algorithm for a squared metric k-facility location problem

   • Dongmei Zhang
   • Dachuan Xu
   • Zhenning Zhang

   OriginalPaper 20 February 2018 Pages: 1168 - 1184

   

10. Dynamic work hour optimization for casual workers

    • Weimin Ma
    • Wei Shao
    • Xiaodong Ji

    OriginalPaper 21 February 2018 Pages: 1185 - 1201

    

11. Maximizing misinformation restriction within time and budget constraints

    • Canh V. Pham
    • My T. Thai
    • Huan X. Hoang

    OriginalPaper 21 February 2018 Pages: 1202 - 1240

    

12. Greedy Nim\(_\mathrm{{k}}\) Game

    • Xinzhong Lv
    • Rongxing Xu
    • Xuding Zhu

    OriginalPaper 22 February 2018 Pages: 1241 - 1249

13. A continuous characterization of the maximum vertex-weighted clique in hypergraphs

    • Qingsong Tang
    • Xiangde Zhang
    • Cheng Zhao

    OriginalPaper 24 February 2018 Pages: 1250 - 1260

14. Quantile and mean value measures of search process complexity

    • Jaromír Kukal
    • Matej Mojzeš

    OriginalPaper 26 February 2018 Pages: 1261 - 1285

    

15. On the lower bounds of random Max 3 and 4-SAT

    • Guangyan Zhou
    • Zongsheng Gao

    OriginalPaper 27 February 2018 Pages: 1286 - 1299

    

16. Some extremal results on the colorful monochromatic vertex-connectivity of a graph

    • Qingqiong Cai
    • Xueliang Li
    • Di Wu

    OriginalPaper 28 February 2018 Pages: 1300 - 1311

    

17. On the algorithmic aspects of strong subcoloring

    • M. A. Shalu
    • S. Vijayakumar
    • T. P. Sandhya

    OriginalPaper 06 March 2018 Pages: 1312 - 1329