Efficient algorithms for network localization using cores of underlying graphs Fulltext Access 9 Pages 2014
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs Fulltext Access 9 Pages 2014
Connection between conjunctive capacity and structural properties of graphs Fulltext Access 10 Pages 2014
Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges Fulltext Access 10 Pages 2014
The partition dimension of strong product graphs and Cartesian product graphs Fulltext Access 10 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
Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults Fulltext Access 10 Pages 2014
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks Fulltext Access 10 Pages 2014
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines Fulltext Access 10 Pages 2014
A formulation of the wide partition conjecture using the atom problem in discrete tomography Fulltext Access 10 Pages 2014
Abstract flows over time: A first step towards solving dynamic packing problems Fulltext Access 10 Pages 2014
Space-efficient self-stabilizing counting population protocols on mobile sensor networks Fulltext Access 10 Pages 2014
Isomorphism testing of Boolean functions computable by constant-depth circuits Fulltext Access 10 Pages 2014
Optimal algorithms for semi-online machine covering on two hierarchical machines Fulltext Access 10 Pages 2014
Infinite families of arithmetic identities for self-conjugate 5-cores and 7-cores Fulltext Access 11 Pages 2014