Some improved bounds on communication complexity via new decomposition of cliques Fulltext Access 6 Pages 2014
On the non-emptiness of the one-core and the bargaining set of committee games Fulltext Access 6 Pages 2014
Designing contracts for a closed-loop supply chain under information asymmetry Fulltext Access 6 Pages 2014
Convergence to equilibrium states for fluid models of many-server queues with abandonment Fulltext Access 6 Pages 2014
Asymptotic behavior of optimal quantities in symmetric transshipment coalitions Fulltext Access 6 Pages 2014
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank Fulltext Access 6 Pages 2014
A fast dual proximal gradient algorithm for convex minimization and applications Fulltext Access 6 Pages 2014
Optimal quality provision when reputation is subject to random inspections Fulltext Access 6 Pages 2014
On a class of nilpotent table algebras and applications to association schemes Fulltext Access 6 Pages 2014
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree Fulltext Access 6 Pages 2014
An upper bound on the sum of powers of the degrees of simple 1-planar graphs Fulltext Access 6 Pages 2014
Stochastic comparisons of component and system redundancies with dependent components Fulltext Access 6 Pages 2014
Exponentiality of the exchange algorithm for finding another room-partitioning Fulltext Access 6 Pages 2014
Distances of group tables and latin squares via equilateral triangle dissections Fulltext Access 7 Pages 2014
Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree Fulltext Access 7 Pages 2014
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph Fulltext Access 7 Pages 2014
On some conditional characteristics of hazard rate processes induced by external shocks Fulltext Access 7 Pages 2014
A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications Fulltext Access 7 Pages 2014
Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees Fulltext Access 7 Pages 2014
A 1-local 4/3-competitive algorithm for multicoloring a subclass of hexagonal graphs Fulltext Access 7 Pages 2014
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times Fulltext Access 7 Pages 2014
A revised reformulation-linearization technique for the quadratic assignment problem Fulltext Access 7 Pages 2014
All-to-all broadcast problem of some classes of graphs under the half duplex all-port model Fulltext Access 7 Pages 2014
Cayley graphs of diameter two and any degree with order half of the Moore bound Fulltext Access 7 Pages 2014
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes Fulltext Access 7 Pages 2014
Option pricing under jump-diffusion models with mean-reverting bivariate jumps Fulltext Access 7 Pages 2014
The price of connectivity for dominating set: Upper bounds and complexity Fulltext Access 7 Pages 2014
A note on graphs contraction-critical with respect to independence number Fulltext Access 7 Pages 2014
Planar graphs with cycles of length neither 4 nor 7 are (3,0,0)-colorable Fulltext Access 7 Pages 2014
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 Fulltext Access 7 Pages 2014
Proper caterpillars are distinguished by their chromatic symmetric function Fulltext Access 7 Pages 2014