A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs Fulltext Access 9 Pages 2014
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks Fulltext Access 9 Pages 2014
Reprint of: Extreme point and halving edge search in abstract order types Fulltext Access 9 Pages 2014
Bounding the locus of the center of mass for a part with shape variation Fulltext Access 9 Pages 2014
Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming Fulltext Access 9 Pages 2014
Tight and simple Web graph compression for forward and reverse neighbor queries Fulltext Access 9 Pages 2014
A combinatorial proof and refinement of a partition identity of Siladić Fulltext Access 10 Pages 2014
Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines Fulltext Access 10 Pages 2014
The discrete ellipsoid covering problem: A discrete geometric programming approach Fulltext Access 10 Pages 2014
The partition dimension of strong product graphs and Cartesian product graphs Fulltext Access 10 Pages 2014
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults Fulltext Access 10 Pages 2014
The lexicographically smallest universal cycle for binary strings with minimum specified weight Fulltext Access 10 Pages 2014
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges Fulltext Access 10 Pages 2014
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines Fulltext Access 10 Pages 2014