Sciweavers

IWPEC
2004
Springer
14 years 4 months ago
Looking at the Stars
Elena Prieto, Christian Sloper
IWPEC
2004
Springer
14 years 4 months ago
Packing Edge Disjoint Triangles: A Parameterized View
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...
Luke Mathieson, Elena Prieto, Peter Shaw
IWPEC
2004
Springer
14 years 4 months ago
Parameterized Coloring Problems on Chordal Graphs
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...
Dániel Marx
IWPEC
2004
Springer
14 years 4 months ago
Parameterized Graph Separation Problems
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...
Dániel Marx
IWPEC
2004
Springer
14 years 4 months ago
Parameterized Algorithms for Feedback Vertex Set
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefe...
IWPEC
2004
Springer
14 years 4 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
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...
Michael Hoffmann, Yoshio Okamoto
IWPEC
2004
Springer
14 years 4 months ago
On Decidability of MSO Theories of Representable Matroids
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...
Petr Hlinený, Detlef Seese
IWPEC
2004
Springer
14 years 4 months ago
Chordless Paths Through Three Vertices
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...
Robert Haas, Michael Hoffmann
IWPEC
2004
Springer
14 years 4 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
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...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
IWPEC
2004
Springer
14 years 4 months ago
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
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...
Jens Gramm, Till Nierhoff, Till Tantau