scispace - formally typeset
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

Parameterized Complexity

TL;DR: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
Book

Fundamentals of Parameterized Complexity

TL;DR: This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research.
Journal ArticleDOI

On problems without polynomial kernels

TL;DR: Using the notion of distillation algorithms, a generic lower-bound engine is developed that allows showing that a variety of FPT problems, fulfilling certain criteria, cannot have polynomial kernels unless the polynomially-bounded hierarchy collapses.
Journal ArticleDOI

Fixed-parameter tractability and completeness II: on completeness for W [1]

TL;DR: This work shows that INDEPENDENT SET is complete for W, and the W Hierarchy of parameterized problems was defined, and complete problems were identified for the classes W [ t ] for t ⩾ 2.
Journal ArticleDOI

Fixed-Parameter Tractability and Completeness I: Basic Results

TL;DR: This paper establishes the main results of a completeness program which addresses the apparent fixed-parameter intractability of many parameterized problems and gives a compendium of currently known hardness results.