Sciweavers

1322 search results - page 2 / 265
» Parameterized counting problems
Sort
View
TCS
2010
13 years 5 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
13 years 11 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
JCSS
2008
65views more  JCSS 2008»
13 years 7 months ago
Efficient algorithms for counting parameterized list H-colorings
Josep Díaz, Maria J. Serna, Dimitrios M. Th...
COCOON
2011
Springer
12 years 7 months ago
Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...