{"id":708,"date":"2017-11-06T20:54:28","date_gmt":"2017-11-06T09:54:28","guid":{"rendered":"http:\/\/www.mrfellows.net\/?page_id=708"},"modified":"2018-10-16T02:01:39","modified_gmt":"2018-10-15T15:01:39","slug":"publications","status":"publish","type":"page","link":"https:\/\/mike-fellows.net\/wordpress\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"
\n

bibliometric Information. My research contributions have been internationally recognized.<\/strong> I have published over 200 articles in high-quality peer reviewed journals (such as J. of ACM, TOCT, SIAM J. Computing, J. Comput. Syst. Sci., Algorithmica, Discrete Optimization, IEEE\/ACM Trans. Comput. Biology Bioinform.) and conference proceedings (such as ICALP, ESA, IJCAI, FOCS, STOC, STACS, AAAI). I have written 2 books on Parameterized Complexity (with Rod Downey), edited Special Issues, and co-authored book chapters. My publications (total over my career so far) have received more than 14,000 citations, h = 57 (Google Scholar). Papers published in the last ten years only have already garnered more than 5700 citations, h=34.<\/p>\n

All Publications By Year<\/u><\/strong><\/p>\n

 
\n2018<\/span>

\n
    \n
  1. \n
      \n
    1. Rosamond, Frances. Computational Thinking Enrichment: Public-Key <\/span>
      \nCryptography.<\/span>
      \nInformatics in Education, v17 n1 p93-103 2018<\/span><\/li>\n
    2. Michael R. Fellows: Norwegian Research Council Toppforsk Proposal, “Parameterized Complexity for Practical Computing” (PCPC). Submitted 2017. Awarded 2018. (Retrieved from http:\/\/www.mrfellows.net\/publications\/) [ pdf<\/a> ]<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n <\/p>\n2017<\/span>
      \n
        \n
      1. \n
          \n
        1. \n
            \n
          1. Michael R. Fellows: Surfing with Rod. Computability and Complexity 2017<\/a>: 9-18<\/li>\n
          2. Adam R. Day<\/a>, Michael R. Fellows, Noam Greenberg<\/a>, Bakhadyr Khoussainov<\/a>, Alexander G. Melnikov<\/a>, Frances A. Rosamond<\/a>: Computability and Complexity – Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science<\/a> 10010, Springer 2017, ISBN 978-3-319-50061-4 [contents]<\/a><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

             <\/p>\n2016<\/span>

            \n
              \n
            1. \n
                \n
              1. \n
                  \n
                1. Michael R. Fellows: Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You. Bulletin of the EATCS 119<\/a> (2016) [ pdf<\/a> ]<\/li>\n
                2. Michael R. Fellows, Danny Hermelin<\/a>, Frances A. Rosamond<\/a>, Hadas Shachnai<\/a>: Tractable Parameterizations for the Minimum Linear Arrangement Problem. TOCT 8(2)<\/a>: 6:1-6:12 (2016) [ pdf<\/a> ]<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                   <\/p>\n2015<\/span>

                  \n
                    \n
                  1. \n
                      \n
                    1. \n
                        \n
                      1. Ren\u00e9 van Bevern<\/a>, Rodney G. Downey<\/a>, Michael R. Fellows, Serge Gaspers<\/a>, Frances A. Rosamond<\/a>: Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4)<\/a>: 696-729 (2015) [ pdf<\/a> ]<\/li>\n
                      2. U\u00e9verton dos Santos Souza<\/a>, Frances A. Rosamond<\/a>, Michael R. Fellows, F\u00e1bio Protti<\/a>, Maise Dantas da Silva<\/a>: The Flood-It game parameterized by the vertex cover number. Electronic Notes in Discrete Mathematics 50<\/a>: 35-40 (2015)<\/li>\n
                      3. G\u00e1bor Erd\u00e9lyi<\/a>, Michael R. Fellows, J\u00f6rg Rothe<\/a>, Lena Schend<\/a>: Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4)<\/a>: 632-660 (2015)<\/li>\n
                      4. G\u00e1bor Erd\u00e9lyi<\/a>, Michael R. Fellows, J\u00f6rg Rothe<\/a>, Lena Schend<\/a>: Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. 81(4)<\/a>: 661-670 (2015)<\/li>\n
                      5. Michael R. Fellows, U\u00e9verton dos Santos Souza<\/a>, F\u00e1bio Protti<\/a>, Maise Dantas da Silva<\/a>: Tractability and hardness of flood-filling games on trees. Theor. Comput. Sci. 576<\/a>: 102-116 (2015)<\/li>\n
                      6. Faisal N. Abu-Khzam<\/a>, Judith Egan<\/a>, Michael R. Fellows, Frances A. Rosamond<\/a>, Peter Shaw<\/a>: On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607<\/a>: 426-434 (2015)<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                         <\/p>\n2014<\/span>

                        \n
                          \n
                        1. \n
                            \n
                          1. \n
                              \n
                            1. Robert Crowston<\/a>, Michael R. Fellows, Gregory Gutin<\/a>, Mark Jones<\/a>, Eun Jung Kim<\/a>, Fran Rosamond<\/a>, Imre Z. Ruzsa<\/a>, St\u00e9phan Thomass\u00e9<\/a>, Anders Yeo<\/a>: Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80(4)<\/a>: 687-696 (2014) [ pdf<\/a> ]<\/li>\n
                            2. Cristina Bazgan<\/a>, Morgan Chopin<\/a>, Marek Cygan<\/a>, Michael R. Fellows, Fedor V. Fomin<\/a>, Erik Jan van Leeuwen<\/a>: Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80(7)<\/a>: 1285-1297 (2014) [ pdf<\/a> ]<\/li>\n
                            3. Michael R. Fellows, Bart M. P. Jansen<\/a>: FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. TOCT 6(4)<\/a>: 16:1-16:26 (2014)<\/li>\n
                            4. Faisal N. Abu-Khzam<\/a>, Judith Egan<\/a>, Michael R. Fellows, Frances A. Rosamond<\/a>, Peter Shaw<\/a>: On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. COCOA 2014<\/a>: 625-636<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                               <\/p>\n2013<\/span>

                              \n
                                \n
                              1. \n
                                  \n
                                1. \n
                                    \n
                                  1. Rodney G. Downey<\/a>, Michael R. Fellows: Fundamentals of Parameterized Complexity. Texts in Computer Science<\/a>, Springer 2013, ISBN 978-1-4471-5558-4, pp. I-SSS, 3-707<\/li>\n
                                  2. Michael R. Fellows, Bart M. P. Jansen<\/a>, Frances A. Rosamond<\/a>: Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34(3)<\/a>: 541-566 (2013)<\/li>\n
                                  3. Michael R. Fellows, Tobias Friedrich<\/a>, Danny Hermelin<\/a>, Nina Narodytska<\/a>, Frances A. Rosamond<\/a>: Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472<\/a>: 81-89 (2013)<\/li>\n
                                  4. Michael R. Fellows, Fedor V. Fomin<\/a>, Daniel Lokshtanov<\/a>, Elena Losievskaja<\/a>, Frances A. Rosamond<\/a>, Saket Saurabh<\/a>: Distortion is Fixed Parameter Tractable. TOCT 5(4)<\/a>: 16:1-16:20 (2013)<\/li>\n
                                  5. Michael R. Fellows, Danny Hermelin<\/a>, Frances A. Rosamond<\/a>, Hadas Shachnai<\/a>: Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013<\/a>: 457-468<\/li>\n
                                  6. Ren\u00e9 van Bevern<\/a>, Michael R. Fellows, Serge Gaspers<\/a>, Frances A. Rosamond<\/a>: Myhill-Nerode Methods for Hypergraphs. ISAAC 2013<\/a>: 372-382<\/li>\n
                                  7. Michael R. Fellows, Bart M. P. Jansen<\/a>: FPT Is Characterized by Useful Obstruction Sets. WG 2013<\/a>: 261-273<\/li>\n
                                  8. Michael R. Fellows, Xuehou Tan<\/a>, Binhai Zhu<\/a>: Frontiers in Algorithmics and<\/i> Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science<\/a> 7924, Springer 2013, ISBN 978-3-642-38755-5 [contents]<\/a><\/li>\n
                                  9. Michael R. Fellows, Bart M. P. Jansen<\/a>: FPT is Characterized by Useful Obstruction Sets. CoRR abs\/1305.3102<\/a> (2013)<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                     <\/p>\n2012<\/span>

                                    \n
                                      \n
                                    1. \n
                                        \n
                                      1. \n
                                          \n
                                        1. Michael Dom<\/a>, Michael R. Fellows, Frances A. Rosamond<\/a>, Somnath Sikdar<\/a>: The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62(1-2)<\/a>: 564-594 (2012)<\/li>\n
                                        2. Michael R. Fellows, Danny Hermelin<\/a>, Frances A. Rosamond<\/a>: Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1)<\/a>: 3-18 (2012)<\/li>\n
                                        3. Michael R. Fellows, Fedor V. Fomin<\/a>, Daniel Lokshtanov<\/a>, Frances A. Rosamond<\/a>, Saket Saurabh<\/a>, Yngve Villanger<\/a>: Local search: Is brute-force avoidable? J. Comput. Syst. Sci. 78(3)<\/a>: 707-719 (2012)<\/li>\n
                                        4. Michael R. Fellows, Serge Gaspers<\/a>, Frances A. Rosamond<\/a>: Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4)<\/a>: 675-693 (2012)<\/li>\n
                                        5. Michael R. Fellows, Andreas Pfandler<\/a>, Frances A. Rosamond<\/a>, Stefan R\u00fcmmele<\/a>: The Parameterized Complexity of Abduction. AAAI 2012<\/a><\/li>\n
                                        6. Leo Brueggeman<\/a>, Michael R. Fellows, Rudolf Fleischer<\/a>, Martin Lackner<\/a>, Christian Komusiewicz<\/a>, Yiannis Koutis<\/a>, Andreas Pfandler<\/a>, Frances A. Rosamond<\/a>: Train Marshalling Is Fixed Parameter Tractable. FUN 2012<\/a>: 51-56<\/li>\n
                                        7. Michael R. Fellows, Ariel Kulik<\/a>, Frances A. Rosamond<\/a>, Hadas Shachnai<\/a>: Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012<\/a>: 351-362<\/li>\n
                                        8. Ren\u00e9 van Bevern<\/a>, Michael R. Fellows, Serge Gaspers<\/a>, Frances A. Rosamond<\/a>: How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding. CoRR abs\/1211.1299<\/a> (2012)<\/li>\n
                                        9. Michael R. Fellows, Jiong Guo<\/a>, D\u00e1niel Marx<\/a>, Saket Saurabh<\/a>: Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). Dagstuhl Reports 2(6)<\/a>: 26-50 (2012)<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                           <\/p>\n2011<\/span>

                                          \n
                                            \n
                                          1. \n
                                              \n
                                            1. \n
                                                \n
                                              1. Hans L. Bodlaender<\/a>, Michael R. Fellows, Michael A. Langston<\/a>, Mark A. Ragan<\/a>, Frances A. Rosamond<\/a>, Mark Weyer<\/a>: Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61(2)<\/a>: 362-388 (2011)<\/li>\n
                                              2. Michael R. Fellows, Henning Fernau<\/a>: Facility location problems: A parameterized view. Discrete Applied Mathematics 159(11)<\/a>: 1118-1130 (2011)<\/li>\n
                                              3. Michael R. Fellows, Fedor V. Fomin<\/a>, Gregory Gutin<\/a>: Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1)<\/a>: 1 (2011)<\/li>\n
                                              4. Michael R. Fellows, Jiong Guo<\/a>, Christian Komusiewicz<\/a>, Rolf Niedermeier<\/a>, Johannes Uhlmann<\/a>: Graph-based data clustering with overlaps. Discrete Optimization 8(1)<\/a>: 2-17 (2011)<\/li>\n
                                              5. Michael R. Fellows, Fedor V. Fomin<\/a>, Daniel Lokshtanov<\/a>, Frances A. Rosamond<\/a>, Saket Saurabh<\/a>, Stefan Szeider<\/a>, Carsten Thomassen<\/a>: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2)<\/a>: 143-153 (2011)<\/li>\n
                                              6. Michael R. Fellows, Guillaume Fertin<\/a>, Danny Hermelin<\/a>, St\u00e9phane Vialette<\/a>: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4)<\/a>: 799-811 (2011)<\/li>\n
                                              7. Michael R. Fellows, Jiong Guo<\/a>, Hannes Moser<\/a>, Rolf Niedermeier<\/a>: A generalization of Nemhauser and Trotter\u02bcs local optimization theorem. J. Comput. Syst. Sci. 77(6)<\/a>: 1141-1158 (2011)<\/li>\n
                                              8. Nadja Betzler<\/a>, Ren\u00e9 van Bevern<\/a>, Michael R. Fellows, Christian Komusiewicz<\/a>, Rolf Niedermeier<\/a>: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE\/ACM Trans. Comput. Biology Bioinform. 8(5)<\/a>: 1296-1308 (2011)<\/li>\n
                                              9. Michael R. Fellows, Tzvika Hartman<\/a>, Danny Hermelin<\/a>, Gad M. Landau<\/a>, Frances A. Rosamond<\/a>, Liat Rozenberg<\/a>: Haplotype Inference Constrained by Plausible Haplotype Data. IEEE\/ACM Trans. Comput. Biology Bioinform. 8(6)<\/a>: 1692-1699 (2011)<\/li>\n
                                              10. Michael R. Fellows, Jiong Guo<\/a>, Hannes Moser<\/a>, Rolf Niedermeier<\/a>: A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. TOCT 2(2)<\/a>: 5:1-5:23 (2011)<\/li>\n
                                              11. Michael R. Fellows: Recent Developments in the Theory of Pre-processing. FAW-AAIM 2011<\/a>: 4-5<\/li>\n
                                              12. Robert Crowston<\/a>, Michael R. Fellows, Gregory Gutin<\/a>, Mark Jones<\/a>, Frances A. Rosamond<\/a>, St\u00e9phan Thomass\u00e9<\/a>, Anders Yeo<\/a>: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011<\/a>: 229-240<\/li>\n
                                              13. Michael R. Fellows, Tobias Friedrich<\/a>, Danny Hermelin<\/a>, Nina Narodytska<\/a>, Frances A. Rosamond<\/a>: Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011<\/a>: 522-527<\/li>\n
                                              14. Cristina Bazgan<\/a>, Morgan Chopin<\/a>, Michael R. Fellows: Parameterized Complexity of the Firefighter Problem. ISAAC 2011<\/a>: 643-652<\/li>\n
                                              15. Michael R. Fellows, Serge Gaspers<\/a>, Frances A. Rosamond<\/a>: Multivariate Complexity Theory. Computer Science, The Hardware, Software and Heart of It 2011<\/a>: 269-293<\/li>\n
                                              16. G\u00e1bor Erd\u00e9lyi<\/a>, Michael R. Fellows, Lena Piras<\/a>, J\u00f6rg Rothe<\/a>: Control Complexity in Bucklin and Fallback Voting. CoRR abs\/1103.2230<\/a> (2011)<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                 <\/p>\n2010<\/span>

                                                \n
                                                  \n
                                                1. \n
                                                    \n
                                                  1. \n
                                                      \n
                                                    1. Fellows, M. R., Fomin, F. V., and Gutin, G. Special Issue on Parameterized Complexity. <\/span>Discrete Optimization<\/em> (2010). To Appear. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                    2. Fellows, M. R., Fertin, G., Hermelin, D., and Vialette, S. Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. <\/span>Computer and System Sciences<\/em> (2010). To Appear. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                    3. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Hermelin, D. On problems without polynomial kernels. <\/span>Journal of Computer and System Sciences<\/em> (2010). To Appear. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                       <\/p>\n2009<\/span>

                                                      \n
                                                        \n
                                                      1. \n
                                                          \n
                                                        1. \n
                                                            \n
                                                          1. Fellows, M. R., Hermelin, D., and Rosamond, F. A. Well-quasi-ordering bounded treewidth graphs. In <\/span>Proceedings of International Workshop on Parameterized and Exact Computation, IWPEC\u201909<\/em> (2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          2. Fellows, M. R. The complexity ecology of parameters: Some new developments and research directions. In <\/span>Proceedings of IWOCA<\/em> (2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          3. Fellows, M. R., Hermelin, D., Rosamond, F. A., and Vialette, S. On the parameterized complexity of multiple-interval graph problems. <\/span>Journal of Theoretical Computer Science 410<\/em>, 1 (2009), 53-61. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          4. Fellows, M. R., Guo, J., Komusiewicz, C., Niedermeier, R., and Uhlmann, J. Graph-based data clustering with overlaps. In <\/span>Proceedings of COCOON<\/em> (2009), vol. 5609 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 516-526. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          5. Fellows, M. R., Guo, J., and Kanj, I. The parameterized complexity of some minimum label problems. In <\/span>Proceedings of WG<\/em> (2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          6. Fellows, M. R., Hartman, T., Hermelin, D., Landau, G. M., Rosamond, F. A., and Rozenberg, L. Haplotype inference constrained by plausible haplotype data. In <\/span>Proceedings of the of the 20th Combinatorial Pattern Matching conference, CPM<\/em> (2009), pp. 339-352. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          7. Betzler, N., Fellows, M. R., Guo, J., Niedermeier, R., and Rosamond, F. Fixed-parameter algorithms for Kemeny Rankings. <\/span>Theoretical Computer Science<\/em> (2009). Accepted for publication, August 2009, 30 pages. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          8. Betzler, N., Fellows, M. R., Guo, J., Niedermeier, R., and Rosamond, F. A. How similarity helps to efficiently compute Kemeny Rankings. In <\/span>Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems AAMAS<\/em> (2009), pp. 657-664. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          9. Fellows, M., Hromkovic, J., Rosamond, F., and Steinova, M. Fixed-parameter tractability, relative kernelization and the effectivization of structural connections. In <\/span>Proceedings of CiE\u201909<\/em>(2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          10. Fellows, M. R., Guo, J., Moser, H., and Niedermeier, R. A complexity dichotomy for finding disjoint solutions of vertex deletion problems. In <\/span>Proceedings of MFCS\u201909<\/em> (2009), vol. 5734 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 319-330. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          11. Enciso, R., Fellows, M. R., Guo, J., Kanj, I., Rosamond, F., and Suchy, A. What makes equitable connected partition easy? In <\/span>Proceedings of International Workshop of Parameterized and Exact Computation, IWPEC\u201909<\/em> (2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                          12. Fellows, M., Fomin, F. V., Lokshtanov, D., Rosamond, F., Saurabh, S., and Villanger, Y. Local search: Is brute force avoidable? In <\/span>Proceedings International Joint Conference on Artificial Intelligence, IJCAI\u201909<\/em> (2009). To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          13. Fellows, M. R., Fomin, F. V., Lokshtanov, D., Losievskaja, E., Rosamond, F. A., and Saurabh, S. Distortion is fixed parameter tractable. In <\/span>Proceedings of ICALP\u201909 (Track A)<\/em> (2009), pp. 463-474. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          14. Fellows, M., Fomin, F., Lokshtanov, D., Losievskaja, E., Rosamond, F. A., and Saurabh, S. Parameterized low-distortion embeddings \u2013 graph metrics into lines and trees. Tech. rep., 2009. Manuscript. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                          15. Fellows, M., Giannopoulos, P., Knauer, C., Paul, C., Rosamond, F., Whitesides, S., and Yu, N. On the parameterized complexity of the discrete milling problem with turn costs. In<\/span>Proceedings of FST TCS\u201909<\/em> (2009), Springer-Verlag. To Appear. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                          16. M. Dom, M. F., and Rosamond, F. Parameterized complexity of stabbing rectangles and squares in the plane. In <\/span>Proceedings of the 3rd Workshop on Algorithms and Computation, WALCOM\u201909<\/em> (2009), vol. 5431 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 298-309. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          17. Fellows, M., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F., and Saurabh, S. The complexity ecology of parameters: An illustration using bounded max leaf number. <\/span>Theory of Computing Systems 45<\/em> (2009), 822-848. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          18. Fellows, M., Guo, J., Moser, H., and Niedermeier, R. A generalization of Nemhauser and Trotter\u2019s local optimization algorithm. In <\/span>Proceedings of STACS\u201909<\/em> (2009), pp. 409-420. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          19. Fellows, M., Hromkovic, J., Rosamond, F., and Steinova, M. Fixed-parameter tractability, relative kernelization and the effectivization of structural connections. In <\/span>Proceedings of CiE\u201909<\/em>(2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          20. Fellows, M. R. The complexity ecology of parameters: Some new developments and research directions. In <\/span>Proceedings of IWOCA\u201909<\/em> (2009), Lecture Notes in Computer Science, Springer-Verlag. To Appear. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          21. Fellows, M., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F., and Saurabh, S. The complexity ecology of parameters: An illustration using bounded max leaf number. <\/span>Theory of Computing Systems 45<\/em> (2009), 822-848. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          22. Bodlaender, H., Fellows, M., Langston, M., Ragan, M., Rosamond, F., and Weyer, M. Quadratic kernelization for convex recoloring of trees. <\/span>Algorithmica<\/em> (2009). Accepted to Algorithmica. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          23. Bodlaender, H., Fellows, M., and Thilikos, D. Derivation of algorithms for cutwidth and related graph layout parameters. <\/span>Journal of Computer and System Sciences 75<\/em> (2009). [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                          24. Fellows, M., Rosamond, F., Rotics, U., and Szeider, S. Cliquewidth is NP-Complete. <\/span>SIAM Journal on Discrete Mathematics (SIDMA) 23<\/em>, 2 (2009). A preliminary and shortened version of this paper appeared in the proceedings of STOC 2006; 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pp. 354\u2014362, ACM Press, 2006. This paper combines the results of the technical reports: Proving NP-Hardness for Clique-Width I: Non-approximability of Sequential Clique-width, and, Proving NP-Hardness for Clique-Width II: Non-approximability of Clique-width; Electronic Colloquium on Computational Complexity (ECCC). [ <\/span>bib<\/a> | <\/span>pdf<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          25. Fellows, M. R., Fomin, F. V., Lokshtanov, D., Losievskaja, E., Rosamond, F. A., and Saurabh, S. Distortion is fixed parameter tractable. In <\/span>Proceedings of ICALP 2009 (Track A)<\/em>(2009), pp. 463-474. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                          26. Fellows, M., Fomin, F., Lokshtanov, D., Losievskaja, E., Rosamond, F. A., and Saurabh, S. Parameterized low-distortion embeddings \u2013 graph metrics into lines and trees. Tech. rep., 2009. Manuscript. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                          27. <\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                             <\/p>\n2008<\/span>

                                                            \n
                                                              \n
                                                            1. \n
                                                                \n
                                                              1. \n
                                                                  \n
                                                                1. Downey, R., Fellows, M., and Langston, M. The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. <\/span>The Computer Journal 51<\/em>, 1 (2008), 1-6. The Computer Journal published a two-issue special on Parameterized Complexity that includes 15 survey articles, as well as an Introduction and Overview. The issues are Volume 51, 2008, Issue 1 and Issue 3. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                2. Bodlaender, H. L., Demaine, E. D., Fellows, M. R., Guo, J., Hermelin, D., Lokshtanov, D., M\u00fcller, M., Venkatesh Raman, J. v. R., and Rosamond, F. A. Open problems in parameterized and exact computation from iwpec 2008. Tech. Rep. UU-CS-2008-017, Department of Information and Computing Sciences, Utrecht University, 2008. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                3. Betzler, N., Fellows, M. R., Komusiewicz, C., and Niedermeier, R. Parameterized algorithms and hardness results for some graph motif problems. In <\/span>Proceedings of Combinatorial Pattern Matching, 19th Annual Symposium, CPM,<\/em> (2008), P. Ferragina and G. M. Landau, Eds., vol. 5029 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 31-43. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                4. Betzler, N., Fellows, M. R., Guo, J., Niedermeier, R., and Rosamond, F. A. Fixed-parameter algorithms for Kemeny scores. In <\/span>Proceedings of Algorithmic Aspects in Information and Management, 4th International Conference, AAIM<\/em> (2008), R. Fleischer and J. Xu, Eds., vol. 5034 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 60-71. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                5. Betzler, N., Fellows, M. R., Guo, J., Niedermeier, R., and Rosamond, F. A. Computing Kemeny Rankings, parameterized by the average K-T distance. In <\/span>Proceedings of the 2nd International Workshop on Computational Social Choice, COMSOC<\/em> (2008). [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                6. Fellows, M. R., Rosamond, F., and Spdfo, A. Sensing God\u2019s Will is fixed parameter tractable. Tech. rep., University of Auckland, New Zealand, 2008. University of Auckland, NZ Mathematics Research Report, 9 pages. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                7. Fellows, M. R., Hermelin, D., M\u00fcller, M., and Rosamond, F. A. A purely democratic characterization of W[1]. In <\/span>Proceedings of Parameterized and Exact Computation, Third International Workshop IWPEC\u201908<\/em> (2008), M. Grohe and R. Niedermeier, Eds., vol. 5018 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 103-114. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                8. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Hermelin, D. On problems without polynomial kernels. In <\/span>Automata, Languages and Programming, 35th International Colloquium, ICALP\u201908, Part I: Track A: Algorithms, Automata, Complexity, and Games<\/em> (2008), L. Aceto, I. Damg\u00e5rd, L. A. Goldberg, M. M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, and I. Walukiewicz, Eds., vol. 5125 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 563-574. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                9. Fellows, M., Flum, J., Hermelin, D., Muller, M., and Rosamond, F. W-hierarchies defined by symmetric gates. <\/span>Theory of Computing Systems<\/em> (2008). [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                10. Fellows, M., and Fernau, H. Facility location problems: A parameterized view. In <\/span>Proceedings of AAIM\u201908<\/em> (2008), vol. 5034 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 188-199. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                11. Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D., and Whitesides, S. Faster fixed parameter tractable algorithms for matching and packing problems. <\/span>Algorithmica 52<\/em>, 2 (2008), 167-176. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                12. Dujmovic, V., Fellows, M. R., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., and Wood, D. R. On the parameterized complexity of layered graph drawing. <\/span>Algorithmica 52<\/em>, 2 (2008), 267-292. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                13. Fellows, M. R., Meister, D., Rosamond, F. A., Sritharan, R., and Telle, J. A. Leaf powers and their properties: Using the trees. In <\/span>Proceedings of Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia<\/em> (2008), S.-H. Hong, H. Nagamochi, and T. Fukunaga, Eds., vol. 5369 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 402-413. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                14. Fellows, M. R., Lokshtanov, D., Misra, N., Rosamond, F. A., and Saurabh, S. Graph layout problems parameterized by vertex cover. In <\/span>Proceedings of Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia<\/em> (2008), S.-H. Hong, H. Nagamochi, and T. Fukunaga, Eds., vol. 5369 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 294-305. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                15. Bodlaender, H. L., Fellows, M. R., Heggernes, P., Mancini, F., Papadopoulos, C., and Rosamond, F. A. Clustering with partial information. In <\/span>Proceedings of Mathematical Foundations of Computer Science, 33rd International Symposium, MFCS 2008, Torun, Poland<\/em> (2008), E. Ochmanski and J. Tyszkiewicz, Eds., vol. 5162 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 144-155. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                16. Fellows, M. R., and Fernau, H. Facility location problems: A parameterized view. In <\/span>Proceedings of Algorithmic Aspects in Information and Management, 4th International Conference, AAIM\u201908<\/em> (2008), R. Fleischer and J. Xu, Eds., vol. 5034 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 188-199. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                17. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Hermelin, D. On problems without polynomial kernels. In <\/span>Automata, Languages and Programming, 35th International Colloquium, ICALP\u201908, Part I: Track A: Algorithms, Automata, Complexity, and Games<\/em> (2008), L. Aceto, I. Damg\u00e5rd, L. A. Goldberg, M. M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, and I. Walukiewicz, Eds., vol. 5125 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 563-574. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                   <\/p>\n2007<\/span>

                                                                  \n
                                                                    \n
                                                                  1. \n
                                                                      \n
                                                                    1. \n
                                                                        \n
                                                                      1. Fellows, M. R., and Rosamond, F. A. The complexity ecology of parameters: An illustration using bounded max leaf number. In <\/span>Proceedings of Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE, Siena, Italy<\/em> (2007), S. B. Cooper, B. L\u00f6we, and A. Sorbi, Eds., vol. 4497 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 268-277. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      2. Fellows, M., and Rosamond, F. Why is P Not Equal to NP? In <\/span>Computation and Logic in the Real World: Third Conference on Computability in Europe, CiE 2007: Local Proceedings<\/em> (2007). [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      3. Fellows, M. R., Fertin, G., Hermelin, D., and Vialette, S. Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. In <\/span>Proceedings of Automata, Languages and Programming, 34th International Colloquium, ICALP<\/em> (2007), L. Arge, C. Cachin, T. Jurdzinski, and A. Tarlecki, Eds., vol. 4596 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 340-351. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      4. Fellows, M. R., Langston, M. A., Rosamond, F. A., and Shaw, P. Efficient parameterized preprocessing for cluster editing. In <\/span>Fundamentals of Computation Theory, 16th International Symposium, FCT, Budapest, Hungary<\/em> (2007), E. Csuhaj-Varj\u00fa and Z. \u00c9sik, Eds., vol. 4639 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 312-321. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      5. Christian, R., Fellows, M. R., Rosamond, F., and Spdfo, A. On the complexity of lobbying in multiple referenda. <\/span>Review of Economic Design 11<\/em> (2007), 217-224. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      6. Fellows, M., Fomin, F. V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., and Thomassen., C. On the complexity of some colorful problems parameterized by treewidth. (invited paper). In <\/span>Proceedings of First International Conference on Combinatorial Optimization and Applications COCOA\u201907<\/em> (2007), vol. 4616 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 366-377. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      7. Cai, L., Fellows, M., Juedes, D., and Rosamond, F. The complexity of polynomial-time approximation. <\/span>Theory of Computing Systems 41<\/em>, 3 (2007), 459-477. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      8. Fellows, M., Flum, J., Hermelin, D., M\u00fcller, M., and Rosamond, F. Parameterized complexity via combinatorial circuits. In <\/span>Algorithms and Complexity in Durham 2007, Proceedings of the third ACiD Workshop<\/em> (2007), H. Broersma, S. Dantchev, M. Johnson, and S. Szeider, Eds., vol. 9 of <\/span>Texts in Algorithmics<\/em>, College Publications London, pp. 55-67. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      9. Fellows, M., Flum, J., Hermelin, D., M\u00fcller, M., and Rosamond, F. Parameterized complexity via combinatorial circuits. In <\/span>Algorithms and Complexity in Durham 2007, Proceedings of the third ACiD Workshop<\/em> (2007), H. Broersma, S. Dantchev, M. Johnson, and S. Szeider, Eds., vol. 9 of <\/span>Texts in Algorithmics<\/em>, College Publications London, pp. 55-67. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      10. Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., and Weyer, M. Quadratic kernelization for convex recoloring of trees. In <\/span>Proceedings of Computing and Combinatorics, 13th Annual International Conference, COCOON\u201907<\/em> (2007), G. Lin, Ed., vol. 4598 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 86-96. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      11. Fellows, M. R., Fomin, F. V., Lokshtanov, D., Rosamond, F. A., Saurabh, S., Szeider, S., and Thomassen, C. On the complexity of some colorful problems parameterized by treewidth. In<\/span>Proceedings of Combinatorial Optimization and Applications, COCOA\u201907<\/em> (2007), A. W. M. Dress, Y. Xu, and B. Zhu, Eds., vol. 4616 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 366-377. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      12. Chor, B., Fellows, M. R., Ragan, M. A., Razgon, I., Rosamond, F. A., and Snir, S. Connected coloring completion for general graphs: Algorithms and complexity. In <\/span>Proceedings of Computing and Combinatorics, 13th Annual International Conference, COCOON\u201907<\/em> (2007), G. Lin, Ed., vol. 4598 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 75-85. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      13. Fellows, M. R., Langston, M. A., Rosamond, F. A., and Shaw, P. Efficient parameterized preprocessing for cluster editing. In <\/span>Proceedings of 16th International Symposium Fundamentals of Computation Theory FCT\u201907<\/em> (2007), E. Csuhaj-Varj\u00fa and Z. \u00c9sik, Eds., vol. 4639 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 312-321. [ <\/span>bib<\/a> |<\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      14. Cai, L., Fellows, M., Juedes, D., and Rosamond, F. The complexity of polynomial-time approximation. <\/span>Theory of Computing Systems 41<\/em>, 3 (2007), 459-477. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      15. Abu-Khzam, F. N., Fellows, M. R., Langston, M. A., and Suters, W. H. Crown structures for vertex cover kernelization. <\/span>Theory of Computing Systems 41<\/em>, 3 (2007), 411-430. [ <\/span>bib<\/a> |<\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      16. Dehne, F., Fellows, M., Langston, M., Rosamond, F., and Stevens, K. An <\/span>o<\/em>(2<\/span>O(k)<\/sup>n<\/em>3<\/sup>) FPT algorithm for the undirected feedback vertex set problem. <\/span>Theory of Computing Systems 41<\/em>, 3 (2007), 479-492. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      17. Abu-Khzam, F. N., Fellows, M. R., Langston, M. A., and Suters, W. H. Crown structures for vertex cover kernelization. <\/span>Theory of Computing Systems 41<\/em>, 3 (2007), 411-431. [ <\/span>bib<\/a> |<\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      18. Fellows, M. R., Langston, M. A., Rosamond, F. A., and Shaw, P. Efficient parameterized preprocessing for cluster editing. In <\/span>Proceedings of Fundamentals of Computation Theory, 16th International Symposium, FCT\u201907<\/em> (2007), E. Csuhaj-Varj\u00fa and Z. \u00c9sik, Eds., vol. 4639 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 312-321. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      19. Fellows, M. R., Langston, M. A., Rosamond, F. A., and Shaw, P. Efficient parameterized preprocessing for cluster editing. In <\/span>Proceedings of Fundamentals of Computation Theory, 16th International Symposium, FCT\u201907<\/em> (2007), E. Csuhaj-Varj\u00fa and Z. \u00c9sik, Eds., vol. 4639 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 312-321. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      20. Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., and Weyer, M. Quadratic kernelization for convex recoloring of trees. In <\/span>Proceedings of Computing and Combinatorics, 13th Annual International Conference, COCOON\u201907<\/em> (2007), G. Lin, Ed., vol. 4598 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 86-96. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      21. Cai, L., Fellows, M., Juedes, D., and Rosamond, F. On the efficiency of polynomial-time approximation. <\/span>Theory of Computing Systems 41<\/em>, 3 (2007), 459-477. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                      22. Fellows, M., Flum, J., Hermelin, D., M\u00fcller, M., and Rosamond, F. Parameterized complexity via combinatorial circuits. In <\/span>Algorithms and Complexity in Durham 2007, Proceedings of the third ACiD Workshop<\/em> (2007), H. Broersma, S. Dantchev, M. Johnson, and S. Szeider, Eds., vol. 9 of <\/span>Texts in Algorithmics<\/em>, College Publications London, pp. 55-67. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                         <\/p>\n2006<\/span>

                                                                        \n
                                                                          \n
                                                                        1. \n
                                                                            \n
                                                                          1. \n
                                                                              \n
                                                                            1. Fellows, M. The lost continent of polynomial time. In <\/span>Proceedings of IWPEC\u201906<\/em> (2006), vol. 4169 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, p. 276 \u2013 277. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            2. Fellows, M. R., Gramm, J., and Niedermeier, R. On the parameterized intractability of motif search problems. <\/span>Combinatorica 26<\/em>, 2 (2006), 141-167. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            3. Dujmovic, V., Fellows, M. R., Hallett, M. T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F. A., Suderman, M., Whitesides, S., and Wood, D. R. A fixed-parameter approach to 2-layer planarization. <\/span>Algorithmica 45<\/em>, 2 (2006), 159-182. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            4. Fellows, M. R., Gramm, J., and Niedermeier, R. On the parameterized intractability of motif search problems. <\/span>Combinatorica 26<\/em>, 2 (2006), 141-167. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            5. Dehne, F., Fellows, M. R., Fernau, H., Prieto, E., and Rosamond, F. A. NONBLOCKER: Parameterized algorithmics for minimum dominating set. In <\/span>Proceedings of Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science SOFSEM\u201906<\/em> (2006), J. Wiedermann, G. Tel, J. Pokorn\u00fd, M. Bielikov\u00e1, and J. Stuller, Eds., vol. 3831 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 237-245. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            6. Fellows, M. R., Rosamond, F. A., Rotics, U., and Szeider, S. Clique-width minimization is NP-hard. In <\/span>Proceedings of the 38th Annual Symposium on Theory of Computing, ACM\u201906<\/em>(2006), J. M. Kleinberg, Ed., ACM, pp. 354-362. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            7. Burrage, K., Estivill-Castro, V., Fellows, M. R., Langston, M. A., Mac, S., and Rosamond, F. A. The undirected feedback vertex set problem has a poly(<\/span>k<\/em>) kernel. In <\/span>Proceedings of Parameterized and Exact Computation, Second International Workshop, IWPEC\u201906<\/em> (2006), H. L. Bodlaender and M. A. Langston, Eds., vol. 4169 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 192-202. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            8. Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., and Weyer, M. Kernelization for convex recoloring. In <\/span>Proceedings of Algorithms and Complexity in Durham, ACiD\u201906<\/em> (2006), H. Broersma, S. S. Dantchev, M. J. 0002, and S. Szeider, Eds., vol. 7 of <\/span>Texts in Algorithmics<\/em>, King\u2019s College, London, pp. 23-36. Accepted to Algorithmica. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            9. Burrage, K., Estivill-Castro, V., Fellows, M. R., Langston, M. A., Mac, S., and Rosamond, F. A. The undirected feedback vertex set problem has a poly(k) kernel. In <\/span>Proceedings of Parameterized and Exact Computation, Second International Workshop, IWPEC\u201906<\/em> (2006), H. L. Bodlaender and M. A. Langston, Eds., vol. 4169 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 192-202. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            10. Fellows, M. The lost continent of polynomial time. In <\/span>Proceedings of Parameterized and Exact Computation, Second International Workshop, IWPEC\u201906<\/em> (2006), vol. 4169 of<\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, p. 276 \u2013 277. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            11. Downey, R. G., Fellows, M. R., and McCartin, C. Parameterized approximation problems. In <\/span>Proceedings of Parameterized and Exact Computation, Second International Workshop, IWPEC\u201906<\/em> (2006), H. L. Bodlaender and M. A. Langston, Eds., vol. 4169 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 121-129. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                            12. Fellows, M., Szeider, S., and Wrightson, G. On finding short resolution refutations and small unsatisfiable subsets. <\/span>Theoretical Computer Science 351<\/em> (2006), 351-359. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                            13. <\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                               <\/p>\n2005<\/span>

                                                                              \n
                                                                                \n
                                                                              1. \n
                                                                                  \n
                                                                                1. \n
                                                                                    \n
                                                                                  1. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D. W., Kanj, I. A., and Xia, G. Tight lower bounds for certain parameterized NP-hard problems. <\/span>Information and Computation 201<\/em>, 2 (2005), 216-231. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                  2. Alber, J., Fan, H., Fellows, M. R., Fernau, H., Niedermeier, R., Rosamond, F., and Stege, U. A refined search tree technique for dominating set on planar graphs. <\/span>Journal of Computer and System Sciences 71<\/em>, 4 (2005), 385-405. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                  3. Dehne, F. K. H. A., Fellows, M. R., Langston, M. A., Rosamond, F. A., and Stevens, K. An O(2<\/span>O(k)<\/sup>n<\/span>3<\/sup>) FPT algorithm for the undirected feedback vertex set problem. In <\/span>Proceedings of Computing and Combinatorics, 11th Annual International Conference, COCOON\u201905<\/em> (2005), L. Wang, Ed., vol. 3595 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 859-869. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                  4. Estivill-Castro, V., Fellows, M. R., Langston, M. A., and Rosamond, F. A. Fixed-parameter tractability is polynomial-time extremal structure theory I: The case of max leaf. In <\/span>Proceedings of Algorithms and Complexity in Durham, ACiD 2005<\/em> (2005), H. Broersma, M. J. 0002, and S. Szeider, Eds., vol. 4 of <\/span>Texts in Algorithmics<\/em>, King\u2019s College, London, pp. 1-41. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                  5. Estivill-Castro, V., Fellows, M. R., Langston, M. A., and Rosamond, F. A. Fixed-parameter tractability is polynomial-time extremal structure theory I: The case of max leaf. In <\/span>Algorithms and Complexity in Durham 2005 \u2013 Proceedings of the First ACiD<\/em> (2005), H. Broersma, M. J. 0002, and S. Szeider, Eds., vol. 4 of <\/span>Texts in Algorithmics<\/em>, King\u2019s College, London, pp. 1-41. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                     <\/p>\n2004<\/span>

                                                                                    \n
                                                                                      \n
                                                                                    1. \n
                                                                                        \n
                                                                                      1. \n
                                                                                          \n
                                                                                        1. Dehne, F. K., Fellows, M. R., Rosamond, F. A., and Shaw, P. Greedy localization, iterative compression, modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2<\/span>k<\/em> kernelization for vertex cover. In <\/span>Proceedings of Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway<\/em>(2004), R. G. Downey, M. R. Fellows, and F. K. Dehne, Eds., vol. 3162 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 271-280. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        2. Fellows, M. R. A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing. In <\/span>Proceedings of 12th Annual European Symposium ESA, Bergen, Norway<\/em> (2004), S. Albers and T. Radzik, Eds., vol. 3221 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 1-2. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        3. Alber, J., Fellows, M. R., and Niedermeier, R. Polynomial-time data reduction for dominating set. <\/span>Journal of the ACM 51<\/em>, 3 (2004), 363-384. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        4. Ellis, J., Fan, H., and Fellows, M. The dominating set problem is fixed parameter tractable for graphs of bounded genus. <\/span>Journal of Algorithms 52<\/em>, 2 (2004), 152-168. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                        5. Abu-Khzam, F. N., Collins, R. L., Fellows, M. R., Langston, M. A., Suters, W. H., and Symons, C. T. Kernelization algorithms for the Vertex Cover problem: Theory and experiments. In<\/span>Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the first Workshop on Analytic Algorithmics and Combinatorics ALENEX\u201904<\/em> (2004), L. Arge, G. F. Italiano, and R. Sedgewick, Eds., Siam Proceedings Series, Society of Industrial and Applied Mathematics, pp. 62-69. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                        6. Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F. A., Stege, U., Thilikos, D. M., and Whitesides, S. Faster fixed-parameter tractable algorithms for matching and packing problems. In <\/span>Proceedings of 12th Annual European Symposium on Algorithms ESA\u201904<\/em> (2004), S. Albers and T. Radzik, Eds., vol. 3221 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 311-322. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        7. Fellows, M., Heggernes, P., Rosamond, F. A., Sloper, C., and Telle, J. A. Finding <\/span>k<\/em> disjoint triangles in an arbitrary graph. In <\/span>Proceedings of Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG\u201904<\/em> (2004), J. Hromkovic, M. Nagl, and B. Westfechtel, Eds., vol. 3353 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 235-244. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        8. Chor, B., Fellows, M., and Juedes, D. W. Linear kernels in linear time, or how to save <\/span>k<\/em> colors in O(n<\/span>2<\/sup>) steps. In <\/span>Proceedings of Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG\u201904<\/em> (2004), J. Hromkovic, M. Nagl, and B. Westfechtel, Eds., vol. 3353 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 257-269. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        9. Alber, J., Fellows, M. R., and Niedermeier, R. Polynomial-time data reduction for dominating set. <\/span>Journal of the ACM 51<\/em>, 3 (2004), 363-384. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        10. Abu-Khzam, F. N., Collins, R. L., Fellows, M. R., Langston, M. A., Suters, W. H., and Symons, C. T. Kernelization algorithms for the vertex cover problem: Theory and experiments. In<\/span>Proceedings of the sixth Workshop on Algorithm Engineering and Experiments and the first Workshop on Analytic Algorithmics and Combinatorics ALENEX\u201904<\/em> (2004), L. Arge, G. F. Italiano, and R. Sedgewick, Eds., Siam Proceedings Series, Society of Industrial and Applied Mathematics, pp. 62-69. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                        11. Chor, B., Fellows, M., and Juedes, D. W. Linear kernels in linear time, or how to save <\/span>k<\/em> colors in O(n<\/span>2<\/sup>) steps. In <\/span>Graph-Theoretic Concepts in Computer Science, 30th International Workshop WG\u201904<\/em> (2004), J. Hromkovic, M. Nagl, and B. Westfechtel, Eds., vol. 3353 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 257-269. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                        12. Fellows, M., Szeider, S., and Wrightson, G. On finding short resolution refutations and small unsatisfiable subsets. In <\/span>Proceedings of the First International Workshop on Parameterized and Exact Computation IWPEC\u201904<\/em> (2004), vol. 3162 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 223-234. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                           <\/p>\n2003<\/span>

                                                                                          \n
                                                                                            \n
                                                                                          1. \n
                                                                                              \n
                                                                                            1. \n
                                                                                                \n
                                                                                              1. Chen, J., and Fellows, M. Foreword from the Guest Editors. <\/span>Journal of Computer and System Sciences 67<\/em> (2003), 653-654. Special Issue on Parameterized Complexity,. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                              2. Fellows, M. R. Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT. In <\/span>Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG\u20192003, Elspeet, The Netherlands<\/em> (2003), H. L. Bodlaender, Ed., vol. 2880 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 1-12. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              3. Fellows, M. R. New directions and new challenges in algorithm design and complexity, parameterized. In <\/span>Proceedings of Algorithms and Data Structures, 8th International Workshop WADS<\/em> (2003), F. K. H. A. Dehne, J.-R. Sack, and M. H. M. Smid, Eds., vol. 2748 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 505-520. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              4. Fellows, M. R., Hallett, M., and Stege, U. Analogs & duals of the MAST problem for sequences & trees. <\/span>Journal of Algorithms 49<\/em> (2003), 192 \u2013 216. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              5. Fellows, M. R., Hallett, M., and Stege, U. Analogs & duals of the MAST problem for sequences & trees. <\/span>Journal of Algorithms 49<\/em> (2003), 192 \u2013 216. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              6. Bell, T., Fellows, M., Witten, I., and Koblitz, N. Explaining cryptographic systems to the general public. <\/span>Computers and Education 40<\/em> (2003), 199-215. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                              7. Bell, T., Fellows, M., Koblitz, N., and Witten, I. Explaining cryptographic ideas to the general public. <\/span>Computers and Education 40<\/em> (2003), 199\u2014215. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              8. Fellows, M. R., Hallett, M., and Stege, U. Analogs and duals of the MAST problem for sequences & trees. <\/span>Journal of Algorithms 49<\/em> (2003), 192 \u2013 216. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              9. Downey, R. G., Estivill-Castro, V., Fellows, M. R., Prieto, E., and Rosamond, F. A. Cutting up is hard to do: the parameterized complexity of k-cut and related problems. <\/span>Electronic Notes in Theoretical Computer Science 78<\/em> (2003), 205-218. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              10. Downey, R. G., Estivill-Castro, V., Fellows, M. R., Prieto, E., and Rosamond, F. A. Cutting up is hard to do: the parameterized complexity of k-cut and related problems. <\/span>Electronic Notes in Theoretical Computer Science 78<\/em> (2003), 205-218. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              11. Fellows, M. R. Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT. In <\/span>Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG\u201903<\/em> (2003), H. L. Bodlaender, Ed., vol. 2880 of <\/span>LNCS<\/em>, Springer-Verlag, pp. 1-12. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              12. Dehne, F., Fellows, M. R., and Rosamond, F. A. An FPT algorithm for set splitting. In <\/span>Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG\u201903<\/em> (2003), H. L. Bodlaender, Ed., vol. 2880 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 180-191. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              13. Bodlaender, H. L., Fellows, M. R., and Thilikos, D. M. Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms. In <\/span>Proceedings of Mathematical Foundations of Computer Science MFCS\u201903<\/em> (2003), B. Rovan and P. Vojt\u00e1s, Eds., vol. 2747 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 239-248. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                              14. Fellows, M., and McCartin, C. On the parameterized complexity of minimizing tardy tasks. <\/span>Theoretical Computer Science A 298<\/em> (2003), 317-324. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                 <\/p>\n2002<\/span>

                                                                                                \n
                                                                                                  \n
                                                                                                1. \n
                                                                                                    \n
                                                                                                  1. \n
                                                                                                      \n
                                                                                                    1. Fellows, M. R. Parameterized complexity: The main ideas and connections to practical computing. In <\/span>Experimental Algorithmics<\/em> (2002), R. Fleischer, B. M. E. Moret, and E. M. Schmidt, Eds., vol. 2547 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 51-77. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                    2. Fellows, M. R., Gramm, J., and Niedermeier, R. On the parameterized intractability of closest substring and related problems. In <\/span>Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS\u201902<\/em> (2002), H. Alt and A. Ferreira, Eds., vol. 2285 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 262-273. [ <\/span>bib<\/a> |<\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                    3. Alber, J., Fellows, M. R., and Niedermeier, R. Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case. In <\/span>Proceedings of 8th Scandinavian Workshop on Algorithm Theory SWAT\u201902<\/em> (2002), M. Penttonen and E. M. Schmidt, Eds., vol. 2368 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 150-159. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                    4. Ellis, J., Fan, H., and Fellows, M. R. The dominating set problem is fixed parameter tractable for graphs of bounded genus. In <\/span>Proceedings of SWAT 2002: Scandinavian Workshop on Algorithm Theory<\/em> (2002), M. Penttonen and E. M. Schmidt, Eds., vol. 2368 of <\/span>LNCS<\/em>, Springer, pp. 180-189. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                    5. Alber, J., Fellows, M. R., and Niedermeier, R. Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case. In <\/span>Proceedings of the 8th Scandinavian Workshop on Algorithm Theory SWAT\u201902<\/em> (2002), M. Penttonen and E. M. Schmidt, Eds., vol. 2368 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 150-159. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                    6. Fellows, M. R., Gramm, J., and Niedermeier, R. On the parameterized intractability of closest substring and related problems. In <\/span>Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, STACS\u201902<\/em> (2002), H. Alt and A. Ferreira, Eds., vol. 2285 of <\/span>LNCS<\/em>, Springer-Verlag, pp. 262-273. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                       <\/p>\n2001<\/span>

                                                                                                      \n
                                                                                                        \n
                                                                                                      1. \n
                                                                                                          \n
                                                                                                        1. \n
                                                                                                            \n
                                                                                                          1. Cattell, K., Dinneen, M. J., and Fellows, M. R. Forbidden minors to graphs with small feedback sets. <\/span>Discrete Mathematics 230<\/em>, 1-3 (2001), 215-252. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          2. Fellows, M. R. Parameterized complexity: New developments and research frontiers. In <\/span>Aspects of Complexity<\/em> (2001), De Gruyter, pp. 51-72. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          3. Fellows, M. R. Some new developments in parameterized complexity. In <\/span>Proceedings of the 12th Australasian Workshop on Combinatorial Algorithms<\/em> (2001), E. T. Baskoro, Ed., pp. 43-44. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          4. Fellows, M. R. Parameterized complexity: Main ideas, connections to heuristics and research frontiers. In <\/span>Proceedings of ISAAC<\/em> (2001), vol. 2223 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 291-307. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          5. Downey, R. G., and Fellows, M. R. Index sets and parametric reductions. <\/span>Archive for Mathematical Logic 40<\/em>, 5 (2001), 329-348. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          6. Dujmovic, V., Fellows, M. R., Hallett, M. T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F. A., Suderman, M., Whitesides, S., and Wood, D. R. A fixed-parameter approach to two-layer planarization. In <\/span>Proceedings of the 9th International Symposium on Graph Drawing GD\u201901<\/em> (2001), vol. 2265 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 1-15. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          7. Dujmovi\u0107, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., and Wood, D. R. On the parameterized complexity of layered graph drawing. In <\/span>Proceedings of the 9th Annual European Symposium on Algorithms, ESA \u201901<\/em> (2001), vol. 2161 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 488-499. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                          8. Alber, J., Fan, H., Fellows, M. R., Fernau, H., Niedermeier, R., Rosamond, F. A., and Stege, U. A refined search tree technique for DOMINATING SET on planar graphs. In<\/span>Proceedings of 26th International Symposium Mathematical Foundations of Computer Science, MFCS\u201901<\/em> (2001), J. Sgall, A. Pultr, and P. Kolman, Eds., vol. 2136 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 111-122. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                          9. Downey, R., and Fellows, M. Index sets and parametric reductions. <\/span>Archive for Mathematical Logic 40<\/em>, 5 (2001), 329-348. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                             <\/p>\n2000<\/span>

                                                                                                            \n
                                                                                                              \n
                                                                                                            1. \n
                                                                                                                \n
                                                                                                              1. \n
                                                                                                                  \n
                                                                                                                1. Cattell, K., Dinneen, M. J., Downey, R. G., and Fellows, M. R. On computing graph minor obstruction sets. <\/span>Theoretical Computer Science 233<\/em>, 1 (2000), 107-127. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                2. Bodlaender, H. L., Fellows, M. R., Hallett, M. T., Wareham, H. T., and Warnow, T. J. The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. <\/span>Theoretical Computer Science A 244<\/em>, 1-2 (2000), 167-188. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                3. Downey, R. G., Fellows, M. R., and Raman, V. The complexity of irredundant sets parameterized by size. <\/span>Discrete Applied Mathematics 100<\/em>, 3 (2000), 155-167. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                4. Bodlaender, H. L., Fellows, M. R., Hallett, M. T., Wareham, H. T., and Warnow, T. J. The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. <\/span>Theoretical Computer Science A 244<\/em>, 1-2 (2000), 167-188. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                5. Fellows, M. R., McCartin, C., Rosamond, F. A., and Stege, U. Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. In <\/span>Proceedings of Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS \u201900<\/em> (2000), S. Kapoor and S. Prasad, Eds., vol. 1974 of<\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 240-251. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                6. Fellows, M. R., McCartin, C., Rosamond, F. A., and Stege, U. Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. In <\/span>Proceedings Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS\u201900<\/em> (2000), S. Kapoor and S. Prasad, Eds., vol. 1974 of<\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 240-251. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                   <\/p>\n1999<\/span>

                                                                                                                  \n
                                                                                                                    \n
                                                                                                                  1. \n
                                                                                                                      \n
                                                                                                                    1. \n
                                                                                                                        \n
                                                                                                                      1. Downey, R. G., and Fellows, M. R. <\/span>Parameterized Complexity<\/em>. Springer-Verlag, 1999. 530 pp. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                      2. Downey, R. G., Fellows, M. R., and Stege, U. Parameterized complexity: A framework for systematically confronting computational intractability. In <\/span>Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future<\/em>, vol. 49 of <\/span>DIMACS Series in Discrete Mathematics and Theoretical Computer Science<\/em>. DIMACS, 1999, pp. 49-99. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                      3. Downey, R. G., Fellows, M. R., and Stege, U. Computational Tractability: A View from Mars. Tech. rep., 1999. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                      4. Downey, R. G., and Fellows, M. R. Parameterized complexity after (almost) 10 years: Review and open questions. In <\/span>Proceedings of Combinatorics, Computation and Logic, DMTCS\u201999 and CATS\u201999<\/em> (Singapore, 1999), vol. 21 of <\/span>Australian Computer Science Communications<\/em>, Springer-Verlag, pp. 1-33. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                      5. Downey, R. G., Fellows, M. R., Vardy, A., and Whittle, G. The parametrized complexity of some fundamental problems in coding theory. <\/span>SIAM Journal of Computing 29<\/em>, 2 (1999), 545-570. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                      6. Bell, T., Fellows, M., Koblitz, N., and Witten, I. Explaining cryptographic systems to the general public. In <\/span>Proceedings of the First IFIP World Conference on Information Security Education (WISE)<\/em> (1999), L. Yngstgr\u00f6m and S. Fischer-H\u00fcbner, Eds., vol. 99-008, Stockholm University Report Series, p. 221\u2014233. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                         <\/p>\n1998<\/span>

                                                                                                                        \n
                                                                                                                          \n
                                                                                                                        1. \n
                                                                                                                            \n
                                                                                                                          1. \n
                                                                                                                              \n
                                                                                                                            1. Fellows, M., Hallett, M. T., Korostensky, C., and Stege, U. Analogs and duals of the MAST problem for sequences and trees. In <\/span>Proceedings of the 6th Annual European Symposium on Algorithms<\/em> (1998), G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. P. cci, Eds., no. 1461 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 103-114. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            2. Fellows, M., Hallett, M., and Stege, U. On the multiple gene duplication problem. In <\/span>Proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC\u201998<\/em>(1998), K.-Y. Chwa and O. H. Ibarra, Eds., vol. 1533 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 347-356. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            3. Downey, R. G., and Fellows, M. R. Threshold dominating sets and an improved characterization of W[2]. <\/span>Theoretical Computer Science 209<\/em>, 1-2 (1998), 123-140. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            4. Downey, R. G., Fellows, M. R., and Regan, K. W. Parameterized circuit complexity and the W hierarchy. <\/span>Theoretical Computer Science A 191<\/em>, 1-2 (1998), 97-115. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            5. Fellows, M., Hallett, M. T., Korostensky, C., and Stege, U. Analogs and duals of the MAST problem for sequences and trees. In <\/span>Proceedings of the 6th Annual European Symposium on Algorithms<\/em> (1998), G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. P. cci, Eds., no. 1461 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 103-114. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            6. Balasubramanian, Fellows, and Raman. An improved fixed-parameter algorithm for vertex cover. <\/span>IPL: Information Processing Letters 65<\/em>, 3 (1998), 163-168. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            7. Downey, R. G., and Fellows, M. R. Threshold dominating sets and an improved characterization of <\/span>W<\/em>[2]. <\/span>Theoretical Computer Science 209<\/em>, 1-2 (1998), 123-140. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                            8. Fellows, M., Hell, P., and Seyffarth, K. Constructions of dense planar networks. <\/span>Networks 32<\/em> (1998), 275-281. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                               <\/p>\n1997<\/span>

                                                                                                                              \n
                                                                                                                                \n
                                                                                                                              1. \n
                                                                                                                                  \n
                                                                                                                                1. \n
                                                                                                                                    \n
                                                                                                                                  1. Courcelle, B., Downey, R. G., and Fellows, M. R. A note on the computability of graph minor obstruction sets for monadic second order ideals. <\/span>Journal of Universal Computer Science 3<\/em>, 11 (1997), 1194-1198. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                  2. Cai, L., Chen, J., Downey, R. G., and Fellows, M. R. Advice classes of parameterized tractability. <\/span>Annals of Pure and Applied Logic 84<\/em>, 1 (1997), 119-138. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                  3. Cai, L., Chen, J., Downey, R. G., and Fellows, M. R. The parameterized complexity of short computation and factorization. <\/span>Archive for Mathematical Logic 36<\/em> (1997), 321-338. [ <\/span>bib<\/a> |<\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                  4. Downey, R., Fellows, M., and Regan, K. Descriptive complexity and the W hierarchy. In <\/span>Proof Complexity and Feasible Arithmetics<\/em>, P. Beame and S. Buss, Eds., AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1997, pp. 119-134. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                  5. Downey, R. G., Fellows, M. R., Vardy, A., and Whittle, G. The parametrized complexity of some fundamental problems of linear codes and integral lattices. Tech. rep., 1997. Manuscript. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                  6. Casey, N., and Fellows, M. Implementing the standards: Let\u2019s focus on the first four. <\/span>DIMACS Series: Discrete Mathematics in the Schools. How Can We Have an Impact?<\/em> (1997). [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                     <\/p>\n1996<\/span>

                                                                                                                                    \n
                                                                                                                                      \n
                                                                                                                                    1. \n
                                                                                                                                        \n
                                                                                                                                      1. \n
                                                                                                                                          \n
                                                                                                                                        1. Bell, T., Fellows, M. R., and Witten, I. <\/span>Computer Science Unplugged \u2026 offline activities and games for all ages: Teacher Edition<\/em>. Computer Science Unplugged, 1996. There are currently two versions of the book. The \u201cTeachers\u2019 Edition\u201d which is aimed at people with less of a technical background. It has 12 activities, and a lot more illustrations and handouts. Both books are available in Download from <\/span>http:\/\/www.lulu.com<\/a>. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                        2. Fellows, M. R., Bell, T., and Witten, I. <\/span>Computer Science Unplugged \u2026 offline activities and games for all ages: Original Activities Book<\/em>. Computer Science Unplugged, 1996. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                        3. Cattell, K., Dinneen, M. J., and Fellows, M. R. A simple linear-time algorithm for finding path-decompositions of small width. <\/span>Information Processing Letters 57<\/em>, 4 (1996), 197-203. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        4. Cattell, K., Dinneen, M. J., and Fellows, M. R. Forbidden minors to graphs with small feedback sets. Tech. rep., 1996. Preprint. Journal publication is \u201cDiscrete Mathematics\u201d (2000),. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        5. Bailey, I., Cattell, K., Fellows, M. R., Koop, B., Olafson, R., Olafson, R., and Upton, C. Approaches to detection of distantly related proteins by database searches. <\/span>BioTechniques 21<\/em>(1996), 1118 \u2013 1125. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                        6. Downey, R. G., Fellows, M. R., and Taylor, U. The parameterized complexity of relational database queries and an improved characterization of W[1]. In <\/span>Combinatorics, Complexity, and Logic \u2013 Proceedings of DMTCS \u201996<\/em> (1996), D. Bridges, C. Calude, J. Gibbons, S. Reeves, and I. Witten, Eds., Springer-Verlag, pp. 194-213. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        7. Cesati, M., and Fellows, M. Sparse parameterized problems. <\/span>Annals of Pure and Applied Logic 82<\/em> (1996), 1-15. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        8. Fellows, M. The heart of puzzling: Mathematics and computer games. In <\/span>Proceedings of the 1996 Computer Games Developers Conference<\/em> (1996), Miller Freeman, p. 109\u2014120. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        9. Alon, N., Fellows, M. R., and Hare, D. R. Vertex transversals that dominate. <\/span>Journal of Graph Theory 21<\/em>, 1 (1996), 21-32. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        10. Cattell, K., Dinneen, M. J., and Fellows, M. R. A simple linear-time algorithm for finding path-decompositions of small width. <\/span>Information Processing Letters 57<\/em>, 4 (1996), 197-203. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        11. Downey, R. G., Fellows, M. R., and Taylor, U. The parameterized complexity of relational database queries and an improved characterization of W[1]. In <\/span>Proceedings of Combinatorics, Complexity, and Logic, DMTCS\u201996<\/em> (1996), D. Bridges, C. Calude, J. Gibbons, S. Reeves, and I. Witten, Eds., Springer-Verlag, pp. 194-213. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        12. Alon, N., Fellows, M., and Hare, D. O. Vertex transversals that dominate. <\/span>Journal of Graph Theory 21<\/em> (1996), 21-32. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                        13. Bodlaender, H. L., Evans, P. A., and Fellows, M. R. Finite-state computability of annotations of strings and trees. In <\/span>Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching: CPM 2006<\/em> (1996), D. S. Hirschberg and E. W. Myers, Eds., vol. 1075 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 384-391. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                        14. Bodlaender, H. L., Evans, P. A., and Fellows, M. R. Finite-state computability of annotations of strings and trees. In <\/span>Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching: CPM\u201996<\/em> (1996), D. S. Hirschberg and E. W. Myers, Eds., vol. 1075 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 384-391. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                           <\/p>\n1995<\/span>

                                                                                                                                          \n
                                                                                                                                            \n
                                                                                                                                          1. \n
                                                                                                                                              \n
                                                                                                                                            1. \n
                                                                                                                                                \n
                                                                                                                                              1. Fellows, M., Kratochvil, J., Middendorf, M., and Pfeiffer, F. The complexity of induced minors and related problems. <\/span>Algorithmica 13<\/em>, 3 (1995), 266-282. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              2. Cattell, K., Dinneen, M. J., and Fellows, M. R. Obstructions to within a few vertices or edges of acyclic. In <\/span>Proceedings of the 4th International Workshop on Algorithms and Data Structures, WADS\u201995<\/em> (1995), S. G. Akl, F. Dehne, J.-R. Sack, and N. Santoro, Eds., vol. 955 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 415-427. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              3. Abrahamson, K., Downey, R. G., and Fellows, M. R. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. <\/span>Annals of Pure and Applied Logic 73<\/em> (1995), 235-276. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              4. Cai, L., Chen, J., Downey, R., and Fellows, M. On the structure of parameterized problems in NP. <\/span>Information and Computation 123<\/em>, 1 (1995), 38-49. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                              5. Downey, R. G., and Fellows, M. R. Parameterized computational feasibility. In <\/span>Proceedings of the Second Cornell Workshop on Feasible Mathematics. Feasible Mathematics II<\/em>(Boston, 1995), P. Clote and J. Remmel, Eds., Birkh\u00e4user, pp. 219-244. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              6. Downey, R., and Fellows, M. R. Fixed-parameter tractability and completeness II: Completeness for W[1]. <\/span>Theoretical Computer Science A 141<\/em> (1995), 109-131. Preliminary versions of some of the results of this paper were presented at the 21st Manitoba Conference on Numerical Mathematics and Computation, 1991. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              7. Downey, R., and Fellows, M. R. Fixed-parameter tractability and completeness I: Basic theory. <\/span>Siam Journal of Computing 24<\/em> (1995), 873-921. Preliminary versions of some of the results of this paper were presented at the 21st Manitoba Conference on Numerical Mathematics and Computation, 1991. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              8. Bodlaender, H. L., Downey, R. G., Fellows, M. R., Hallett, M. T., and Wareham, H. T. Parameterized complexity analysis in computational biology. <\/span>Computer Applications in the Biosciences 11<\/em>, 1 (1995), 49-57. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              9. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Wareham, H. T. The parameterized complexity of sequence alignment and consensus. <\/span>Theoretical Computer Science 147<\/em>, 1&2 (1995), 31-54. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              10. Abrahamson, K., Downey, R. G., and Fellows, M. R. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. <\/span>Annals of Pure and Applied Logic 73<\/em> (1995), 235-276. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              11. Downey, R. G., and Fellows, M. R. Fixed-parameter tractability and completeness II: On completeness for W[1]. <\/span>Theoretical Computer Science 141<\/em>, 1&2 (1995), 109-131. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              12. Cai, L., Chen, J., Downey, R., and Fellows, M. On the structure of parameterized problems in NP. <\/span>Information and Computation 123<\/em>, 1 (1995), 38-49. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                              13. Downey, R. G., and Fellows, M. R. Fixed-parameter tractability and completeness I: Basic results. <\/span>SIAM Journal of Computing 24<\/em>, 4 (1995), 873-921. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              14. Bodlaender, H., and Fellows, M. On the complexity of <\/span>k<\/em>-processor scheduling. <\/span>Operations Research Letters 18<\/em> (1995), 93 \u2013 98. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              15. Fellows, M., Hell, P., and Seyffarth, K. Large planar graphs with given diameter and maximum degree. <\/span>Discrete Applied Math 61<\/em> (1995), 133-153. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                              16. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Wareham, H. T. The parameterized complexity of sequence alignment and consensus. <\/span>Theoretical Computer Science 147<\/em>, 1&2 (1995), 31-54. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                              17. Bodlaender, H. L., Downey, R. G., Fellows, M. R., Hallett, M. T., and Wareham, H. T. Parameterized complexity analysis in computational biology. <\/span>Computer Applications in the Biosciences 11<\/em>, 1 (1995), 49-57. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                 <\/p>\n1994<\/span>

                                                                                                                                                \n
                                                                                                                                                  \n
                                                                                                                                                1. \n
                                                                                                                                                    \n
                                                                                                                                                  1. \n
                                                                                                                                                      \n
                                                                                                                                                    1. Fellows, M. R., and Langston, M. A. On search, decision and the efficiency of polynomial-time algorithms. <\/span>Journal of Computer and System Sciences<\/em> (1994), 769-779. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                    2. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Wareham, H. T. The parameterized complexity of sequence alignment and consensus. In <\/span>Proceedings of Combinatorial Pattern Matching, 5th Annual Symposium, CPM<\/em> (1994), M. Crochemore and D. Gusfield, Eds., vol. 807 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 15-30. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                    3. Bodlaender, H. L., Downey, R. G., Fellows, M. R., Hallett, M. T., and Wareham, H. T. Parameterized complexity analysis in computational biology. <\/span>Proceedings of the IEEE Computer Society Workshop on Shape and Pattern Recognition in Computational Biology<\/em> (1994), 99-116. IBM TJ Watson Research Center Publication. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                    4. Cai, L., Chen, J., Downey, R. G., and Fellows, M. R. On the structure of parameterized problems in NP. In <\/span>Proceedings of 11th Annual Symposium on Theoretical Aspects of Computer Science, STACS\u201994, Caen, France<\/em> (1994), P. Enjalbert, E. W. Mayr, and K. W. Wagner, Eds., vol. 775 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 509-520. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                    5. Fellows, M., and Koblitz, N. Combinatorial cryptosystems galore! In <\/span>Proceedings of the Second International Symposium on Finite Fields, Las Vegas, Nevada, August, 1993<\/em> (1994), vol. 168 of <\/span>Contemporary Mathematics<\/em>, American Mathematical Society, pp. 51-61. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                    6. Fellows, M., Hibner, A., and Koblitz, N. Cultural aspects of mathematics education reform. <\/span>Notices of the American Mathematics Society 41<\/em> (1994), 5\u20149. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                    7. Fellows, M., Fricke, G., Hedetniemi, S., and Jacobs, D. The private neighbor cube. <\/span>SIAM Journal on Discrete Mathematics 7<\/em>, 1 (1994), 41-47. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                    8. Bodlaender, H. L., Fellows, M. R., and Hallett, M. T. Beyond <\/span>NP<\/em>-completeness for problems of bounded width: Hardness for the <\/span>W<\/em> hierarchy. In <\/span>Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC\u201994<\/em> (New York, 1994), ACM Press, pp. 449-458. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                    9. Bodlaender, H. L., Fellows, M. R., and Hallett, M. T. Beyond <\/span>NP<\/em>-completeness for problems of bounded width: Hardness for the <\/span>W<\/em> hierarchy. In <\/span>Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC\u201994<\/em> (1994), ACM Press, pp. 449-458. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                    10. Fellows, M., Downey, R., Kapron, B., Hallett, M., and Wareham, H. T. The parameterized complexity of some problems in logic and linguistics. In <\/span>Proceedings of Symposium on Logical Foundations of Computer Science (LFCS)<\/em> (1994), vol. 813 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 89 \u2013 100. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                    11. Bodlaender, H. L., Downey, R. G., Fellows, M. R., and Wareham, H. T. The parameterized complexity of sequence alignment and consensus. In <\/span>Combinatorial Pattern Matching, 5th Annual Symposium, CPM\u201994<\/em> (1994), M. Crochemore and D. Gusfield, Eds., vol. 807 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 15-30. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                       <\/p>\n1993<\/span>

                                                                                                                                                      \n
                                                                                                                                                        \n
                                                                                                                                                      1. \n
                                                                                                                                                          \n
                                                                                                                                                        1. \n
                                                                                                                                                            \n
                                                                                                                                                          1. Abrahamson, K. R., and Fellows, M. R. Finite automata, bounded treewidth and well-quasiordering. In <\/span>Proceedings of the Joint Summer Research Conference on Graph Minors: Graph Structure Theory, Seattle, June, 1991<\/em> (1993), N. Robertson and P. Seymour, Eds., vol. 147 of <\/span>Contemporary Mathematics<\/em>, American Mathematical Society, pp. 539-564. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                          2. Abrahamson, K., Downey, R., and Fellows, M. R. Fixed-parameter intractability II. In <\/span>Proceedings of the 10th Symposium on Theoretical Aspects of Computer Sciences, STACS\u201993<\/em>(1993), vol. 665 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 374-385. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                          3. Fellows, M. R., Hallett, M. T., and Wareham, H. T. DNA physical mapping: Three ways difficult. In <\/span>Proceedings of the 1st Annual European Symposium on Algorithms, ESA \u201993<\/em>, T. Lengauer, Ed., vol. 726 of <\/span>Lecture Notes in Computer Science<\/em>. Springer-Verlag, 1993, pp. 157-168. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                          4. Downey, R., and Fellows, M. Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy. In <\/span>Complexity Theory: Current Research \u2013 Proceedings of the 1992 Dagstuhl Workshop on Structural Complexity<\/em> (Cambridge, 1993), K. Ambos-Spies, S. Homer, and U. Sch\u00f6ning, Eds., Cambridge University Press, pp. 191-225. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                          5. Abrahamson, K. A., Downey, R. G., and Fellows, M. R. Fixed-parameter intractability II. In <\/span>Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS\u201993<\/em> (1993), P. Enjalbert, A. Finkel, and K. W. Wagner, Eds., vol. 665 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 374-385. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                          6. Fellows, M. R., and Koblitz, N. Fixed-parameter complexity and cryptography. In <\/span>Proceedings of 10th International Symposium Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC\u201993, San Juan de Puerto Rico, Puerto Rico<\/em> (1993), G. D. Cohen, T. Mora, and O. Moreno, Eds., vol. 673 of <\/span>Lecture Notes in Computer Science<\/em>, Springer, pp. 121-131. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                          7. Downey, R. G., Evans, P. A., and Fellows, M. R. Parameterized learning complexity. In <\/span>Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory<\/em>(1993), ACM Press, pp. 51-57. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                          8. Fellows, M., and Koblitz, N. Kid krypto. In <\/span>Proceedings of Crypto 1992<\/em> (1993), vol. 740 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, New York, Inc., p. 371\u2014389. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                          9. Fellows, M. Computer science in the elementary schools. In <\/span>Proceedings of the Mathematicians and Education Reform Workshop, Seattle, 1991<\/em> (1993), N. Fisher, H. Keynes, and P. Wagreich, Eds., vol. 3 of <\/span>Issues in Mathematics Education<\/em>, Conference Board of the Mathematical Sciences, p. 143 \u2013163. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                          10. Abrahamson, K. R., and Fellows, M. R. Finite automata, bounded treewidth and well-quasiordering. In <\/span>Proceedings of the Joint Summer Research Conference on Graph Minors: Graph Structure Theory, Seattle, June, 1991<\/em> (1993), N. Robertson and P. Seymour, Eds., vol. 147 of <\/span>Contemporary Mathematics<\/em>, American Mathematical Society, pp. 539-564. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                             <\/p>\n1992<\/span>

                                                                                                                                                            \n
                                                                                                                                                              \n
                                                                                                                                                            1. \n
                                                                                                                                                                \n
                                                                                                                                                              1. \n
                                                                                                                                                                  \n
                                                                                                                                                                1. Casey, N., and Fellows, M. R. <\/span>This is Mega-Mathematics!<\/em> Los Alamos National Labs, 1992. Available at <\/span>http:\/\/www.c3.lanl<\/a>..gov\/ captors\/mega-math. See also <\/span>http:\/\/www.ccs3.lanl.gov\/mega-math\/write.html<\/a>. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                2. Fellows, M. R., and Langston, M. A. On well-partial-order theory and its application to combinatorial problems of VLSI design. <\/span>SIAM Journal on Discrete Mathematics 5<\/em>, 1 (1992), 117-126. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                3. Bodlaender, H. L., Fellows, M. R., and Warnow, T. J. Two strikes against perfect phylogeny. In <\/span>Proceedings of the 19th International Colloquium on Automata, Languages and Programming, ICALP\u201992<\/em> (1992), W. Kuich, Ed., vol. 623 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 273-283. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                                4. Downey, R., and Fellows, M. Fixed-parameter intractability. In <\/span>Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory<\/em> (1992), pp. 36-49. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                5. Downey, R., and Fellows, M. Fixed-parameter tractability and completeness. <\/span>Congressus Numerantium 87<\/em> (1992), 161-178. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                6. Fellows, M. R., and Koblitz, N. Self-witnessing polynomial-time complexity and prime factorization. In <\/span>Proceedings of the 7th Annual Conference on Structure in Complexity Theory, CSCT\u201992<\/em> (1992), IEEE Computer Society Press, pp. 107-110. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                                7. Fellows, M. R., and Koblitz, N. Self-witnessing polynomial-time complexity and prime factorization. <\/span>Designs, Codes and Cryptography 2<\/em>, 3 (1992), 231-235. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                8. Casey, N., and Fellows, M. R. <\/span>This is Mega-Mathematics!<\/em> Los Alamos National Labs, 1992. Available at <\/span>http:\/\/www.c3.lanl.gov\/ captors\/mega-math<\/a>. See also <\/span>http:\/\/www.ccs3.lanl.gov\/mega-math\/write.html<\/a>. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                                9. Fellows, M. R., and Langston, M. A. On well-partial-order theory and its application to combinatorial problems of VLSI design. <\/span>SIAM Journal on Discrete Mathematics 5<\/em>, 1 (1992), 117-126. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                10. Campbell, L., Carlsson, G. E., Dinneen, M. J., Faber, V., Fellows, M., Langston, M. A., Moore, J. W., Mullhaupt, A. P., and Sexton, H. B. Small diameter symmetric networks from linear groups. <\/span>IEEE Transactions on Computers 40<\/em> (1992), 218-220. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                11. Abrahamson, K. R., Fellows, M. R., and Wilson, C. B. Parallel self-reducibility. In <\/span>Proceedings of Computing and Information ICCI\u201992, Fourth International Conference on Computing and Information<\/em> (1992), W. W. Koczkodaj, P. E. Lauer, and A. A. Toptsis, Eds., IEEE Computer Society, pp. 67-70. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                12. Fellows, M. R., and Koblitz, N. Self-witnessing polynomial-time complexity and certificates for primality. In <\/span>Proceedings of the 7th Annual Conference on Structure in Complexity Theory, CSCT\u201992<\/em> (1992), IEEE Computer Society Press, pp. 107-110. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                                   <\/p>\n1991<\/span>

                                                                                                                                                                  \n
                                                                                                                                                                    \n
                                                                                                                                                                  1. \n
                                                                                                                                                                      \n
                                                                                                                                                                    1. \n
                                                                                                                                                                        \n
                                                                                                                                                                      1. Dinneen, M. J., Fellows, M. R., and Faber, V. Algebraic constructions of efficient broadcast networks. In <\/span>Proceedings of Applied Algebra, Algebraic Algorithms and Error-Correcting Codes AAECC\u201991<\/em> (Berlin, Germany, 1991), H. F. Mattson, T. Mora, and T. R. N. Rao, Eds., vol. 539 of <\/span>LNCS<\/em>, Springer-Verlag, pp. 152-158. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      2. Abello, Fellows, and Stillwell. On the complexity and combinatorics of covering finite complexes. <\/span>AJC: Australasian Journal of Combinatorics 4<\/em> (1991), 103-112. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      3. Fellows, M. R., and Kaschube, P. A. Searching for <\/span>k<\/em>3,3<\/sub> in linear time. <\/span>Linear and Multilinear Algebra 29<\/em>, 3 (1991), 279-290. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      4. Fellows, M. R., and Hoover, M. Perfect domination. <\/span>AJC: Australasian Journal of Combinatorics 3<\/em> (1991), 141-150. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      5. Barefoot, C. A., Clark, L. H., Douthett, J., Entringer, R. C., and Fellows, M. R. Cycles of length 0 modulo 3 in graphs. <\/span>Annals of Discrete Mathematics<\/em> (1991), 87-101. An earlier paper was presented at Graph theory, Combinatorics, and Applications, Volume 1. Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      6. Barefoot, C. A., Clark, L. H., Douthett, J., Entringer, R. C., and Fellows, M. R. Cycles of length 0 modulo 3 in graphs. <\/span>Annals of Discrete Mathematics<\/em> (1991), 87-101. An earlier paper was presented at Graph theory, Combinatorics, and Applications, Volume 1. Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      7. Dinneen, M., Faber, V., and Fellows, M. Algebraic constructions of efficient broadcast networks. In <\/span>Proceedings of the Ninth International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC\u201991)<\/em> (1991), H. F. Mattson, T. Mora, and T. Rao, Eds., vol. 539 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 152-158. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      8. Abrahamson, K., Fellows, M. R., Langston, M. A., and Moret, B. M. E. Constructive complexity. <\/span>Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 34<\/em> (1991), 3-16. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                      9. Fellows, M. R., and Langston, M. A. Fast search algorithms for layout permutation problems. <\/span>Integration, the VLSI Journal 12<\/em>, 3 (1991), 321 \u2013 337. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                                         <\/p>\n1990<\/span>

                                                                                                                                                                        \n
                                                                                                                                                                          \n
                                                                                                                                                                        1. \n
                                                                                                                                                                            \n
                                                                                                                                                                          1. \n
                                                                                                                                                                              \n
                                                                                                                                                                            1. Fellows, M., and Kleitman, D. J. Transversals of vertex partitions in graphs. <\/span>SIAM Journal of Discrete Mathematics 3<\/em> (1990), 206-215. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                                               <\/p>\n1989<\/span>

                                                                                                                                                                              \n
                                                                                                                                                                                \n
                                                                                                                                                                              1. \n
                                                                                                                                                                                  \n
                                                                                                                                                                                1. \n
                                                                                                                                                                                    \n
                                                                                                                                                                                  1. Fellows, M. R. The Robertson-Seymour theorems: A survey of applications. In <\/span>CMGA: Graphs and Algorithms: Contemporary Mathematics<\/em> (1989), vol. 89, AMS, pp. 1-18. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  2. Brown, D. J., Fellows, M. R., and Langston, M. A. Polynomial-time self-reducibility: Theoretical motivations and practical results. <\/span>International Journal of Computer Mathematics 31<\/em>(1989), 1-9. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  3. Fellows, M. R., and Stueckle, S. The immersion order, forbidden subgraphs and the complexity of network integrity. <\/span>Journal of Combinatorial Mathematics and Combinatorial Computing 6<\/em> (1989), 23-32. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  4. Fellows, M., and Langston, M. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In <\/span>Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u201989<\/em> (1989), IEEE Computer Society Press, pp. 520-525. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  5. Fellows, M., Kinnersley, N., and Langston, M. Finite-basis theorems and a computation-integrated approach to obstruction set isolation. In <\/span>Proceedings of the Third Conference on Computers and Mathematics<\/em> (1989), E. Kaltofen and S. M. Watt, Eds., Springer-Verlag, pp. 37-45. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  6. Fellows, M. R., and Langston, M. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In <\/span>Proceedings of 30th annual Symposium on Foundations of Computer Science FOCS\u201989<\/em> (1989), IEEE Computer Society Press, pp. 520-525. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  7. Abrahamson, K. R., Fellows, M. R., Ellis, J. A., and Mata, M. E. On the complexity of fixed parameter problems. In <\/span>Proceedings of 30th annual Symposium on Foundations of Computer Science FOCS\u201989<\/em> (1989), IEEE Computer Society Press, pp. 210-215. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  8. Fellows, M. R., and Wojciechowski, J. M. Counting spanning trees in directed regular multigraphs. <\/span>Journal of the Franklin Institute 326<\/em> (1989), 889-896. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  9. Brown, D. J., Fellows, M. R., and Langston, M. A. Polynomial-time self-reducibility: Theoretical motivations and practical results. <\/span>International Journal of Computer Mathematics 31<\/em>(1989), 1-9. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  10. Fellows, M. R., and Stueckle, S. The immersion order, forbidden subgraphs and the complexity of network integrity. <\/span>Journal of Combinatorial Mathematics and Combinatorial Computing 6<\/em> (1989), 23-32. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  11. Fellows, M., and Kleitman, D. J. Radius and diameter in manhattan lattices. <\/span>Discrete Mathematics 73<\/em> (1989), 119-125. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  12. Fellows, M., and Langston, M. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In <\/span>Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS\u201989 (Research Triangle Park, NC)<\/em> (1989), IEEE Computer Society Press, pp. 520-525. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                  13. Fellows, M. R., and Langston, M. A. On search, decision and the efficiency of polynomial-time algorithms. In <\/span>Proceedings of the 21st Annual ACM Symposium on Theory of Computing, STOC\u201989<\/em> (1989), ACM SIGACT, ACM Press, pp. 501-512. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                                                     <\/p>\n1988<\/span>

                                                                                                                                                                                    \n
                                                                                                                                                                                      \n
                                                                                                                                                                                    1. \n
                                                                                                                                                                                        \n
                                                                                                                                                                                      1. \n
                                                                                                                                                                                          \n
                                                                                                                                                                                        1. Fellows, M. R., and Langston, M. A. Nonconstructive tools for proving polynomial-time decidability. <\/span>Journal of the ACM 35<\/em>, 3 (1988), 727-739. [ <\/span>bib<\/a> | <\/span>pdf<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                        2. Fellows, M. R., and Langston, M. A. Layout permutation problems and well-partially-ordered sets. In <\/span>Proceedings of the fifth MIT conference on Advanced research in VLSI<\/em>(Cambridge, MA, USA, 1988), MIT Press, pp. 315-327. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                        3. Fellows, M. R., and Langston, M. A. Fast self-reduction algorithms for combinatorial problems of VLSI design. In <\/span>Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC\u201988. Corfu, Greece<\/em> (1988), J. H. Reif, Ed., vol. 319 of <\/span>Lecture Notes in Computer Science<\/em>, Springer-Verlag, pp. 278-287. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                        4. Fellows, M. R., Friesen, D. K., and Langston, M. A. On finding optimal and near-optimal lineal spanning trees. <\/span>Algorithmica 3<\/em>, 4 (1988), 549-560. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                        5. Fellows, M., Hoover, M., and Harary, F. On the galactic number of a hypercube. <\/span>Mathematical and Computer Modelling 11<\/em> (1988), 212 \u2013 215. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                        6. Fellows, M., and Langston, M. A. Processor utilization in a linearly connected parallel processing system. <\/span>IEEE Transactions on Computers 37<\/em> (1988), 594 \u2013 603. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                        7. Fellows, M. R., and Langston, M. A. Fast self-reduction algorithms for combinatorial problems of VLSI design. In <\/span>Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC\u201988. Corfu, Greece<\/em> (1988), J. H. Reif, Ed., vol. 319 of <\/span>LNCS<\/em>, Springer-Verlag, pp. 278-287. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n

                                                                                                                                                                                           <\/p>\n1987<\/span>

                                                                                                                                                                                          \n
                                                                                                                                                                                            \n
                                                                                                                                                                                          1. \n
                                                                                                                                                                                              \n
                                                                                                                                                                                            1. \n
                                                                                                                                                                                                \n
                                                                                                                                                                                              1. Fellows, M. R., and Langston, M. A. Nonconstructive advances in polynomial-time complexity. <\/span>Information Processing Letters 26<\/em>, 3 (1987), 157-162. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                              2. R. L. Bryant, N. G. Kinnersley, M. R. F., and Langston, M. A. On finding obstruction sets and polynomial-time algorithms for gate matrix layout. In <\/span>Proceedings of the 25th Allerton Conference on Communication, Control and Computing<\/em> (1987), pp. 397-398. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                              3. Bryant, R. L., Fellows, M. R., Kinnersley, N. G., and Langston, M. A. On finding obstruction sets and polynomial-time algorithms for gate matrix layout. In <\/span>Proceedings of the 25th Allerton Conference on Communication, Control and Computing<\/em> (1987), pp. 397-398. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                              4. Fellows, M., Hickling, F., and Syslo, M. A topological parameterization and hard graph problems. <\/span>Congressus Numerantium 59<\/em> (1987), 69-78. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                              5. Clark, L. H., Entringer, R. C., and Fellows, M. Computational complexity of integrity. <\/span>Journal of Combinatorial Mathematics and Combinatorial Computing 2<\/em> (1987), 179-191. [ <\/span>bib<\/a> ]<\/span><\/li>\n
                                                                                                                                                                                              6. Fellows, M. R., and Langston, M. A. Nonconstructive advances in polynomial-time complexity. <\/span>Information Processing Letters 26<\/em>, 3 (1987), 157-162. [ <\/span>bib<\/a> ]<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

                                                                                                                                                                                                bibliometric Information. My research contributions have been internationally recognized. I have published over 200 articles in high-quality peer reviewed journals (such as J. of ACM, TOCT, SIAM J. Computing, J. Comput. Syst. Sci., Algorithmica, Discrete Optimization, IEEE\/ACM Trans. Comput. Biology Bioinform.) and conference proceedings (such as ICALP, ESA, IJCAI, FOCS, STOC, STACS, AAAI). I have …<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-708","page","type-page","status-publish"],"_links":{"self":[{"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/pages\/708","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/comments?post=708"}],"version-history":[{"count":54,"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/pages\/708\/revisions"}],"predecessor-version":[{"id":905,"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/pages\/708\/revisions\/905"}],"wp:attachment":[{"href":"https:\/\/mike-fellows.net\/wordpress\/wp-json\/wp\/v2\/media?parent=708"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}