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
Journal ArticleDOI
The parameterized complexity of sequence alignment and consensus
TL;DR: In this paper, the Longest Common Subsequence (LCS) problem was examined from the point of view of parameterized computational complexity, and it was shown that the problem can be solved in time f(k · n α where α is independent of k (termed fixedparameter tractability).
Proceedings ArticleDOI
Clique-width minimization is NP-hard
TL;DR: It is shown that the clique-width of a given graph cannot be absolutely approximated in polynomial time unless P=NP, and it is also shown that, given a graph G and an integer k, deciding whether theClique- width of G is at most k is NPhy complete.
Journal ArticleDOI
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Michael R. Fellows,Daniel Lokshtanov,Neeldhara Misra,Matthias Mnich,Frances A. Rosamond,Saket Saurabh +5 more
TL;DR: Much improved FPT algorithms are described for a large number of graph problems, for input graphs G for which ml(G)≤k, based on the polynomial-time extremal structure theory canonically associated to this parameter.
Book ChapterDOI
Parameterized approximation problems
TL;DR: The goal of this paper is to apply parameterized ideas to approximation in parameterized approximation problems, where the problem in question is a parameterized decision problem, and the required approximation factor is treated as a second parameter for the problem.
Journal ArticleDOI
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Michael R. Fellows,Christian Knauer,Naomi Nishimura,Prabhakar Ragde,Frances A. Rosamond,Ulrike Stege,Dimitrios M. Thilikos,Sue Whitesides +7 more
TL;DR: This technique lets us combine Alon, Yuster and Zwick’s color-coding technique with dynamic programming to obtain faster fixed-parameter algorithms for problems such as r-dimensional matching and r-set packing when the size k of the solution is considered a parameter.