Sciweavers

1322 search results - page 16 / 265
» Parameterized counting problems
Sort
View
CPM
2008
Springer
170views Combinatorics» more  CPM 2008»
13 years 10 months ago
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler, Michael R. Fellows, Christian Komus...
COMBINATORICA
2006
64views more  COMBINATORICA 2006»
13 years 8 months ago
On The Parameterized Intractability Of Motif Search Problems
ended abstract of this paper was presented at the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Springer-Verlag, LNCS 2285, pages 262
Michael R. Fellows, Jens Gramm, Rolf Niedermeier