ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
ISAAC
2004
Springer
13 years 9 months ago
2004
Springer
Solving and designing puzzles, creating sculpture and architecture, and inventing magic tricks all lead to fun and interesting algorithmic problems. This paper describes some of o...