71 search results - page 11 / 15 » Kernelizations for Parameterized Counting Problems |
119
click to vote
TIP
2008
15 years 2 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 ...
115
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
166
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
140
click to vote
NETWORKS
2010
15 years 1 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
137
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....