Follow
Michael Fellows
Michael Fellows
Professor of Informatics, University of Bergen
Verified email at uib.no
Title
Cited by
Cited by
Year
Parameterized complexity
RG Downey, MR Fellows
Springer Science & Business Media, 2012
44922012
Fundamentals of parameterized complexity
RG Downey, MR Fellows
springer, 2013
17062013
Fixed-parameter tractability and completeness I: Basic results
RG Downey, MR Fellows
SIAM Journal on computing 24 (4), 873-921, 1995
7701995
Fixed-parameter tractability and completeness II: On completeness for W [1]
RG Downey, MR Fellows
Theoretical Computer Science 141 (1-2), 109-131, 1995
6881995
On problems without polynomial kernels
HL Bodlaender, RG Downey, MR Fellows, D Hermelin
Journal of Computer and System Sciences 75 (8), 423-434, 2009
5472009
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
3592009
Parameterized complexity: A framework for systematically confronting computational intractability
RG Downey, MR Fellows, U Stege
Contemporary Trends in Discrete Mathematics 49, 49-99, 1997
2821997
Nonconstructive tools for proving polynomial-time decidability
MR Fellows, MA Langston
Journal of the ACM (JACM) 35 (3), 727-739, 1988
2731988
Polynomial-time data reduction for dominating set
J Alber, MR Fellows, R Niedermeier
Journal of the ACM (JACM) 51 (3), 363-384, 2004
2632004
Parameterized computational feasibility
RG Downey, MR Fellows
Feasible mathematics II, 219-244, 1995
2591995
Kernelization algorithms for the Vertex Cover problem: theory and experiments.
FN Abu-Khzam, RL Collins, MR Fellows, MA Langston, WH Suters, ...
ALENEX/ANALC 69, 11, 2004
2172004
An improved fixed-parameter algorithm for vertex cover
R Balasubramanian, MR Fellows, V Raman
Information Processing Letters 65 (3), 163-168, 1998
2141998
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
2121995
Combinatorial cryptosystems galore!
M Fellows, N Koblitz
Contemporary Mathematics 168, 51-51, 1994
1721994
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008
1692008
Computer Science Unplugged: Off-line activities and games for all ages
TC Bell, IH Witten, M Fellows
Computer Science Unplugged, 1998
1621998
Fixed-parameter intractability
RG Downey, MR Fellows
1992 Seventh Annual Structure in Complexity Theory Conference, 36, 37, 38 …, 1992
1611992
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
F Dehne, M Fellows, M Langston, F Rosamond, K Stevens
Theory of Computing Systems 41, 479-492, 2007
1592007
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
1561989
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
1491994
The system can't perform the operation now. Try again later.
Articles 1–20