Resources

[1]H. L. Bodlaender et al., "Quadratic Kernelization for Convex Recoloring of Trees", ALGORITHMICA, vol. 61, no. 2, OCT 2011, pp. 362-388.  [doi]
[2]M. R. Fellows et al., "Upper and lower bounds for finding connected motifs in vertex-colored graphs", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 77, no. 4, SI, JUL 2011, pp. 799-811.  [doi]
[3]M. R. Fellows et al., "Graph-based data clustering with overlaps", DISCRETE OPTIMIZATION, vol. 8, no. 1, SI, FEB 2011, pp. 2-17.   [doi]
[4]M. R. Fellows et al., "On the complexity of some colorful problems parameterized by treewidth", INFORMATION AND COMPUTATION, vol. 209, no. 2, FEB 2011, pp. 143-153.  [doi]
[5]M. R. Fellows, J. Guo and I. Kanj, "The parameterized complexity of some minimum label problems", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 76, no. 8, DEC 2010, pp. 727-740.  [doi]
[6]M. Fellows et al., "W-Hierarchies Defined by Symmetric Gates", THEORY OF COMPUTING SYSTEMS, vol. 46, no. 2, FEB 2010, pp. 311-339.  [doi]
[7]H. L. Bodlaender et al., "Clustering with partial information", THEORETICAL COMPUTER SCIENCE, vol. 411, no. 7-9, FEB 28 2010, pp. 1202-1211.  [doi]
[8]H. L. Bodlaender et al., "On problems without polynomial kernels", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 75, no. 8, DEC 2009, pp. 423-434.   [doi]
[9]M. Fellows et al., "The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number", THEORY OF COMPUTING SYSTEMS, vol. 45, no. 4, NOV 2009, pp. 822-848.  [doi]
[10]H. L. Bodlaender, M. R. Fellows and D. M. Thilikos, "Derivation of algorithms for cutwidth and related graph layout parameters", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 75, no. 4, JUN 2009, pp. 231-244.  [doi]
[11]M. R. Fellows et al., "On the parameterized complexity of multiple-interval graph problems", THEORETICAL COMPUTER SCIENCE, vol. 410, no. 1, JAN 28 2009, pp. 53-61.  [doi]
[12]N. Betzler et al., "Fixed-parameter algorithms for Kemeny rankings", THEORETICAL COMPUTER SCIENCE, vol. 410, no. 45, OCT 28 2009, pp. 4554-4570. [doi]
[13]M. R. Fellows et al., "CLIQUE-WIDTH IS NP-COMPLETE", SIAM JOURNAL ON DISCRETE MATHEMATICS, vol. 23, no. 2, 2009, pp. 909-939.  [doi]
[14]M. R. Fellows et al., "Faster fixed-parameter tractable algorithms for matching and packing problems", ALGORITHMICA, vol. 52, no. 2, OCT 2008, pp. 167-176.  [doi]
[15]V. Dujmovic et al., "On the parameterized complexity of layered graph drawing", ALGORITHMICA, vol. 52, no. 2, OCT 2008, pp. 267-292. [doi]
[16]R. G. Downey, M. R. Fellows and M. A. Langston, "The computer journal special issue on parameterized complexity: Foreword by the guest editors", COMPUTER JOURNAL, vol. 51, no. 1, JAN 2008, pp. 1-6. [doi]
[17]R. G. Downey et al., "Parameterized approximation of dominating set problems", INFORMATION PROCESSING LETTERS, vol. 109, no. 1, DEC 16 2008, pp. 68-70.  [doi]
[18]F. N. Abu-Khzam et al., "Crown structures for vertex cover kernelization", THEORY OF COMPUTING SYSTEMS, vol. 41, no. 3, OCT 2007, pp. 411-430.   [doi]
[19]L. Cai et al., "The complexity of polynomial-time approximation", THEORY OF COMPUTING SYSTEMS, vol. 41, no. 3, OCT 2007, pp. 459-477.   [doi]
[20]F. Dehne et al., "An O(2(O(k))n(3)) FPT algorithm for the undirected feedback vertex set problem", THEORY OF COMPUTING SYSTEMS, vol. 41, no. 3, OCT 2007, pp. 479-492. [doi]
[21]V. Dujmovic et al., "A fixed-parameter approach to 2-layer planarization", ALGORITHMICA, vol. 45, no. 2, JUN 2006, pp. 159-182.  [doi]
[22]M. Fellows, J. Gramm and R. Niedermeier, "On the parameterized intractability of motif search problems", COMBINATORICA, vol. 26, no. 2, 2006, pp. 141-167. [doi]
[23]J. Alber et al., "A refined search tree technique for Dominating Set on planar graphs", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 71, no. 4, NOV 2005, pp. 385-405.[doi]
[24]J. Chen et al., "Tight lower bounds for certain parameterized NP-hard problems", INFORMATION AND COMPUTATION, vol. 201, no. 2, SEP 15 2005, pp. 216-231. [doi]
[25]J. Ellis, H. Fan and M. Fellows, "The dominating set problem is fixed parameter tractable for graphs of bounded genus", JOURNAL OF ALGORITHMS, vol. 52, no. 2, AUG 2004, pp. 152-168.  [doi]
[26]J. Alber, M. Fellows and R. Niedermeier, "Polynomial-time data reduction for DOMINATING SET", JOURNAL OF THE ACM, vol. 51, no. 3, MAY 2004, pp. 363-384. [doi]
[27]J. Chen, M. Fellows, "Special issue on parameterized computation and complexity - Foreword from the guest editors", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 67, no. 4, DEC 2003, pp. 653. [doi]
[28]M. Fellows, M. Hallett and U. Stege, "Analogs & duals of the MAST problem for sequences & trees", JOURNAL OF ALGORITHMS, vol. 49, no. 1, OCT 2003, pp. 192-216.  [doi]
[29]M. Fellows, C. McCartin, "On the parametric complexity of schedules to minimize tardy tasks", THEORETICAL COMPUTER SCIENCE, vol. 298, no. 2, APR 8 2003, pp. 317-324. [doi]
[30]R. Downey, M. Fellows, "Index sets and parametric reductions", ARCHIVE FOR MATHEMATICAL LOGIC, vol. 40, no. 5, JUL 2001, pp. 329-348.   [doi]
[31]M. Dinneen, K. Cattell and M. Fellows, "Forbidden minors to graphs with small feedback sets", DISCRETE MATHEMATICS, vol. 230, no. 1-3, MAR 6 2001, pp. 215-252.
[32]R. Downey, M. Fellows and V. Raman, "The complexity of irredundant sets parameterized by size", DISCRETE APPLIED MATHEMATICS, vol. 100, no. 3, MAR 30 2000, pp. 155-167.  [doi]
[33]H. Bodlaender et al., "The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs", THEORETICAL COMPUTER SCIENCE, vol. 244, no. 1-2, AUG 6 2000, pp. 167-188.  [doi]
[34]K. Cattell et al., "On computing graph minor obstruction sets", THEORETICAL COMPUTER SCIENCE, vol. 233, no. 1-2, FEB 28 2000, pp. 107-127. [doi]
[35]R. Downey et al., "The parametrized complexity of some fundamental problems in coding theory", SIAM JOURNAL ON COMPUTING, vol. 29, no. 2, DEC 6 1999, pp. 545-570. [doi]
[36]R. Downey, M. Fellows, "Threshold dominating sets and an improved characterization of W[2]", THEORETICAL COMPUTER SCIENCE, vol. 209, no. 1-2, DEC 6 1998, pp. 123-140.  [doi]
[37]R. Downey, M. Fellows and K. Regan, "Parameterized circuit complexity and the W hierarchy", THEORETICAL COMPUTER SCIENCE, vol. 191, no. 1-2, JAN 30 1998, pp. 97-115. [doi]
[38]R. Balasubramanian, M. Fellows and V. Raman, "An improved fixed-parameter algorithm for vertex cover", INFORMATION PROCESSING LETTERS, vol. 65, no. 3, FEB 13 1998, pp. 163-168.   [doi]
[39]L. Cai et al., "On the parameterized complexity of short computation and factorization", ARCHIVE FOR MATHEMATICAL LOGIC, vol. 36, no. 4-5, AUG 1997, pp. 321-337. [doi]
[40]L. Cai et al., "Advice classes of parameterized tractability", ANNALS OF PURE AND APPLIED LOGIC, vol. 84, no. 1, MAR 6 1997, pp. 119-138.  [doi]
[41]K. Cattell et al., "Approaches to detection of distantly related proteins by database searches", BIOTECHNIQUES, vol. 21, no. 6, DEC 1996, pp. 1118-&.
[42]M. Cesati, M. Fellows, "Sparse parameterized problems", ANNALS OF PURE AND APPLIED LOGIC, vol. 82, no. 1, NOV 1996, pp. 1-15. [doi]
[43]N. Alon, M. Fellows and D. Hare, "Vertex transversals that dominate", JOURNAL OF GRAPH THEORY, vol. 21, no. 1, JAN 1996, pp. 21-31. [doi]
[44]K. Cattell, M. Dinneen and M. Fellows, "A simple linear-time algorithm for finding path-decompositions of small width", INFORMATION PROCESSING LETTERS, vol. 57, no. 4, FEB 26 1996, pp. 197-203. [doi]
[45]H. BODLAENDER, M. FELLOWS, "W[2]-HARDNESS OF PRECEDENCE CONSTRAINED K-PROCESSOR SCHEDULING", OPERATIONS RESEARCH LETTERS, vol. 18, no. 2, SEP 1995, pp. 93-97.  [doi]
[46]R. DOWNEY, M. FELLOWS, "FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .1. BASIC RESULTS", SIAM JOURNAL ON COMPUTING, vol. 24, no. 4, AUG 1995, pp. 873-921.[doi]
[47]M. FELLOWS et al., "THE COMPLEXITY OF INDUCED MINORS AND RELATED PROBLEMS", ALGORITHMICA, vol. 13, no. 3, MAR 1995, pp. 266-282.[doi]
[48]H. BODLAENDER et al., "PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY", COMPUTER APPLICATIONS IN THE BIOSCIENCES, vol. 11, no. 1, FEB 1995, pp. 49-57.
[49]L. CAI et al., "ON THE STRUCTURE OF PARAMETERIZED PROBLEMS IN NP", INFORMATION AND COMPUTATION, vol. 123, no. 1, NOV 15 1995, pp. 38-49.[doi]
[50]K. ABRAHAMSON, R. DOWNEY and M. FELLOWS, "FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .4. ON COMPLETENESS FOR W[P] AND PSPACE ANALOGS", ANNALS OF PURE AND APPLIED LOGIC, vol. 73, no. 3, JUN 15 1995, pp. 235-276. [doi]
[51]H. BODLAENDER et al., "THE PARAMETERIZED COMPLEXITY OF SEQUENCE ALIGNMENT AND CONSENSUS", THEORETICAL COMPUTER SCIENCE, vol. 147, no. 1-2, AUG 7 1995, pp. 31-54. [doi]
[52]R. DOWNEY, M. FELLOWS, "FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .2. ON COMPLETENESS FOR W[1]", THEORETICAL COMPUTER SCIENCE, vol. 141, no. 1-2, APR 17 1995, pp. 109-131.  [doi]
[53]M. FELLOWS, M. LANGSTON, "ON SEARCH, DECISION, AND THE EFFICIENCY OF POLYNOMIAL-TIME ALGORITHMS", JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 49, no. 3, DEC 1994, pp. 769-779.   [doi]
[54]L. CAMPBELL et al., "SMALL DIAMETER SYMMETRICAL NETWORKS FROM LINEAR-GROUPS", IEEE TRANSACTIONS ON COMPUTERS, vol. 41, no. 2, FEB 1992, pp. 218-220. [doi]
[55]M. FELLOWS, M. LANGSTON, "ON WELL-PARTIAL-ORDER THEORY AND ITS APPLICATION TO COMBINATORIAL PROBLEMS OF VLSI DESIGN", SIAM JOURNAL ON DISCRETE MATHEMATICS, vol. 5, no. 1, FEB 1992, pp. 117-126. [doi]
[56]M. FELLOWS, M. LANGSTON, "CONSTRUCTIVITY ISSUES IN GRAPH ALGORITHMS", LECTURE NOTES IN COMPUTER SCIENCE, vol. 613, 1992, pp. 150-158.
[57]H. BODLAENDER, M. FELLOWS and T. WARNOW, "2 STRIKES AGAINST PERFECT PHYLOGENY", LECTURE NOTES IN COMPUTER SCIENCE, vol. 623, 1992, pp. 273-283.
[58]K. ABRAHAMSON et al., "CONSTRUCTIVE COMPLEXITY", DISCRETE APPLIED MATHEMATICS, vol. 34, no. 1-3, NOV 21 1991, pp. 3-16.  [doi]
[59]M. DINNEEN, M. FELLOWS and V. FABER, "ALGEBRAIC CONSTRUCTIONS OF EFFICIENT BROADCAST NETWORKS", LECTURE NOTES IN COMPUTER SCIENCE, vol. 539, 1991, pp. 152-158.

