204 search results - page 2 / 41 » Parameterized Complexity of Cardinality Constrained Optimiza... |
CPM
2010
Springer
13 years 10 months ago
2010
Springer
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
CAGD
2004
13 years 5 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...
ACID
2006
13 years 7 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...