Efficient sub-5 approximations for minimum dominating sets in unit disk graphs Fulltext Access 12 Pages 2014
Complexity and approximation for Traveling Salesman Problems with profits Fulltext Access 12 Pages 2014
On the strong metric dimension of Cartesian and direct products of graphs Fulltext Access 12 Pages 2014
A set-covering based heuristic algorithm for the periodic vehicle routing problem Fulltext Access 12 Pages 2014
On the complexity of the black-and-white coloring problem on some classes of perfect graphs Fulltext Access 13 Pages 2014
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines Fulltext Access 13 Pages 2014
On lattices from combinatorial game theory modularity and a representation theorem: Finite case Fulltext Access 13 Pages 2014
On the complexity of constructing minimum changeover cost arborescences Fulltext Access 13 Pages 2014
Direct and inverse problems in additive number theory and in non-abelian group theory Fulltext Access 13 Pages 2014
Panconnectivity and edge-pancyclicity of multidimensional torus networks Fulltext Access 13 Pages 2014
In-place algorithms for computing a largest clique in geometric intersection graphs Fulltext Access 13 Pages 2014
Organizing the atoms of the clique separator decomposition into an atom tree Fulltext Access 13 Pages 2014
An Abstract Domain to Infer Symbolic Ranges over Nonnegative Parameters Fulltext Access 13 Pages 2014
An Algebraic Approach to Population-Based Evolutionary Algorithm Generation 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
Efficient Constraint/Generator Removal from Double Description of Polyhedra Fulltext Access 13 Pages 2014
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights Fulltext Access 13 Pages 2014
The complexity of pebbling reachability and solvability in planar and outerplanar graphs Fulltext Access 13 Pages 2014
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures Fulltext Access 13 Pages 2014
Polynomial-time algorithms for special cases of the maximum confluent flow problem Fulltext Access 13 Pages 2014
Generalizations of bounds on the index of convergence to weighted digraphs Fulltext Access 14 Pages 2014
Maximum size of a minimum watching system and the graphs achieving the bound Fulltext Access 14 Pages 2014
Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes Fulltext Access 14 Pages 2014
Lower and upper bounds for the Bin Packing Problem with Fragile Objects Fulltext Access 14 Pages 2014
Attribute-based optimistic fair exchange: How to restrict brokers with policies Fulltext Access 14 Pages 2014
The Max problem revisited: The importance of mutation in genetic programming Fulltext Access 14 Pages 2014
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem Fulltext Access 14 Pages 2014