Travelled to:1 × Austria
1 × Canada
1 × Greece
1 × Iceland
1 × Poland
1 × United Kingdom
2 × USA
Collaborated with:H.L.Bodlaender F.A.Rosamond D.Hermelin M.A.Langston M.T.Hallett T.Warnow A.Kulik H.Shachnai R.G.Downey G.Fertin S.Vialette U.Rotics S.Szeider F.V.Fomin D.Lokshtanov E.Losievskaja S.Saurabh
Talks about:tractabl (2) polynomi (2) problem (2) width (2) hard (2) transform (1) phylogeni (1) parameter (1) hierarchi (1) borderlin (1)
Person: Michael R. Fellows
DBLP: Fellows:Michael_R=
Contributed to:
2012200920082007
2006199419921989Wrote 8 papers:
- ICALP-v1-2012-FellowsKRS #approximate
- Parameterized Approximation via Fidelity Preserving Transformations (MRF, AK, FAR, HS), pp. 351–362.
- ICALP-v1-2009-FellowsFLLRS #parametricity
- Distortion Is Fixed Parameter Tractable (MRF, FVF, DL, EL, FAR, SS), pp. 463–474.
- ICALP-A-2008-BodlaenderDFH #kernel #on the #polynomial #problem
- On Problems without Polynomial Kernels (HLB, RGD, MRF, DH), pp. 563–574.
- ICALP-2007-FellowsFHV #graph
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (MRF, GF, DH, SV), pp. 340–351.
- STOC-2006-FellowsRRS #clique #np-hard
- Clique-width minimization is NP-hard (MRF, FAR, UR, SS), pp. 354–362.
- STOC-1994-BodlaenderFH #bound #problem
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (HLB, MRF, MTH), pp. 449–458.
- ICALP-1992-BodlaenderFW
- Two Strikes Against Perfect Phylogeny (HLB, MRF, TW), pp. 273–283.
- STOC-1989-FellowsL #algorithm #on the #performance #polynomial
- On Search, Decision and the Efficiency of Polynomial-Time Algorithms (MRF, MAL), pp. 501–512.