Refereed Conference Papers

[60]M. R. Fellows, S. Gaspers and F. A. Rosamond, "Parameterizing by the Number of Numbers", in PARAMETERIZED AND EXACT COMPUTATION, V. Raman, S. Saurabh, Eds., 2010, pp. 123-134.
[61]Z. Chen et al., "A Linear Kernel for Co-Path/Cycle Packing", in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, B. Chen, Ed., 2010, pp. 90-102.
[62]M. R. Fellows et al., "Local Search: Is Brute-Force Avoidable?", in 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, C. Boutilier, Ed., 2009, pp. 486-491.
[63]M. R. Fellows et al., "Haplotype Inference Constrained by Plausible Haplotype Data", in COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, G. Kucherov, E. Ukkonen, Eds., 2009, pp. 339-352.
[64]M. R. Fellows et al., "Distortion Is Fixed Parameter Tractable", in AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, S. Albers et al., Eds., 2009, pp. 463-474.
[65]M. R. Fellows et al., "A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems", in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, R. Kralovic, D. Niwinski, Eds., pp. 319-330.
[66]M. R. Fellows et al., "Graph-Based Data Clustering with Overlaps", in COMPUTING AND COMBINATORICS, PROCEEDINGS, H. Ngo, Ed., 2009, pp. 516-526.
[67]M. R. Fellows et al., "Leaf Powers and Their Properties: Using the Trees", in ALGORITHMS AND COMPUTATION, PROCEEDINGS, S. Hong, H. Nagamochi, T. Fukunaga, Eds., 2008, pp. 402-413.
[68]M. R. Fellows et al., "Graph Layout Problems Parameterized by Vertex Cover", in ALGORITHMS AND COMPUTATION, PROCEEDINGS, S. Hong, H. Nagamochi, T. Fukunaga, Eds., 2008, pp. 294-305.
[69]H. L. Bodlaender et al., "Clustering with partial information", in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, E. Ochmanski, J. Tyszkiewicz, Eds., pp. 144-155.
[70]H. L. Bodlaender et al., "On problems without polynomial kernels (Extended Abstract)", in AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, L. Aceto et al., Eds., 2008, pp. 563-574.
[71]N. Betzler et al., "Parameterized algorithms and hardness results for some graph motif problems", in COMBINATORIAL PATTERN MATCHING, P. Ferragina, G. Landau, Eds., 2008, pp. 31-43.
[72]M. Fellows, H. Fernau, "Facility location problems: A parameterized view", in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, R. Fleischer, J. Xu, Eds., 2008, pp. 188-199.
[73]N. Betzler et al., "Fixed-parameter algorithms for Kemeny Scores", in ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, R. Fleischer, J. Xu, Eds., 2008, pp. 60-71.
[74]M. Fellows et al., "Efficient parameterized preprocessing for cluster editing", in Fundamentals of Computation Theory, Proceedings, E. CsuhajVarju, Z. Esik, Eds., 2007, pp. 312-321.
[75]M. Fellows et al., "On the complexity of some colorful problems parameterized by treewidth", in Combinatorial Optimization and Applications, Proceedings, A. Dress, Y. Xu, B. Zhu, Eds., 2007, pp. 366-377.
[76]M. R. Fellows et al., "Sharp tractability borderlines for finding connected motifs in vertex-colored graphs", in Automata, Languages and Programming, Proceedings, L. Arge et al., Eds., 2007, pp. 340-351.
[77]H. L. Bodlaender et al., "Quadratic kernelization for convex recoloring of trees", in Computing and Combinatorics, Proceedings, G. Lin, Ed., 2007, pp. 86-96.
[78]B. Chorl et al., "Connected coloring completion for general graphs: Algorithms and complexity", in Computing and Combinatorics, Proceedings, G. Lin, Ed., 2007, pp. 75-85.
[79]M. Fellows, F. Rosamond, "The complexity ecology of parameters: An illustration using bounded max leaf number", in Computation and Logic in the Real World, Proceedings, S. Cooper, B. Lowe, A. Sorbi, Eds., 2007, pp. 268-277.
[80]F. Dehne et al., "NONBLOCKER: Parameterized algorithmics for MINIMUM DOMINATING SET", in SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, J. Wiedermann et al., Eds., pp. 237-245.
[81]F. Dehne et al., "An O(2(n)(O(k))(3)) FPT algorithm for the undirected Feedback Vertex Set problem", in COMPUTING AND COMBINATORICS, PROCEEDINGS, L. Wang, Ed., 2005, pp. 859-869.
[82]M. Fellows et al., "Faster fixed-parameter tractable algorithms for matching and packing problems", in ALGORITHMS ESA 2004, PROCEEDINGS, S. Albers, T. Radzik, Eds., pp. 311-322.
[83]M. Fellows, "A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing", in ALGORITHMS ESA 2004, PROCEEDINGS, S. Albers, T. Radzik, Eds., pp. 1-2.
[84]R. Dehne et al., "Greedy localization, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex cover", in PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, R. Downey, M. Fellows, F. Dehne, Eds., 2004, pp. 271-280.
[85]H. Bodlaender, M. Fellows and D. Thilikos, "Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms", in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, B. Rovan, P. Vojtas, Eds., pp. 239-248.
[86]M. Fellows, "Parameterized complexity: The main ideas and connections to practical computing", in EXPERIMENTAL ALGORITHMICS: FROM ALGORITHM DESIGN TO ROBUST AND EFFICIENT SOFTWARE, R. Fleischer, B. Moret, E. Schmidt, Eds., 2002, pp. 51-77.
[87]V. Dujmovic et al., "A fixed-parameter approach to two-layer planarization", in GRAPH DRAWING, P. Mutzel, M. Junger, S. Leipert, Eds., 2002, pp. 1-15.
[88]J. Alber et al., "Refined search tree technique for DOMINATING SET on planar graphs", in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, J. Sgall, A. Pultr, P. Kolman, Eds., pp. 111-122.
[89]M. Fellows, "Parameterized complexity: The main ideas and some research frontiers", in ALGORITHMS AND COMPUTATION, PROCEEDINGS, P. Eades, T. Takaoka, Eds., 2001, pp. 291-307.
[90]M. Fellows et al., "Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems", in FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, S. Kapoor, S. Prasad, Eds., pp. 240-251.
[91]M. Fellows, M. Hallett and U. Stege, "On the multiple gene duplication problem", in ALGORITHMS AND COMPUTATIONS, K. Chwa, O. Ibarra, Eds., 1998, pp. 347-356.

