Reliability problems in multiple path-shaped facility location on networks Fulltext Access 12 Pages 2014
On the strong metric dimension of Cartesian and direct products of graphs Fulltext Access 12 Pages 2014
Mathematical Two-compartment Model of Human Cholesterol Transport in Application to High Blood Cholesterol Diagnosis and Treatment Fulltext Access 12 Pages 2014
The maximum number of complete subgraphs in a graph with given maximum degree Fulltext Access 12 Pages 2014
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths Fulltext Access 12 Pages 2014
A set-covering based heuristic algorithm for the periodic vehicle routing problem Fulltext Access 12 Pages 2014
In-place algorithms for computing a largest clique in geometric intersection graphs Fulltext Access 13 Pages 2014
Computing the rooted triplet distance between galled trees by counting triangles Fulltext Access 13 Pages 2014
Panconnectivity and edge-pancyclicity of multidimensional torus networks Fulltext Access 13 Pages 2014
Symmetry-exploiting cuts for a class of mixed-0/1 second-order cone programs Fulltext Access 13 Pages 2014
Direct and inverse problems in additive number theory and in non-abelian group theory Fulltext Access 13 Pages 2014
Organizing the atoms of the clique separator decomposition into an atom tree Fulltext Access 13 Pages 2014
The complexity of pebbling reachability and solvability in planar and outerplanar graphs Fulltext Access 13 Pages 2014
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights Fulltext Access 13 Pages 2014
An Algebraic Approach to Population-Based Evolutionary Algorithm Generation Fulltext Access 13 Pages 2014
An Abstract Domain to Infer Symbolic Ranges over Nonnegative Parameters Fulltext Access 13 Pages 2014
Efficient Constraint/Generator Removal from Double Description of Polyhedra Fulltext Access 13 Pages 2014
Polynomial-time algorithms for special cases of the maximum confluent flow problem Fulltext Access 13 Pages 2014
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures Fulltext Access 13 Pages 2014
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives Fulltext Access 13 Pages 2014
Lower and upper bounds for the Bin Packing Problem with Fragile Objects Fulltext Access 14 Pages 2014
The maximum sum and the maximum product of sizes of cross-intersecting families Fulltext Access 14 Pages 2014
On embedding a unitary block design as a polar unital and an intrinsic characterization of the classical unital Fulltext Access 14 Pages 2014
Generalizations of bounds on the index of convergence to weighted digraphs Fulltext Access 14 Pages 2014
Computing the differential of a graph: Hardness, approximability and exact algorithms Fulltext Access 14 Pages 2014
Maximum size of a minimum watching system and the graphs achieving the bound Fulltext Access 14 Pages 2014
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs Fulltext Access 14 Pages 2014
Reverse engineering of compact suffix trees and links: A novel algorithm Fulltext Access 14 Pages 2014
The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace Fulltext Access 14 Pages 2014
Exploring the role of graph spectra in graph coloring algorithm performance Fulltext Access 15 Pages 2014