1322 search results - page 4 / 265 » Parameterized counting problems |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
CJ
2008
13 years 7 months ago
2008
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
TIP
2008
13 years 7 months ago
2008
Abstract--A snakuscule (a minuscule snake) is the simplest active contour that we were able to design while keeping the quintessence of traditional snakes: an energy term governed ...