IWPEC
2004
Springer
14 years 6 months ago
2004
Springer
IWPEC
2004
Springer
14 years 6 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...
IWPEC
2004
Springer
14 years 6 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
IWPEC
2004
Springer
14 years 6 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
IWPEC
2004
Springer
14 years 6 months ago
2004
Springer
IWPEC
2004
Springer
14 years 6 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...
IWPEC
2004
Springer
14 years 6 months ago
2004
Springer
We show that, for every finite field , the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we p...
IWPEC
2004
Springer
14 years 6 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...
IWPEC
2004
Springer
14 years 6 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
IWPEC
2004
Springer
14 years 6 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...