The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael R. Fellows: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael R. Fellows, Michael A. Langston
    Nonconstructive Advances in Polynomial-Time Complexity. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:3, pp:155-162 [Journal]
  2. Michael R. Fellows, Michael A. Langston
    Nonconstructive tools for proving polynomial-time decidability. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:727-739 [Journal]
  3. Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Tractability and Completeness I: Basic Results. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:873-921 [Journal]
  4. Michael J. Dinneen, Michael R. Fellows, Vance Faber
    Algebraic Constructions of Efficient Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:152-158 [Conf]
  5. Michael R. Fellows, Neal Koblitz
    Fixed-Parameter Complexity and Cryptography. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:121-131 [Conf]
  6. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Kernelization for Convex Recoloring. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:23-35 [Conf]
  7. Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond
    FPT is P-Time Extremal Structure I. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:1-41 [Conf]
  8. Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons
    Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:62-69 [Conf]
  9. Michael R. Fellows, Michael A. Langston
    Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:278-287 [Conf]
  10. Michael R. Fellows, Neal Koblitz
    Self-Witnessing Polynomial-Time Complexity and Prime Factorization. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:107-110 [Conf]
  11. Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Intractability. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:36-49 [Conf]
  12. Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
    An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:859-869 [Conf]
  13. Rodney G. Downey, Patricia A. Evans, Michael R. Fellows
    Parameterized Learning Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:51-57 [Conf]
  14. Michael R. Fellows, Michael A. Langston
    Constructivity Issues in Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    Constructivity in Computer Science, 1991, pp:150-158 [Conf]
  15. Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
    Finite-State Computability of Annotations of Strings and Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:384-391 [Conf]
  16. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:15-30 [Conf]
  17. Michael R. Fellows, Neal Koblitz
    Kid Krypto. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:371-389 [Conf]
  18. Rodney G. Downey, Michael R. Fellows
    Fixed Parameter Tractability and Completeness. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:191-225 [Conf]
  19. Michael R. Fellows
    Parameterized Complexity: The Main Ideas and Connections to Practical Computing. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:51-77 [Conf]
  20. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  21. Michael R. Fellows
    A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:1-2 [Conf]
  22. Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege
    Analogs and Duals of teh MAST Problem for Sequences and Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:103-114 [Conf]
  23. Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
    DNA Physical Mapping: Three Ways Difficult. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:157-168 [Conf]
  24. Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
    Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  25. Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata
    On the Complexity of Fixed Parameter Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:210-215 [Conf]
  26. Michael R. Fellows, Michael A. Langston
    An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:520-525 [Conf]
  27. Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
    Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:240-251 [Conf]
  28. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    A Fixed-Parameter Approach to Two-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  29. Karl R. Abrahamson, Michael R. Fellows
    Finite automata, bounded treewidth, and well-quasiordering. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:539-564 [Conf]
  30. Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
    Induced minors and related problems. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:179-182 [Conf]
  31. Hans L. Bodlaender, Michael R. Fellows, Tandy Warnow
    Two Strikes Against Perfect Phylogeny. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:273-283 [Conf]
  32. Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson
    Parallel Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:67-70 [Conf]
  33. Michael R. Fellows
    Parameterized Complexity: The Main Ideas and Some Research Frontiers. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:291-307 [Conf]
  34. Michael R. Fellows, Michael T. Hallett, Ulrike Stege
    On the Multiple Gene Duplication Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:347-356 [Conf]
  35. Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond
    The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:192-202 [Conf]
  36. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
    Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:271-280 [Conf]
  37. Rodney G. Downey, Michael R. Fellows, Catherine McCartin
    Parameterized Approximation Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:121-129 [Conf]
  38. Michael R. Fellows
    The Lost Continent of Polynomial Time: Preprocessing and Kernelization. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:276-277 [Conf]
  39. Michael R. Fellows, Stefan Szeider, Graham Wrightson
    On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:223-234 [Conf]
  40. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
    Refined Search Tree Technique for DOMINATING SET on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:111-122 [Conf]
  41. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
    Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:239-248 [Conf]
  42. Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond
    NONBLOCKER: Parameterized Algorithmics for minimum dominating set. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:237-245 [Conf]
  43. Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Intractability II (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:374-385 [Conf]
  44. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
    On the Structure of Parameterized Problems in NP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:509-520 [Conf]
  45. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
    On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:262-273 [Conf]
  46. Michael R. Fellows, Michael A. Langston
    On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:501-512 [Conf]
  47. Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
    Clique-width minimization is NP-hard. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:354-362 [Conf]
  48. Jochen Alber, Michael R. Fellows, Rolf Niedermeier
    Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:150-159 [Conf]
  49. John A. Ellis, Hongbing Fan, Michael R. Fellows
    The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:180-189 [Conf]
  50. Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
    Obstructions to Within a Few Vertices or Edges of Acyclic. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:415-427 [Conf]
  51. Michael R. Fellows
    New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:505-520 [Conf]
  52. Michael R. Fellows
    Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:1-12 [Conf]
  53. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
    An FPT Algorithm for Set Splitting. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:180-191 [Conf]
  54. Michael R. Fellows, Donald K. Friesen, Michael A. Langston
    On Finding Optimal and Near-Optimal Lineal Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:549-560 [Journal]
  55. Michael R. Fellows, Jan Kratochvíl, Martin Middendorf, Frank Pfeiffer
    The Complexity of Induced Minors and Related Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:3, pp:266-282 [Journal]
  56. Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
    A Fixed-Parameter Approach to 2-Layer Planarization. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  57. Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:73, n:3, pp:235-276 [Journal]
  58. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
    Advice Classes of Parameterized Tractability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:84, n:1, pp:119-138 [Journal]
  59. Marco Cesati, Michael R. Fellows
    Sparse Parameterized Problems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:82, n:1, pp:1-15 [Journal]
  60. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
    Parameterized complexity analysis in computational biology. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1995, v:11, n:1, pp:49-57 [Journal]
  61. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
    On The Parameterized Intractability Of Motif Search Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:2, pp:141-167 [Journal]
  62. Michael R. Fellows, Jens Gramm, Rolf Niedermeier
    Parameterized Intractability of Motif Search Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  63. Jochen Alber, Michael R. Fellows, Rolf Niedermeier
    Polynomial Time Data Reduction for Dominating Set [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  64. Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
    The complexity of irredundant sets parameterized by size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:155-167 [Journal]
  65. Michael R. Fellows, Pavol Hell, Karen Seyffarth
    Large Planar Graphs with Given Diameter and Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:61, n:2, pp:133-153 [Journal]
  66. Michael R. Fellows, Neal Koblitz
    Self-Witnessing Polynomial-Time Complexity and Prime Factorization. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1992, v:2, n:3, pp:231-235 [Journal]
  67. Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
    Forbidden minors to graphs with small feedback sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:215-252 [Journal]
  68. Rodney G. Downey, Michael R. Fellows, Ulrike Stege
    Computational Tractability: The View From Mars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:69, n:, pp:73-97 [Journal]
  69. Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
    Proving NP-hardness for clique-width I: non-approximability of sequential clique-width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:080, pp:- [Journal]
  70. Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
    Proving NP-hardness for clique-width II: non-approximability of clique-width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:081, pp:- [Journal]
  71. Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond
    Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  72. Michael R. Fellows
    Parameterized Complexity: The Main Ideas and Connections to Practical Computing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:61, n:, pp:- [Journal]
  73. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
    On the Structure of Parameterized Problems in NP. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:38-49 [Journal]
  74. R. Balasubramanian, Michael R. Fellows, Venkatesh Raman
    An Improved Fixed-Parameter Algorithm for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:163-168 [Journal]
  75. Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
    A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:4, pp:197-203 [Journal]
  76. Jochen Alber, Michael R. Fellows, Rolf Niedermeier
    Polynomial-time data reduction for dominating set. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:3, pp:363-384 [Journal]
  77. John A. Ellis, Hongbing Fan, Michael R. Fellows
    The dominating set problem is fixed parameter tractable for graphs of bounded genus. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:2, pp:152-168 [Journal]
  78. Michael R. Fellows, Michael T. Hallett, Ulrike Stege
    Analogs & duals of the MAST problem for sequences & trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:192-216 [Journal]
  79. Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
    A refined search tree technique for Dominating Set on planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:385-405 [Journal]
  80. Jianer Chen, Michael R. Fellows
    Foreword from the guest editors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:653- [Journal]
  81. Michael R. Fellows, Michael A. Langston
    On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:769-779 [Journal]
  82. Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
    A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1194-1198 [Journal]
  83. Michael R. Fellows, Pavol Hell, Karen Seyffarth
    Constructions of large planar networks with given degree and diameter. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:4, pp:275-281 [Journal]
  84. Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle
    The Parametrized Complexity of Some Fundamental Problems in Coding Theory. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:545-570 [Journal]
  85. Samir Khuller, Balaji Raghavachari, Michael R. Fellows
    Approximating the Minimum Equivalent Digraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:859-872 [Journal]
  86. Michael R. Fellows
    Transversals of Vertex Partitions in Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:2, pp:206-215 [Journal]
  87. Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
    The Private Neighbor Cube. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:41-47 [Journal]
  88. Michael R. Fellows, Michael A. Langston
    On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:117-126 [Journal]
  89. Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton
    Small Diameter Symmetric Networks from Linear Groups. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:2, pp:218-220 [Journal]
  90. Michael R. Fellows, Michael A. Langston
    Processor Utilization in a Linearly Connected Parallel Processing System. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:5, pp:594-603 [Journal]
  91. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:31-54 [Journal]
  92. Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy Warnow
    The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:167-188 [Journal]
  93. Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
    On computing graph minor obstruction sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:107-127 [Journal]
  94. Rodney G. Downey, Michael R. Fellows
    Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:109-131 [Journal]
  95. Rodney G. Downey, Michael R. Fellows
    Threshold Dominating Sets and an Improved Characterization of W[2]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:123-140 [Journal]
  96. Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
    Parameterized Circuit Complexity and the W Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:97-115 [Journal]
  97. Michael R. Fellows, Catherine McCartin
    On the parametric complexity of schedules to minimize tardy tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:298, pp:317-324 [Journal]
  98. Michael R. Fellows, Stefan Szeider, Graham Wrightson
    On finding short resolution refutations and small unsatisfiable subsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:351-359 [Journal]
  99. Michael R. Fellows, Frances A. Rosamond
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:268-277 [Conf]
  100. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Quadratic Kernelization for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:86-96 [Conf]
  101. Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
    Connected Coloring Completion for General Graphs: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:75-85 [Conf]
  102. Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
    Efficient Parameterized Preprocessing for Cluster Editing. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:312-321 [Conf]
  103. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:340-351 [Conf]
  104. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
    On the Complexity of Some Colorful Problems Parameterized by Treewidth. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:366-377 [Conf]
  105. Daniel J. Kleitman, Michael R. Fellows
    Radius and diameter in Manhattan lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:119-125 [Journal]

  106. Fixed-Parameter Algorithms for Kemeny Scores. [Citation Graph (, )][DBLP]


  107. Facility Location Problems: A Parameterized View. [Citation Graph (, )][DBLP]


  108. A Linear Kernel for Co-Path/Cycle Packing. [Citation Graph (, )][DBLP]


  109. How similarity helps to efficiently compute Kemeny rankings. [Citation Graph (, )][DBLP]


  110. Graph-Based Data Clustering with Overlaps. [Citation Graph (, )][DBLP]


  111. Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. [Citation Graph (, )][DBLP]


  112. Haplotype Inference Constrained by Plausible Haplotype Data. [Citation Graph (, )][DBLP]


  113. On Problems without Polynomial Kernels (Extended Abstract). [Citation Graph (, )][DBLP]


  114. Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]


  115. Local Search: Is Brute-Force Avoidable? [Citation Graph (, )][DBLP]


  116. Leaf Powers and Their Properties: Using the Trees. [Citation Graph (, )][DBLP]


  117. Graph Layout Problems Parameterized by Vertex Cover. [Citation Graph (, )][DBLP]


  118. What Makes Equitable Connected Partition Easy. [Citation Graph (, )][DBLP]


  119. A Purely Democratic Characterization of W[1]. [Citation Graph (, )][DBLP]


  120. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. [Citation Graph (, )][DBLP]


  121. Clustering with Partial Information. [Citation Graph (, )][DBLP]


  122. A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. [Citation Graph (, )][DBLP]


  123. A Generalization of Nemhauser and Trotter's Local Optimization Theorem. [Citation Graph (, )][DBLP]


  124. The Parameterized Complexity of Some Minimum Label Problems. [Citation Graph (, )][DBLP]


  125. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. [Citation Graph (, )][DBLP]


  126. Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. [Citation Graph (, )][DBLP]


  127. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  128. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  129. Index sets and parametric reductions. [Citation Graph (, )][DBLP]


  130. On the parameterized complexity of short computation and factorization. [Citation Graph (, )][DBLP]


  131. The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. [Citation Graph (, )][DBLP]


  132. Parameterized Low-distortion Embeddings - Graph metrics into lines and trees [Citation Graph (, )][DBLP]


  133. A Generalization of Nemhauser and Trotter's Local Optimization Theorem [Citation Graph (, )][DBLP]


  134. Abstract Milling with Turn Costs [Citation Graph (, )][DBLP]


  135. Parameterized Control Complexity in Fallback Voting [Citation Graph (, )][DBLP]


  136. Parameterizing by the Number of Numbers [Citation Graph (, )][DBLP]


  137. Constructive complexity. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002