ALGORITHMICA
2010
13 years 2 months ago
2010
ALGORITHMICA
2010
13 years 2 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
ALGORITHMICA
2010
13 years 3 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
ALGORITHMICA
2010
13 years 3 months ago
2010
ALGORITHMICA
2010
13 years 3 months ago
2010
ALGORITHMICA
2008
13 years 3 months ago
2008
ALGORITHMICA
2008
13 years 3 months ago
2008
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
ALGORITHMICA
2008
13 years 3 months ago
2008
ALGORITHMICA
2007
13 years 4 months ago
2007
ALGORITHMICA
2007
13 years 4 months ago
2007
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...