Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree Fulltext Access 7 Pages 2014
A revised reformulation-linearization technique for the quadratic assignment problem Fulltext Access 7 Pages 2014
Proper caterpillars are distinguished by their chromatic symmetric function 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
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles Fulltext Access 8 Pages 2014
An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup Fulltext Access 8 Pages 2014
Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves Fulltext Access 8 Pages 2014
Improving heuristics for network modularity maximization using an exact algorithm Fulltext Access 8 Pages 2014
Binary linear programming solutions and non-approximability for control problems in voting systems Fulltext Access 8 Pages 2014
Existence of a pure strategy equilibrium in finite symmetric games where payoff functions are integrally concave Fulltext Access 8 Pages 2014
On opposition graphs, coalition graphs, and bipartite permutation graphs Fulltext Access 8 Pages 2014
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two Fulltext Access 8 Pages 2014
Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs Fulltext Access 8 Pages 2014
Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space Fulltext Access 8 Pages 2014
A new Pareto set generating method for multi-criteria optimization problems Fulltext Access 8 Pages 2014
Orientations and detachments of graphs with prescribed degrees and connectivity Fulltext Access 8 Pages 2014
Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity Fulltext Access 8 Pages 2014
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs Fulltext Access 8 Pages 2014
A dense set of chromatic roots which is closed under multiplication by positive integers Fulltext Access 8 Pages 2014
The crossing number of the Cartesian product of paths with complete graphs Fulltext Access 8 Pages 2014
The edge-face choosability of plane graphs with maximum degree at least 9 Fulltext Access 8 Pages 2014