1322 search results - page 6 / 265 » Parameterized counting problems |
MST
2011
13 years 2 months ago
2011
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
ECCC
2007
13 years 7 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
SPIRE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
IPL
2007
13 years 7 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
CAGD
2004
13 years 7 months ago
2004
For a surface patch on a smooth, two-dimensional surface in IR3 , low-distortion parameterizations are described in terms of minimizers of suitable energy functionals. Appropriate...