#### Filter Results:

- Full text PDF available (86)

#### Publication Year

1987

2018

- This year (5)
- Last 5 years (20)
- Last 10 years (78)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rodney G. Downey, Michael R. Fellows
- Monographs in Computer Science
- 1999

- Rodney G. Downey, Michael R. Fellows
- Texts in Computer Science
- 2013

It's not surprisingly when entering this site to get the book. One of the popular books now is the fundamentals of parameterized complexity. You may be confused because you can't find the book in theâ€¦ (More)

- Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
- J. Comput. Syst. Sci.
- 2009

Kernelization is a strong and widely-applied technique in parameterized complexity. In a nutshell, a kernelization algorithm, or simply a kernel, is a polynomial-time transformation that transformsâ€¦ (More)

- Rodney G. Downey, Michael R. Fellows
- Complexity Theory: Current Research
- 1992

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-Dominating Set, essentially no better algorithm is presently known than the one which tries all possibleâ€¦ (More)

- Jochen Alber, Michael R. Fellows, Rolf Niedermeier
- J. ACM
- 2004

Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove thatâ€¦ (More)

- Rodney G. Downey, Michael R. Fellows
- Theor. Comput. Sci.
- 1995

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as kDOMINATING SET, essentially no better algorithm is presently known than the one which tries all possibleâ€¦ (More)

- Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
- Ann. Pure Appl. Logic
- 1995

We describe new results in parametrized complexity theory. In particular, we prove a number of concrete hardness results for W [PI, the top level of the hardness hierarchy introduced by Downey andâ€¦ (More)

- Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, StÃ©phane Vialette
- Theor. Comput. Sci.
- 2009

Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more than one interval associated with it. Many applications of interval graphs also generalize toâ€¦ (More)

- Rodney G. Downey, Michael R. Fellows
- SIAM J. Comput.
- 1995

For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possibleâ€¦ (More)

- Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow
- ICALP
- 1992

One of the major efforts in molecular biology is the computation of phylogenies for species sets. A longstanding open problem in this area is called the Perfect Phylogeny problem. For almost twoâ€¦ (More)