Michael Fellows
Michael Fellows
Professor of Informatics, University of Bergen
Verified email at uib.no
Cited by
Cited by
Parameterized complexity
RG Downey, MR Fellows
Springer Science & Business Media, 2012
Fundamentals of parameterized complexity
RG Downey, MR Fellows
springer, 2013
Fixed-parameter tractability and completeness II: On completeness for W [1]
RG Downey, MR Fellows
Theoretical Computer Science 141 (1-2), 109-131, 1995
Fixed-parameter tractability and completeness I: Basic results
RG Downey, MR Fellows
SIAM Journal on computing 24 (4), 873-921, 1995
On problems without polynomial kernels
HL Bodlaender, RG Downey, MR Fellows, D Hermelin
Journal of Computer and System Sciences 75 (8), 423-434, 2009
On the parameterized complexity of multiple-interval graph problems
MR Fellows, D Hermelin, F Rosamond, S Vialette
Theoretical computer science 410 (1), 53-61, 2009
Parameterized complexity: A framework for systematically confronting computational intractability
RG Downey, MR Fellows, U Stege
Contemporary trends in discrete mathematics: From DIMACS and DIMATIA to the …, 1999
Nonconstructive tools for proving polynomial-time decidability
MR Fellows, MA Langston
Journal of the ACM (JACM) 35 (3), 727-739, 1988
Parameterized computational feasibility
RG Downey, MR Fellows
Feasible mathematics II, 219-244, 1995
Polynomial-time data reduction for dominating set
J Alber, MR Fellows, R Niedermeier
Journal of the ACM (JACM) 51 (3), 363-384, 2004
Kernelization algorithms for the vertex cover problem
FN Abu-Khzam, RL Collins, MR Fellows, MA Langston, WH Suters, ...
An improved fixed-parameter algorithm for vertex cover
R Balasubramanian, MR Fellows, V Raman
Information Processing Letters 65 (3), 163-168, 1998
Fixed-parameter tractability and completeness IV: On completeness for W [P] and PSPACE analogues
KA Abrahamson, RG Downey, MR Fellows
Annals of pure and applied logic 73 (3), 235-276, 1995
Fixed-parameter tractability and completeness
RG Downey, MR Fellows
Congressus Numerantium, 161-161, 1992
An O (2 O (k) n 3) FPT algorithm for the undirected feedback vertex set problem
F Dehne, M Fellows, M Langston, F Rosamond, K Stevens
Theory of Computing Systems 41 (3), 479-492, 2007
Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy
RG Downey, MR Fellows
Mathematical Sciences Institute, Cornell University 92 (19), 1992
Fixed-parameter intractability
RG Downey, MR Fellows
1992 Seventh Annual Structure in Complexity Theory Conference, 36, 37, 38 …, 1992
Combinatorial cryptosystems galore!
M Fellows, N Koblitz
Contemporary Mathematics 168, 51-51, 1994
Beyond NP-completeness for problems of bounded width (extended abstract) hardness for the W hierarchy
HL Bodlaender, MR Fellows, MT Hallett
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
On search decision and the efficiency of polynomial-time algorithms
MR Fellows, MA Langston
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
The system can't perform the operation now. Try again later.
Articles 1–20