Refereed Workshop Papers

[92]M. Fellows et al., "Milling a Graph with Turn Costs: A Parameterized Complexity Perspective", in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, D. Thilikos, Ed., 2010, pp. 123-134.
[93]M. Fellows, "Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology", in COMBINATORIAL ALGORITHMS, J. Fiala, J. Kratochvil, M. Miller, Eds., 2009, pp. 2-10.
[94]M. R. Fellows, D. Hermelin and F. A. Rosamond, "Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs", in PARAMETERIZED AND EXACT COMPUTATION, J. Chen, F. Fomin, Eds., 2009, pp. 149-160.
[95]R. Enciso et al., "What Makes Equitable Connected Partition Easy", in PARAMETERIZED AND EXACT COMPUTATION, J. Chen, F. Fomin, Eds., 2009, pp. 122-133.
[96]M. Dom, M. R. Fellows and F. A. Rosamond, "Parameterized Complexity of Stabbing Rectangles and Squares in the Plane", in WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, S. Das, R. Uehara, Eds., 2009, pp. 298-309.
[97]M. Fellows et al., "A purely democratic characterization of W[1]", in PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, M. Grohe, Ed., 2008, pp. 103-114.
[98]M. R. Fellows, "The lost continent of polynomial time: Preprocessing and kernelization", in PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, H. Bodlaender, M. Langston, Eds., 2006, pp. 276-277.
[99]K. Burrage et al., "The undirected feedback vertex set problem has a poly(k) kernel", in PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, H. Bodlaender, M. Langston, Eds., 2006, pp. 192-202.
[100]R. G. Downey, M. R. Fellows and C. McCartin, "Parameterized approximation problems", in PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, H. Bodlaender, M. Langston, Eds., 2006, pp. 121-129.
[101]B. Chor, M. Fellows and D. Juedes, "Linear kernels in linear time, or how to save k Colors in O(n(2)) steps", in GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, J. Hromkovic, M. Nagl, B. Westfechtel, Eds., 2004, pp. 257-269.
[102]M. Fellows et al., "Finding k disjoint triangles in an arbitrary graph", in GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, J. Hromkovic, M. Nagl, B. Westfechtel, Eds., 2004, pp. 235-244.
[103]F. Dehne, M. Fellows and F. Rosamond, "An FPT algorithm for set splitting", in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, H. Bodlaender, Ed., 2003, pp. 180-191.
[104]M. Fellows, "Blow-ups, Win/Win's, and crown rules: Some new directions in FPT", in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, H. Bodlaender, Ed., 2003, pp. 1-12.
[105]M. Fellows, "New directions and new challenges in algorithm design and complexity, parameterized", in ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, F. Dehne, J. Sack, M. Smid, Eds., 2003, pp. 505-519.
[106]J. Ellis, H. Fan and M. Fellows, "The dominating set problem is fixed parameter tractable for graphs of bounded genus", in ALGORITHM THEORY - SWAT 2002, M. Penttonen, E. Schmidt, Eds., pp. 180-189.
[107]J. Alber, M. Fellows and R. Niedermeier, "Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case", in ALGORITHM THEORY - SWAT 2002, M. Penttonen, E. Schmidt, Eds., pp. 150-159.
[108]K. Cattell, M. Dinneen and M. Fellows, "Obstructions to within a few vertices or edges of acyclic", in ALGORITHMS AND DATA STRUCTURES, S. Akl et al., Eds., 1995, pp. 415-427.