On the complexity of computing the profinite closure of a rational language Fulltext Access 6 Pages 2011
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem Fulltext Access 6 Pages 2011
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints Fulltext Access 6 Pages 2011
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments Fulltext Access 6 Pages 2011
An improved lower bound on the sensitivity complexity of graph properties Fulltext Access 6 Pages 2011
A well-mixed function with circuit complexity 5n: Tightness of the Lachish–Raz-type bounds Fulltext Access 6 Pages 2011
Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics Fulltext Access 7 Pages 2011
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees Fulltext Access 7 Pages 2011
Characterization and representation problems for intersection betweennesses Fulltext Access 7 Pages 2011
Nordhaus–Gaddum-type theorem for Wiener index of graphs when decomposing into three parts Fulltext Access 7 Pages 2011
On the construction of prefix-free and fix-free codes with specified codeword compositions Fulltext Access 7 Pages 2011
Invariant and dual subtraction games resolving the Duchêne–Rigo conjecture Fulltext Access 7 Pages 2011
Semi-online scheduling with known partial information about job sizes on two identical machines Fulltext Access 7 Pages 2011
An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies Fulltext Access 7 Pages 2011
Online scheduling on unbounded parallel-batch machines with incompatible job families Fulltext Access 7 Pages 2011
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube Fulltext Access 7 Pages 2011
Online and semi-online hierarchical scheduling for load balancing on uniform machines Fulltext Access 7 Pages 2011
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes Fulltext Access 7 Pages 2011
On the reversibility and the closed image property of linear cellular automata Fulltext Access 7 Pages 2011
An efficient algorithm for computing the distance between close partitions Fulltext Access 7 Pages 2011
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes Fulltext Access 7 Pages 2011