7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2002
Polynomial Time Data Reduction for Dominating Set
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
Dealing with the NP-complete Dominating Set problem on undirected graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side…
cs.CC2002★ 7 cited
Parameterized Intractability of Motif Search Problems
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]-hard when parameterized by the number k of input strings (a…