Ausgabe 4/2018
Inhalt (17 Artikel)
Edge-disjoint spanning trees and the number of maximum state circles of a graph
Xiaoli Ma, Baoyindureng Wu, Xian’an Jin
A feasibility approach for constructing combinatorial designs of circulant type
Francisco J. Aragón Artacho, Rubén Campoy, Ilias Kotsireas, Matthew K. Tam
An optimal Tate pairing computation using Jacobi quartic elliptic curves
Srinath Doss, Roselyn Kaondera-Shava
The number of edges, spectral radius and Hamilton-connectedness of graphs
Ming-Zhu Chen, Xiao-Dong Zhang
FPT-algorithms for some problems related to integer programming
D. V. Gribanov, D. S. Malyshev, P. M. Pardalos, S. I. Veselov
A local search approximation algorithm for a squared metric k-facility location problem
Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang
Maximizing misinformation restriction within time and budget constraints
Canh V. Pham, My T. Thai, Hieu V. Duong, Bao Q. Bui, Huan X. Hoang
A continuous characterization of the maximum vertex-weighted clique in hypergraphs
Qingsong Tang, Xiangde Zhang, Guoren Wang, Cheng Zhao
Some extremal results on the colorful monochromatic vertex-connectivity of a graph
Qingqiong Cai, Xueliang Li, Di Wu
On the algorithmic aspects of strong subcoloring
M. A. Shalu, S. Vijayakumar, S. Devi Yamini, T. P. Sandhya