An overpartition analogue of partitions with bounded differences between largest and smallest parts Fulltext Access 6 Pages 2017
Primal-dual hybrid gradient method for distributionally robust optimization problems Fulltext Access 6 Pages 2017
The geometric-arithmetic index and the chromatic number of connected graphs Fulltext Access 6 Pages 2017
About non equivalent completely regular codes with identical intersection array Fulltext Access 6 Pages 2017
On the Probability of Error for Triangular Quadrature Amplitude Modulation Fulltext Access 6 Pages 2017
On encoding polynomials for strong algebraic manipulation detections codes Fulltext Access 6 Pages 2017
Graphs admitting antimagic labeling for arbitrary sets of positive integers Fulltext Access 6 Pages 2017
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs Fulltext Access 6 Pages 2017
The lexicographic product of some chordal graphs and of cographs preserves b-continuity Fulltext Access 6 Pages 2017
Fleet management for autonomous vehicles using flows in time-expanded networks Fulltext Access 6 Pages 2017
A linear-time algorithm for the identifying code problem on block graphs Fulltext Access 6 Pages 2017
Constructing error-correcting binary codes using transitive permutation groups Fulltext Access 6 Pages 2017
Delta-Wye Transformations and the Efficient Reduction of Almost-Planar Graphs Fulltext Access 6 Pages 2017
Distributionally robust appointment scheduling with moment-based ambiguity set Fulltext Access 6 Pages 2017
Forbidden pairs of disconnected graphs for traceability in connected graphs Fulltext Access 6 Pages 2017
A note on inverses of cyclotomic mapping permutation polynomials over finite fields Fulltext Access 6 Pages 2017
Inventory management in a closed-loop supply chain with advance demand information Fulltext Access 6 Pages 2017
On the strength of time-indexed formulations for the resource-constrained project scheduling problem Fulltext Access 6 Pages 2017
On functional limit theorems for the cumulative times in alternating renewal processes Fulltext Access 6 Pages 2017
Improving the Approximated Projected Perspective Reformulation by dual information Fulltext Access 6 Pages 2017
On minimum degree, leaf number, traceability and Hamiltonicity in graphs Fulltext Access 6 Pages 2017
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable Fulltext Access 6 Pages 2017
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points Fulltext Access 6 Pages 2017
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles Fulltext Access 6 Pages 2017
On the number of disjoint perfect matchings of regular graphs with given edge connectivity Fulltext Access 6 Pages 2017
A note on Huang-Zhao theorem on intersecting families with large minimum degree Fulltext Access 6 Pages 2017
Linear-time generation of uniform random derangements encoded in cycle notation Fulltext Access 7 Pages 2017
Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals Fulltext Access 7 Pages 2017