186
click to vote
IWPEC
15 years 10 months ago
2004 Springer 
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
160
click to vote
IWPEC
15 years 10 months ago
2004 Springer 
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
160
click to vote
IWPEC
15 years 10 months ago
2004 Springer 
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
148
click to vote
IWPEC
15 years 10 months ago
2004 Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
143
click to vote
IWPEC
15 years 10 months ago
2004 Springer 
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
|
Applied Computing