M
Michael R. Fellows
Researcher at University of Bergen
Publications - 313
Citations - 19261
Michael R. Fellows is an academic researcher from University of Bergen. The author has contributed to research in topics: Parameterized complexity & Vertex cover. The author has an hindex of 67, co-authored 311 publications receiving 18287 citations. Previous affiliations of Michael R. Fellows include Durham University & University of Idaho.
Papers
More filters
Book ChapterDOI
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
TL;DR: An improved randomized algorithm for Graph Motif is presented and it is shown that the parameter "number of connected motif components" leads to W[1]-hardness even when restricted to graphs that are paths.
Journal ArticleDOI
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
TL;DR: The main results are that the parameterized variant of each of the considered problems is hard for the complexity classes W[t] for all t∈N and it is shown that Intervalizing Colored Graphs, Triangulating Colored graphs, and Colored Cutwidth are NP-Complete.
Book ChapterDOI
Parameterized complexity: the main ideas and connections to practical computing
TL;DR: The purposes of this paper are to give an exposition of the main ideas of parameterized complexity, and to discuss the connections of parameterization complexity to the systematic design of heuristics and approximation algorithms.
An improved fixed parameter tractable algorithm for vertex cover
Ulrike Stege,Michael R. Fellows +1 more
TL;DR: An improved xed parameter tractable algorithm when the problem is parameterized by the size k of V is presented and the klam value is improved.
Book ChapterDOI
DNA Physical Mapping: Three Ways Difficult
TL;DR: The three distinct conceptual frameworks of N P-completeness, algorithmic techniques for bounded treewidth, and parameterized complexity theory are shown to fit together neatly in an integrated complexity analysis of ICG.