LATIN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
LATIN
2010
Springer
14 years 25 days ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
LATIN
2010
Springer
14 years 25 days ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
LATIN
2010
Springer
14 years 26 days ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
