The future of parameterized complexity: Truly linear time FPT and the WQO hybrid hardware model.

Michael R. Fellows Mike Fellows University of Bergen, Department of Informatics, Norway Charles Darwin University, Darwin, Australia University of Newcastle, NSW, Australia University of Victoria, Department of Computer Science, BC, Canada University of Idaho, Moscow, ID, USA University of New Mexico, Albuquerque, NM, USA University of California, San Diego, CA, USA Humboldt Prize http://www.mrfellows.net/ https://www.uib.no/en/persons/Michael.Ralph.Fellows https://scholar.google.com/citations?user=rLCC8mQAAAAJ https://zbmath.org/authors/?q=ai:fellows.michael-r https://mathscinet.ams.org/mathscinet/MRAuthorID/65970 https://mathgenealogy.org/id.php?id=72015 https://en.wikipedia.org/wiki/Michael_Fellows https://orcid.org/0000-0002-6148-9212 https://www.wikidata.org/entity/Q6830255 http://isni.org/isni/0000000034435919 https://id.loc.gov/authorities/names/n97054411 https://d-nb.info/gnd/1024321916 https://ieeexplore.ieee.org/author/37265913500 conf/birthday/2012fellows

Michael R. Fellows Frances A. Rosamond The future of parameterized complexity: Truly linear time FPT and the WQO hybrid hardware model. 2026 101036 62 Comput. Sci. Rev. https://doi.org/10.1016/j.cosrev.2026.101036 db/journals/csr/csr62.html#FellowsR26 streams/journals/csr

Michael R. Fellows Mario Grobler Nicole Megow Amer E. Mouawad Vijayaragunathan Ramamoorthi Frances A. Rosamond Daniel Schmand Sebastian Siebertz On solution discovery via reconfiguration. 103747 2026 157 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2025.103747 db/journals/jcss/jcss157.html#FellowsGMMRRSS26 streams/journals/jcss

Benjamin Merlin Bumpus Rod Downey Tala Eagling-Vose Jessica A. Enright Michael R. Fellows David C. Kutner Laura Larios-Jones Barnaby Martin Frances A. Rosamond Ella Yates O(n +f(k)): Truly Linear FPT. 2026 June abs/2606.02492 CoRR https://doi.org/10.48550/arXiv.2606.02492 db/journals/corr/corr2606.html#abs-2606-02492 streams/journals/corr

Benjamin Bergougnoux Nello Blaser Michael R. Fellows Petr A. Golovach Frances A. Rosamond Emmanuel Sam On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. 103680 2025 154 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2025.103680 db/journals/jcss/jcss154.html#BergougnouxBFGRS25 streams/journals/jcss

Michael R. Fellows Frances A. Rosamond Games That Cannot Go on Forever! Active Participation in Research Is the Main Issue for Kids. 15-35 2024 CMSC https://doi.org/10.1007/978-3-031-73257-7_2 conf/cmsc/2024 db/conf/cmsc/cmsc2024.html#FellowsR24 Matthias Bentert Michael R. Fellows Petr A. Golovach Frances A. Rosamond Saket Saurabh 0001 Breaking a Graph into Connected Components with Small Dominating Sets. 24:1-24:15 2024 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2024.24 conf/mfcs/2024 db/conf/mfcs/mfcs2024.html#BentertFGR024 Emmanuel Sam Michael R. Fellows Frances A. Rosamond Petr A. Golovach On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. 353-367 2023 CIAC https://doi.org/10.1007/978-3-031-30448-4_25 conf/ciac/2023 db/conf/ciac/ciac2023.html#SamFRG23 Michael R. Fellows Mario Grobler Nicole Megow Amer E. Mouawad Vijayaragunathan Ramamoorthi Frances A. Rosamond Daniel Schmand Sebastian Siebertz On Solution Discovery via Reconfiguration. 700-707 2023 ECAI https://doi.org/10.3233/FAIA230334 conf/ecai/2023 db/conf/ecai/ecai2023.html#FellowsGMMRRSS23

Michael R. Fellows Mario Grobler Nicole Megow Amer E. Mouawad Vijayaragunathan Ramamoorthi Frances A. Rosamond Daniel Schmand Sebastian Siebertz On Solution Discovery via Reconfiguration. 2023 abs/2304.14295 CoRR https://doi.org/10.48550/arXiv.2304.14295 db/journals/corr/corr2304.html#abs-2304-14295

Deepak Ajwani Rob H. Bisseling Katrin Casel Ümit V. Çatalyürek Cédric Chevalier Florian Chudigiewitsch Marcelo Fonseca Faraj Michael R. Fellows Lars Gottesbüren Tobias Heuer George Karypis Kamer Kaya Jakub Lacki Johannes Langguth Xiaoye Sherry Li Ruben Mayer Johannes Meintrup Yosuke Mizutani François Pellegrini Fabrizio Petrini Frances A. Rosamond Ilya Safro Sebastian Schlag Christian Schulz 0003 Roohani Sharma Darren Strash Blair D. Sullivan Bora Uçar Albert-Jan Yzelman Open Problems in (Hyper)Graph Decomposition. 2023 abs/2310.11812 CoRR https://doi.org/10.48550/arXiv.2310.11812 db/journals/corr/corr2310.html#abs-2310-11812

George Karypis Christian Schulz 0003 Darren Strash Deepak Ajwani Rob H. Bisseling Katrin Casel Ümit V. Çatalyürek Cédric Chevalier Florian Chudigiewitsch Marcelo Fonseca Faraj Michael R. Fellows Lars Gottesbüren Tobias Heuer Kamer Kaya Jakub Lacki Johannes Langguth Xiaoye Sherry Li Ruben Mayer Johannes Meintrup Yosuke Mizutani François Pellegrini Fabrizio Petrini Frances A. Rosamond Ilya Safro Sebastian Schlag Roohani Sharma Blair D. Sullivan Bora Uçar Albert-Jan Yzelman Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). 1-45 2023 13 Dagstuhl Reports 8 https://doi.org/10.4230/DagRep.13.8.1 db/journals/dagstuhl-reports/dagstuhl-reports13.html#Karypis0SABCCCC23

Julien Baste Michael R. Fellows Lars Jaffke Tomás Masarík Mateus de Oliveira Oliveira Geevarghese Philip Frances A. Rosamond Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. 103644 2022 303 Artif. Intell. https://doi.org/10.1016/j.artint.2021.103644 db/journals/ai/ai303.html#BasteFJMOPR22

Laurent Bulteau Michael R. Fellows Christian Komusiewicz Frances A. Rosamond Parameterized String Equations. 2021 abs/2104.14171 CoRR https://arxiv.org/abs/2104.14171 db/journals/corr/corr2104.html#abs-2104-14171

Michael R. Fellows Frances A. Rosamond Collaborating with Hans: Some Remaining Wonderments. 7-17 2020 Treewidth, Kernels, and Algorithms https://doi.org/10.1007/978-3-030-42071-0_2 conf/birthday/2020bodlaender db/conf/birthday/bodlaender2020.html#FellowsR20 Julien Baste Michael R. Fellows Lars Jaffke Tomás Masarík Mateus de Oliveira Oliveira Geevarghese Philip Frances A. Rosamond Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. 1119-1125 2020 IJCAI https://doi.org/10.24963/ijcai.2020/156 conf/ijcai/2020 db/conf/ijcai/ijcai2020.html#BasteFJMOPR20

Julien Baste Michael R. Fellows Lars Jaffke Tomás Masarík Mateus de Oliveira Oliveira Geevarghese Philip Frances A. Rosamond Diversity in Combinatorial Optimization. 2019 abs/1903.07410 CoRR http://arxiv.org/abs/1903.07410 db/journals/corr/corr1903.html#abs-1903-07410

Michael R. Fellows Fábio Protti Frances A. Rosamond Maise Dantas da Silva Uéverton S. Souza Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. 94-100 2018 245 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2017.07.004 db/journals/dam/dam245.html#FellowsPRSS18

Michael R. Fellows Ariel Kulik Frances A. Rosamond Hadas Shachnai Parameterized approximation via fidelity preserving transformations. 30-40 2018 93 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2017.11.001 db/journals/jcss/jcss93.html#FellowsKRS18

Michael R. Fellows Frances A. Rosamond A brief history of Edward K. Blum and the Journal of Computer and System Sciences. 2-10 2018 94 J. Comput. Syst. Sci. https://doi.org/10.1016/j.jcss.2018.02.001 db/journals/jcss/jcss94.html#FellowsR18

Michael R. Fellows Lars Jaffke Aliz Izabella Király Frances A. Rosamond Mathias Weller What Is Known About Vertex Cover Kernelization? 330-356 2018 Adventures Between Lower Bounds and Higher Altitudes https://doi.org/10.1007/978-3-319-98355-4_19 conf/birthday/2018hromkovic db/conf/birthday/hromkovic2018.html#FellowsJKRW18 Michael R. Fellows Frances A. Rosamond Maise Dantas da Silva Uéverton S. Souza A Survey on the Complexity of Flood-Filling Games. 357-376 2018 Adventures Between Lower Bounds and Higher Altitudes https://doi.org/10.1007/978-3-319-98355-4_20 conf/birthday/2018hromkovic db/conf/birthday/hromkovic2018.html#FellowsRSS18

Michael R. Fellows Lars Jaffke Aliz Izabella Király Frances A. Rosamond Mathias Weller What is known about Vertex Cover Kernelization? 2018 abs/1811.09429 CoRR http://arxiv.org/abs/1811.09429 db/journals/corr/corr1811.html#abs-1811-09429

Michael R. Fellows Surfing with Rod. 9-18 2017 Computability and Complexity https://doi.org/10.1007/978-3-319-50062-1_2 conf/birthday/2017downey db/conf/birthday/downey2017.html#Fellows17 Adam R. Day Michael R. Fellows Noam Greenberg Bakhadyr Khoussainov Alexander G. Melnikov Frances A. Rosamond Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Computability and Complexity Springer 2017 Lecture Notes in Computer Science 10010 978-3-319-50061-4 https://doi.org/10.1007/978-3-319-50062-1 db/conf/birthday/downey2017.html

Michael R. Fellows Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You. 2016 119 Bull. EATCS http://eatcs.org/beatcs/index.php/beatcs/article/view/415 db/journals/eatcs/eatcs119.html#Fellows16

Michael R. Fellows Danny Hermelin Frances A. Rosamond Hadas Shachnai Tractable Parameterizations for the Minimum Linear Arrangement Problem. 6:1-6:12 2016 8 ACM Trans. Comput. Theory 2 https://doi.org/10.1145/2898352 db/journals/toct/toct8.html#FellowsHRS16

René van Bevern Rodney G. Downey Michael R. Fellows Serge Gaspers Frances A. Rosamond Myhill-Nerode Methods for Hypergraphs. 696-729 2015 73 Algorithmica 4 https://doi.org/10.1007/s00453-015-9977-x db/journals/algorithmica/algorithmica73.html#BevernDFGR15

Uéverton dos Santos Souza Frances A. Rosamond Michael R. Fellows Fábio Protti Maise Dantas da Silva The Flood-It game parameterized by the vertex cover number. 35-40 2015 50 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2015.07.007 db/journals/endm/endm50.html#SouzaRFPS15

Gábor Erdélyi Michael R. Fellows Jörg Rothe Lena Schend Control complexity in Bucklin and fallback voting: A theoretical analysis. 632-660 2015 81 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2014.11.002 db/journals/jcss/jcss81.html#ErdelyiFRS15

Gábor Erdélyi Michael R. Fellows Jörg Rothe Lena Schend Control complexity in Bucklin and fallback voting: An experimental analysis. 661-670 2015 81 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2014.11.003 db/journals/jcss/jcss81.html#ErdelyiFRS15a

Michael R. Fellows Uéverton dos Santos Souza Fábio Protti Maise Dantas da Silva Tractability and hardness of flood-filling games on trees. 102-116 2015 576 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.02.008 db/journals/tcs/tcs576.html#FellowsSPS15

Faisal N. Abu-Khzam Judith Egan Michael R. Fellows Frances A. Rosamond Peter Shaw 0001 On the parameterized complexity of dynamic problems. 426-434 2015 607 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.06.053 db/journals/tcs/tcs607.html#Abu-KhzamEFRS15

Robert Crowston Michael R. Fellows Gregory Z. Gutin Mark Jones 0001 Eun Jung Kim 0002 Fran Rosamond Imre Z. Ruzsa Stéphan Thomassé Anders Yeo Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. 687-696 2014 80 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2013.10.002 https://www.wikidata.org/entity/Q57359600 db/journals/jcss/jcss80.html#CrowstonFGJKRRTY14

Cristina Bazgan Morgan Chopin Marek Cygan Michael R. Fellows Fedor V. Fomin Erik Jan van Leeuwen Parameterized complexity of firefighting. 1285-1297 2014 80 J. Comput. Syst. Sci. 7 https://doi.org/10.1016/j.jcss.2014.03.001 https://www.wikidata.org/entity/Q57359593 db/journals/jcss/jcss80.html#BazganCCFFL14

Michael R. Fellows Bart M. P. Jansen FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. 16:1-16:26 2014 6 ACM Trans. Comput. Theory 4 https://doi.org/10.1145/2635820 https://www.wikidata.org/entity/Q57359585 db/journals/toct/toct6.html#FellowsJ14

Faisal N. Abu-Khzam Judith Egan Michael R. Fellows Frances A. Rosamond Peter Shaw 0001 On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. 625-636 2014 COCOA https://doi.org/10.1007/978-3-319-12691-3_47 conf/cocoa/2014 db/conf/cocoa/cocoa2014.html#Abu-KhzamEFRS14 Rodney G. Downey Michael R. Fellows Fundamentals of Parameterized Complexity. 2013 I-SSS, 3-707 Springer Texts in Computer Science 978-1-4471-5558-4 978-1-4471-5559-1 https://doi.org/10.1007/978-1-4471-5559-1

Michael R. Fellows Bart M. P. Jansen Frances A. Rosamond Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. 541-566 2013 34 Eur. J. Comb. 3 https://doi.org/10.1016/j.ejc.2012.04.008 https://www.wikidata.org/entity/Q57359649 db/journals/ejc/ejc34.html#FellowsJR13

Michael R. Fellows Tobias Friedrich 0001 Danny Hermelin Nina Narodytska Frances A. Rosamond Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. 81-89 2013 472 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2012.11.038 https://www.wikidata.org/entity/Q57359604 db/journals/tcs/tcs472.html#FellowsFHNR13

Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Elena Losievskaja Frances A. Rosamond Saket Saurabh 0001 Distortion is Fixed Parameter Tractable. 16:1-16:20 2013 5 ACM Trans. Comput. Theory 4 https://doi.org/10.1145/2489789 https://www.wikidata.org/entity/Q57359610 db/journals/toct/toct5.html#FellowsFLLRS13

Michael R. Fellows Danny Hermelin Frances A. Rosamond Hadas Shachnai Tractable Parameterizations for the Minimum Linear Arrangement Problem. 457-468 2013 ESA https://doi.org/10.1007/978-3-642-40450-4_39 https://www.wikidata.org/entity/Q57359622 conf/esa/2013 db/conf/esa/esa2013.html#FellowsHRS13 René van Bevern Michael R. Fellows Serge Gaspers Frances A. Rosamond Myhill-Nerode Methods for Hypergraphs. 372-382 2013 ISAAC https://doi.org/10.1007/978-3-642-45030-3_35 https://www.wikidata.org/entity/Q57359615 conf/isaac/2013 db/conf/isaac/isaac2013.html#BevernFGR13 Michael R. Fellows Bart M. P. Jansen FPT Is Characterized by Useful Obstruction Sets. 261-273 2013 WG https://doi.org/10.1007/978-3-642-45043-3_23 https://www.wikidata.org/entity/Q57359791 conf/wg/2013 db/conf/wg/wg2013.html#FellowsJ13 Michael R. Fellows Xuehou Tan Binhai Zhu Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings Springer 2013 978-3-642-38755-5 978-3-642-38756-2 https://doi.org/10.1007/978-3-642-38756-2 7924 Lecture Notes in Computer Science FAW-AAIM db/conf/aaim/aaim2013.html

Michael R. Fellows Bart M. P. Jansen FPT is Characterized by Useful Obstruction Sets http://arxiv.org/abs/1305.3102 2013 CoRR abs/1305.3102 db/journals/corr/corr1305.html#abs-1305-3102

Michael Dom Michael R. Fellows Frances A. Rosamond Somnath Sikdar The Parameterized Complexity of Stabbing Rectangles. 564-594 2012 62 Algorithmica 1-2 https://doi.org/10.1007/s00453-010-9471-4 https://www.wikidata.org/entity/Q57359642 db/journals/algorithmica/algorithmica62.html#DomFRS12

Michael R. Fellows Danny Hermelin Frances A. Rosamond Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. 3-18 2012 64 Algorithmica 1 https://doi.org/10.1007/s00453-011-9545-y https://www.wikidata.org/entity/Q57359664 db/journals/algorithmica/algorithmica64.html#FellowsHR12

Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Frances A. Rosamond Saket Saurabh 0001 Yngve Villanger Local search: Is brute-force avoidable? 707-719 2012 78 J. Comput. Syst. Sci. 3 https://doi.org/10.1016/j.jcss.2011.10.003 https://www.wikidata.org/entity/Q57359626 db/journals/jcss/jcss78.html#FellowsFLRSV12

Michael R. Fellows Serge Gaspers Frances A. Rosamond Parameterizing by the Number of Numbers. 675-693 2012 50 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-011-9367-y https://www.wikidata.org/entity/Q57359637 db/journals/mst/mst50.html#FellowsGR12

Michael R. Fellows Andreas Pfandler Frances A. Rosamond Stefan Rümmele The Parameterized Complexity of Abduction. 2012 AAAI https://doi.org/10.1609/aaai.v26i1.8224 conf/aaai/2012 db/conf/aaai/aaai2012.html#FellowsPRR12 743-749 Leo Brueggeman Michael R. Fellows Rudolf Fleischer Martin Lackner Christian Komusiewicz Yiannis Koutis Andreas Pfandler Frances A. Rosamond Train Marshalling Is Fixed Parameter Tractable. 51-56 2012 FUN https://doi.org/10.1007/978-3-642-30347-0_8 https://www.wikidata.org/entity/Q57359655 conf/fun/2012 db/conf/fun/fun2012.html#BrueggemanFFLKKPR12 Michael R. Fellows Ariel Kulik Frances A. Rosamond Hadas Shachnai Parameterized Approximation via Fidelity Preserving Transformations. 351-362 2012 ICALP (1) https://doi.org/10.1007/978-3-642-31594-7_30 https://www.wikidata.org/entity/Q57359630 conf/icalp/2012-1 db/conf/icalp/icalp2012-1.html#FellowsKRS12

René van Bevern Michael R. Fellows Serge Gaspers Frances A. Rosamond How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding http://arxiv.org/abs/1211.1299 2012 CoRR abs/1211.1299 db/journals/corr/corr1211.html#abs-1211-1299

Michael R. Fellows Jiong Guo Dániel Marx Saket Saurabh 0001 Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). 26-50 2012 2 Dagstuhl Reports 6 https://doi.org/10.4230/DagRep.2.6.26 db/journals/dagstuhl-reports/dagstuhl-reports2.html#FellowsGMS12

Hans L. Bodlaender Michael R. Fellows Michael A. Langston Mark A. Ragan Frances A. Rosamond Mark Weyer Quadratic Kernelization for Convex Recoloring of Trees. 362-388 2011 61 Algorithmica 2 https://doi.org/10.1007/s00453-010-9404-2 https://www.wikidata.org/entity/Q57198691 db/journals/algorithmica/algorithmica61.html#BodlaenderFLRRW11

Michael R. Fellows Henning Fernau Facility location problems: A parameterized view. 1118-1130 2011 159 Discret. Appl. Math. 11 https://doi.org/10.1016/j.dam.2011.03.021 https://www.wikidata.org/entity/Q57359683 db/journals/dam/dam159.html#FellowsF11

Michael R. Fellows Fedor V. Fomin Gregory Z. Gutin Special Issue on Parameterized Complexity of Discrete Optimization. 1 2011 8 Discret. Optim. 1 https://doi.org/10.1016/j.disopt.2011.02.001 https://www.wikidata.org/entity/Q57359716 db/journals/disopt/disopt8.html#FellowsFG11

Michael R. Fellows Jiong Guo Christian Komusiewicz Rolf Niedermeier Johannes Uhlmann Graph-based data clustering with overlaps. 2-17 2011 8 Discret. Optim. 1 https://doi.org/10.1016/j.disopt.2010.09.006 https://www.wikidata.org/entity/Q57359689 db/journals/disopt/disopt8.html#FellowsGKNU11

Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Frances A. Rosamond Saket Saurabh 0001 Stefan Szeider Carsten Thomassen On the complexity of some colorful problems parameterized by treewidth. 143-153 2011 209 Inf. Comput. 2 https://doi.org/10.1016/j.ic.2010.11.026 https://www.wikidata.org/entity/Q56926595 db/journals/iandc/iandc209.html#FellowsFLRSST11

Michael R. Fellows Guillaume Fertin Danny Hermelin Stéphane Vialette Upper and lower bounds for finding connected motifs in vertex-colored graphs. 799-811 2011 77 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2010.07.003 https://www.wikidata.org/entity/Q57359721 db/journals/jcss/jcss77.html#FellowsFHV11

Michael R. Fellows Jiong Guo Hannes Moser Rolf Niedermeier A generalization of Nemhauser and Trotterʼs local optimization theorem. 1141-1158 2011 77 J. Comput. Syst. Sci. 6 https://doi.org/10.1016/j.jcss.2010.12.001 https://www.wikidata.org/entity/Q57359675 db/journals/jcss/jcss77.html#FellowsGMN11

Nadja Betzler René van Bevern Michael R. Fellows Christian Komusiewicz Rolf Niedermeier Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. 1296-1308 2011 8 IEEE ACM Trans. Comput. Biol. Bioinform. 5 https://doi.org/10.1109/TCBB.2011.19 https://doi.ieeecomputersociety.org/10.1109/TCBB.2011.19 https://dl.acm.org/doi/10.1109/TCBB.2011.19 https://www.wikidata.org/entity/Q51607814 db/journals/tcbb/tcbb8.html#BetzlerBFKN11

Michael R. Fellows Tzvika Hartman Danny Hermelin Gad M. Landau Frances A. Rosamond Liat Rozenberg Haplotype Inference Constrained by Plausible Haplotype Data. 1692-1699 2011 8 IEEE ACM Trans. Comput. Biol. Bioinform. 6 https://doi.org/10.1109/TCBB.2010.72 https://doi.ieeecomputersociety.org/10.1109/TCBB.2010.72 https://dl.acm.org/doi/10.1109/TCBB.2010.72 https://www.wikidata.org/entity/Q33670026 db/journals/tcbb/tcbb8.html#FellowsHHLRR11

Michael R. Fellows Jiong Guo Hannes Moser Rolf Niedermeier A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. 5:1-5:23 2011 2 ACM Trans. Comput. Theory 2 https://doi.org/10.1145/1944857.1944860 https://www.wikidata.org/entity/Q130962541 db/journals/toct/toct2.html#FellowsGMN11

Michael R. Fellows Recent Developments in the Theory of Pre-processing. 4-5 2011 FAW-AAIM https://doi.org/10.1007/978-3-642-21204-8_2 https://www.wikidata.org/entity/Q57359707 conf/aaim/2011 db/conf/aaim/aaim2011.html#Fellows11 Robert Crowston Michael R. Fellows Gregory Z. Gutin Mark Jones 0001 Frances A. Rosamond Stéphan Thomassé Anders Yeo Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. 229-240 2011 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2011.229 conf/fsttcs/2011 db/conf/fsttcs/fsttcs2011.html#CrowstonFGJRTY11 Michael R. Fellows Tobias Friedrich 0001 Danny Hermelin Nina Narodytska Frances A. Rosamond Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. 522-527 2011 IJCAI https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-095 conf/ijcai/2011 db/conf/ijcai/ijcai2011.html#FellowsFHNR11 Cristina Bazgan Morgan Chopin Michael R. Fellows Parameterized Complexity of the Firefighter Problem. 643-652 2011 ISAAC https://doi.org/10.1007/978-3-642-25591-5_66 https://www.wikidata.org/entity/Q57359699 conf/isaac/2011 db/conf/isaac/isaac2011.html#BazganCF11 Michael R. Fellows Serge Gaspers Frances A. Rosamond Multivariate Complexity Theory. 269-293 2011 Computer Science, The Hardware, Software and Heart of It https://doi.org/10.1007/978-1-4614-1168-0_13 books/sp/cs11 db/books/collections/cs2011.html#FellowsGR11

Gábor Erdélyi Michael R. Fellows Lena Piras Jörg Rothe Control Complexity in Bucklin and Fallback Voting http://arxiv.org/abs/1103.2230 2011 CoRR abs/1103.2230 db/journals/corr/corr1103.html#abs-1103-2230

Michael R. Fellows Jiong Guo Iyad A. Kanj The parameterized complexity of some minimum label problems. 727-740 2010 76 J. Comput. Syst. Sci. 8 https://doi.org/10.1016/j.jcss.2010.02.012 https://www.wikidata.org/entity/Q57359760 db/journals/jcss/jcss76.html#FellowsGK10

Michael R. Fellows Jörg Flum Danny Hermelin Moritz Müller Frances A. Rosamond W-Hierarchies Defined by Symmetric Gates. 311-339 2010 46 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9138-6 https://www.wikidata.org/entity/Q57359767 db/journals/mst/mst46.html#FellowsFHMR10

Hans L. Bodlaender Michael R. Fellows Pinar Heggernes Federico Mancini 0001 Charis Papadopoulos Frances A. Rosamond Clustering with partial information. 1202-1211 2010 411 Theor. Comput. Sci. 7-9 https://doi.org/10.1016/j.tcs.2009.12.016 https://www.wikidata.org/entity/Q57359734 db/journals/tcs/tcs411.html#BodlaenderFHMPR10

Zhi-Zhong Chen Michael R. Fellows Bin Fu Haitao Jiang 0005 Yang Liu 0002 Lusheng Wang 0001 Binhai Zhu A Linear Kernel for Co-Path/Cycle Packing. 90-102 2010 AAIM https://doi.org/10.1007/978-3-642-14355-7_10 https://www.wikidata.org/entity/Q57359728 conf/aaim/2010 db/conf/aaim/aaim2010.html#ChenFFJLWZ10 Michael R. Fellows Bart M. P. Jansen Daniel Lokshtanov Frances A. Rosamond Saket Saurabh 0001 Determining the Winner of a Dodgson Election is Hard. 459-468 2010 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2010.459 conf/fsttcs/2010 db/conf/fsttcs/fsttcs2010.html#FellowsJLRS10 Michael R. Fellows Serge Gaspers Frances A. Rosamond Parameterizing by the Number of Numbers. 123-134 2010 IPEC https://doi.org/10.1007/978-3-642-17493-3_13 https://www.wikidata.org/entity/Q57359751 conf/iwpec/2010 db/conf/iwpec/ipec2010.html#FellowsGR10 Mike Fellows Panos Giannopoulos Christian Knauer Christophe Paul Frances A. Rosamond Sue Whitesides Nathan Yu Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. 123-134 2010 WG https://doi.org/10.1007/978-3-642-16926-7_13 https://www.wikidata.org/entity/Q57359743 conf/wg/2010 db/conf/wg/wg2010.html#FellowsGKPRWY10

Gábor Erdélyi Michael R. Fellows Parameterized Control Complexity in Fallback Voting http://arxiv.org/abs/1004.3659 2010 CoRR abs/1004.3659 db/journals/corr/corr1004.html#abs-1004-3659

Michael R. Fellows Serge Gaspers Frances A. Rosamond Parameterizing by the Number of Numbers http://arxiv.org/abs/1007.2021 2010 CoRR abs/1007.2021 db/journals/corr/corr1007.html#abs-1007-2021

Hans L. Bodlaender Michael R. Fellows Dimitrios M. Thilikos Derivation of algorithms for cutwidth and related graph layout parameters. 231-244 2009 75 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2008.10.003 https://www.wikidata.org/entity/Q57359781 db/journals/jcss/jcss75.html#BodlaenderFT09

Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Danny Hermelin On problems without polynomial kernels. 423-434 2009 75 J. Comput. Syst. Sci. 8 https://doi.org/10.1016/j.jcss.2009.04.001 https://www.wikidata.org/entity/Q57359819 db/journals/jcss/jcss75.html#BodlaenderDFH09

Michael R. Fellows Daniel Lokshtanov Neeldhara Misra Matthias Mnich Frances A. Rosamond Saket Saurabh 0001 The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. 822-848 2009 45 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-009-9167-9 https://www.wikidata.org/entity/Q29397585 db/journals/mst/mst45.html#FellowsLMMRS09

Michael R. Fellows Frances A. Rosamond Udi Rotics Stefan Szeider Clique-Width is NP-Complete. 909-939 2009 23 SIAM J. Discret. Math. 2 https://doi.org/10.1137/070687256 https://www.wikidata.org/entity/Q56456200 db/journals/siamdm/siamdm23.html#FellowsRRS09

Michael R. Fellows Danny Hermelin Frances A. Rosamond Stéphane Vialette On the parameterized complexity of multiple-interval graph problems. 53-61 2009 410 Theor. Comput. Sci. 1 https://doi.org/10.1016/j.tcs.2008.09.065 https://www.wikidata.org/entity/Q57359825 db/journals/tcs/tcs410.html#FellowsHRV09

Nadja Betzler Michael R. Fellows Jiong Guo Rolf Niedermeier Frances A. Rosamond Fixed-parameter algorithms for Kemeny rankings. 4554-4570 2009 410 Theor. Comput. Sci. 45 https://doi.org/10.1016/j.tcs.2009.08.033 https://www.wikidata.org/entity/Q57359797 db/journals/tcs/tcs410.html#BetzlerFGNR09

Nadja Betzler Michael R. Fellows Jiong Guo Rolf Niedermeier Frances A. Rosamond How similarity helps to efficiently compute Kemeny rankings. 657-664 2009 AAMAS (1) https://dl.acm.org/citation.cfm?id=1558104 conf/atal/2009-1 db/conf/atal/aamas2009-1.html#BetzlerFGNR09 Michael R. Fellows Jiong Guo Christian Komusiewicz Rolf Niedermeier Johannes Uhlmann Graph-Based Data Clustering with Overlaps. 516-526 2009 COCOON https://doi.org/10.1007/978-3-642-02882-3_51 https://www.wikidata.org/entity/Q57359803 conf/cocoon/2009 db/conf/cocoon/cocoon2009.html#FellowsGKNU09 Michael R. Fellows Tzvika Hartman Danny Hermelin Gad M. Landau Frances A. Rosamond Liat Rozenberg Haplotype Inference Constrained by Plausible Haplotype Data. 339-352 2009 CPM https://doi.org/10.1007/978-3-642-02441-2_30 https://www.wikidata.org/entity/Q57359811 conf/cpm/2009 db/conf/cpm/cpm2009.html#FellowsHHLRR09 Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Elena Losievskaja Frances A. Rosamond Saket Saurabh 0001 Distortion Is Fixed Parameter Tractable. 463-474 2009 ICALP (1) https://doi.org/10.1007/978-3-642-02927-1_39 https://www.wikidata.org/entity/Q57359785 conf/icalp/2009-1 db/conf/icalp/icalp2009-1.html#FellowsFLLRS09 Michael R. Fellows Frances A. Rosamond Fedor V. Fomin Daniel Lokshtanov Saket Saurabh 0001 Yngve Villanger Local Search: Is Brute-Force Avoidable? 486-491 2009 IJCAI http://ijcai.org/Proceedings/09/Papers/088.pdf conf/ijcai/2009 db/conf/ijcai/ijcai2009.html#FellowsRFLSV09 Michael R. Fellows Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. 2-10 2009 IWOCA https://doi.org/10.1007/978-3-642-10217-2_2 https://www.wikidata.org/entity/Q57359836 conf/iwoca/2009 db/conf/iwoca/iwoca2009.html#Fellows09 Rosa Enciso Michael R. Fellows Jiong Guo Iyad A. Kanj Frances A. Rosamond Ondrej Suchý 0001 What Makes Equitable Connected Partition Easy. 122-133 2009 IWPEC https://doi.org/10.1007/978-3-642-11269-0_10 https://www.wikidata.org/entity/Q57359848 conf/iwpec/2009 db/conf/iwpec/iwpec2009.html#EncisoFGKRS09 Michael R. Fellows Danny Hermelin Frances A. Rosamond Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. 149-160 2009 IWPEC https://doi.org/10.1007/978-3-642-11269-0_12 https://www.wikidata.org/entity/Q57359842 conf/iwpec/2009 db/conf/iwpec/iwpec2009.html#FellowsHR09 Michael R. Fellows Jiong Guo Hannes Moser Rolf Niedermeier A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. 319-330 2009 MFCS https://doi.org/10.1007/978-3-642-03816-7_28 https://www.wikidata.org/entity/Q57359771 conf/mfcs/2009 db/conf/mfcs/mfcs2009.html#FellowsGMN09 Michael R. Fellows Jiong Guo Hannes Moser Rolf Niedermeier A Generalization of Nemhauser and Trotter's Local Optimization Theorem. 409-420 2009 STACS https://doi.org/10.4230/LIPIcs.STACS.2009.1820 conf/stacs/2009 db/conf/stacs/stacs2009.html#FellowsGMN09 Michael Dom Michael R. Fellows Frances A. Rosamond Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. 298-309 2009 WALCOM https://doi.org/10.1007/978-3-642-00202-1_26 https://www.wikidata.org/entity/Q57359830 conf/walcom/2009 db/conf/walcom/walcom2009.html#DomFR09 Michael R. Fellows Jiong Guo Iyad A. Kanj The Parameterized Complexity of Some Minimum Label Problems. 88-99 2009 WG https://doi.org/10.1007/978-3-642-11409-0_8 https://www.wikidata.org/entity/Q57359755 conf/wg/2009 db/conf/wg/wg2009.html#FellowsGK09 Stephan Diehl 0001 Michael R. Fellows Ulrike Stege Perspectives Workshop: Preventing the Brainware Crisis, 31.03. - 03.04.2009 Perspectives Workshop: Preventing the Brainware Crisis 09142 2009 Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany Dagstuhl Seminar Proceedings db/conf/dagstuhl/P9142.html http://drops.dagstuhl.de/portals/09142/

Michael R. Fellows Jiong Guo Hannes Moser Rolf Niedermeier A Generalization of Nemhauser and Trotter's Local Optimization Theorem http://arxiv.org/abs/0902.2149 2009 CoRR abs/0902.2149 db/journals/corr/corr0902.html#abs-0902-2149

Michael R. Fellows Panos Giannopoulos Christian Knauer Christophe Paul Frances A. Rosamond Sue Whitesides Nathan Yu Abstract Milling with Turn Costs http://arxiv.org/abs/0912.1050 2009 CoRR abs/0912.1050 db/journals/corr/corr0912.html#abs-0912-1050

Michael R. Fellows Christian Knauer Naomi Nishimura Prabhakar Ragde Frances A. Rosamond Ulrike Stege Dimitrios M. Thilikos Sue Whitesides Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. 167-176 2008 52 Algorithmica 2 https://doi.org/10.1007/s00453-007-9146-y https://www.wikidata.org/entity/Q57359876 db/journals/algorithmica/algorithmica52.html#FellowsKNRRSTW08

Vida Dujmovic Michael R. Fellows Matthew Kitching Giuseppe Liotta Catherine McCartin Naomi Nishimura Prabhakar Ragde Frances A. Rosamond Sue Whitesides David R. Wood On the Parameterized Complexity of Layered Graph Drawing. 267-292 2008 52 Algorithmica 2 https://doi.org/10.1007/s00453-007-9151-1 https://www.wikidata.org/entity/Q57359905 db/journals/algorithmica/algorithmica52.html#DujmovicFKLMNRRWW08

Rodney G. Downey Michael R. Fellows Michael A. Langston The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. 1-6 2008 51 Comput. J. 1 https://doi.org/10.1093/comjnl/bxm111 https://www.wikidata.org/entity/Q57359922 db/journals/cj/cj51.html#DowneyFL08

Rodney G. Downey Michael R. Fellows Catherine McCartin Frances A. Rosamond Parameterized approximation of dominating set problems. 68-70 2008 109 Inf. Process. Lett. 1 https://doi.org/10.1016/j.ipl.2008.09.017 https://www.wikidata.org/entity/Q57359917 db/journals/ipl/ipl109.html#DowneyFMR08

Nadja Betzler Michael R. Fellows Jiong Guo Rolf Niedermeier Frances A. Rosamond Fixed-Parameter Algorithms for Kemeny Scores. 60-71 2008 AAIM https://doi.org/10.1007/978-3-540-68880-8_8 https://www.wikidata.org/entity/Q57359881 conf/aaim/2008 db/conf/aaim/aaim2008.html#BetzlerFGNR08 Michael R. Fellows Henning Fernau Facility Location Problems: A Parameterized View. 188-199 2008 AAIM https://doi.org/10.1007/978-3-540-68880-8_19 https://www.wikidata.org/entity/Q57359868 conf/aaim/2008 db/conf/aaim/aaim2008.html#FellowsF08 Nadja Betzler Michael R. Fellows Christian Komusiewicz Rolf Niedermeier Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. 31-43 2008 CPM https://doi.org/10.1007/978-3-540-69068-9_6 https://www.wikidata.org/entity/Q57359911 conf/cpm/2008 db/conf/cpm/cpm2008.html#BetzlerFKN08 Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Danny Hermelin On Problems without Polynomial Kernels (Extended Abstract). 563-574 2008 ICALP (1) https://doi.org/10.1007/978-3-540-70575-8_46 https://www.wikidata.org/entity/Q57359900 conf/icalp/2008-1 db/conf/icalp/icalp2008-1.html#BodlaenderDFH08 Michael R. Fellows Daniel Lokshtanov Neeldhara Misra Frances A. Rosamond Saket Saurabh 0001 Graph Layout Problems Parameterized by Vertex Cover. 294-305 2008 ISAAC https://doi.org/10.1007/978-3-540-92182-0_28 https://www.wikidata.org/entity/Q57359887 conf/isaac/2008 db/conf/isaac/isaac2008.html#FellowsLMRS08 Michael R. Fellows Daniel Meister 0001 Frances A. Rosamond R. Sritharan Jan Arne Telle Leaf Powers and Their Properties: Using the Trees. 402-413 2008 ISAAC https://doi.org/10.1007/978-3-540-92182-0_37 https://www.wikidata.org/entity/Q57359893 conf/isaac/2008 db/conf/isaac/isaac2008.html#FellowsMRST08 Michael R. Fellows Danny Hermelin Moritz Müller Frances A. Rosamond A Purely Democratic Characterization of W[1]. 103-114 2008 IWPEC https://doi.org/10.1007/978-3-540-79723-4_11 https://www.wikidata.org/entity/Q57359854 conf/iwpec/2008 db/conf/iwpec/iwpec2008.html#FellowsHMR08 Hans L. Bodlaender Michael R. Fellows Pinar Heggernes Federico Mancini 0001 Charis Papadopoulos Frances A. Rosamond Clustering with Partial Information. 144-155 2008 MFCS https://doi.org/10.1007/978-3-540-85238-4_11 https://www.wikidata.org/entity/Q57359861 conf/mfcs/2008 db/conf/mfcs/mfcs2008.html#BodlaenderFHMPR08

Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Elena Losievskaja Frances A. Rosamond Saket Saurabh 0001 Parameterized Low-distortion Embeddings - Graph metrics into lines and trees http://arxiv.org/abs/0804.3028 2008 CoRR abs/0804.3028 db/journals/corr/corr0804.html#abs-0804-3028

Faisal N. Abu-Khzam Michael R. Fellows Michael A. Langston W. Henry Suters Crown Structures for Vertex Cover Kernelization. 411-430 2007 41 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-007-1328-0 https://www.wikidata.org/entity/Q57359941 db/journals/mst/mst41.html#Abu-KhzamFLS07

Liming Cai Michael R. Fellows David W. Juedes Frances A. Rosamond The Complexity of Polynomial-Time Approximation. 459-477 2007 41 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-007-1346-y https://www.wikidata.org/entity/Q57359962 db/journals/mst/mst41.html#CaiFJR07

Frank K. H. A. Dehne Michael R. Fellows Michael A. Langston Frances A. Rosamond Kim Stevens An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. 479-492 2007 41 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-007-1345-z https://www.wikidata.org/entity/Q57359936 db/journals/mst/mst41.html#DehneFLRS07

Michael R. Fellows Frances A. Rosamond The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. 268-277 2007 conf/cie/2007 CiE https://doi.org/10.1007/978-3-540-73001-9_28 https://www.wikidata.org/entity/Q57359956 db/conf/cie/cie2007.html#FellowsR07 Michael R. Fellows Fedor V. Fomin Daniel Lokshtanov Frances A. Rosamond Saket Saurabh 0001 Stefan Szeider Carsten Thomassen On the Complexity of Some Colorful Problems Parameterized by Treewidth. 366-377 2007 conf/cocoa/2007 COCOA https://doi.org/10.1007/978-3-540-73556-4_38 https://www.wikidata.org/entity/Q60060515 db/conf/cocoa/cocoa2007.html#FellowsFLRSST07 Benny Chor Michael R. Fellows Mark A. Ragan Igor Razgon Frances A. Rosamond Sagi Snir Connected Coloring Completion for General Graphs: Algorithms and Complexity. 75-85 2007 conf/cocoon/2007 COCOON https://doi.org/10.1007/978-3-540-73545-8_10 db/conf/cocoon/cocoon2007.html#ChorFRRRS07 Hans L. Bodlaender Michael R. Fellows Michael A. Langston Mark A. Ragan Frances A. Rosamond Mark Weyer Quadratic Kernelization for Convex Recoloring of Trees. 86-96 2007 conf/cocoon/2007 COCOON https://doi.org/10.1007/978-3-540-73545-8_11 db/conf/cocoon/cocoon2007.html#BodlaenderFLRRW07 Michael R. Fellows Michael A. Langston Frances A. Rosamond Peter Shaw 0001 Efficient Parameterized Preprocessing for Cluster Editing. 312-321 2007 conf/fct/2007 FCT https://doi.org/10.1007/978-3-540-74240-1_27 db/conf/fct/fct2007.html#FellowsLRS07 Michael R. Fellows Guillaume Fertin Danny Hermelin Stéphane Vialette Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. 340-351 2007 conf/icalp/2007 ICALP https://doi.org/10.1007/978-3-540-73420-8_31 db/conf/icalp/icalp2007.html#FellowsFHV07

Vida Dujmovic Michael R. Fellows Michael T. Hallett Matthew Kitching Giuseppe Liotta Catherine McCartin Naomi Nishimura Prabhakar Ragde Frances A. Rosamond Matthew Suderman Sue Whitesides David R. Wood A Fixed-Parameter Approach to 2-Layer Planarization. 159-182 2006 45 Algorithmica 2 https://doi.org/10.1007/s00453-005-1181-y https://www.wikidata.org/entity/Q57359967 db/journals/algorithmica/algorithmica45.html#DujmovicFHKLMNRRSWW06

Michael R. Fellows Jens Gramm Rolf Niedermeier On The Parameterized Intractability Of Motif Search Problems. 141-167 2006 26 Comb. 2 https://doi.org/10.1007/s00493-006-0011-4 https://www.wikidata.org/entity/Q57359988 db/journals/combinatorica/combinatorica26.html#FellowsGN06

Michael R. Fellows Stefan Szeider Graham Wrightson On finding short resolution refutations and small unsatisfiable subsets. 351-359 2006 351 Theor. Comput. Sci. 3 https://doi.org/10.1016/j.tcs.2005.10.005 https://www.wikidata.org/entity/Q57359981 db/journals/tcs/tcs351.html#FellowsSW06

Hans L. Bodlaender Michael R. Fellows Michael A. Langston Mark A. Ragan Frances A. Rosamond Mark Weyer Kernelization for Convex Recoloring. 23-35 2006 conf/acid/2006 ACiD db/conf/acid/acid2006.html#BodlaenderFLRRW06 Rodney G. Downey Michael R. Fellows Catherine McCartin Parameterized Approximation Problems. 121-129 2006 conf/iwpec/2006 IWPEC https://doi.org/10.1007/11847250_11 db/conf/iwpec/iwpec2006.html#DowneyFM06 Kevin Burrage Vladimir Estivill-Castro Michael R. Fellows Michael A. Langston Shev Mac Frances A. Rosamond The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. 192-202 2006 conf/iwpec/2006 IWPEC https://doi.org/10.1007/11847250_18 db/conf/iwpec/iwpec2006.html#BurrageEFLMR06 Michael R. Fellows The Lost Continent of Polynomial Time: Preprocessing and Kernelization. 276-277 2006 conf/iwpec/2006 IWPEC https://doi.org/10.1007/11847250_25 db/conf/iwpec/iwpec2006.html#Fellows06 Frank K. H. A. Dehne Michael R. Fellows Henning Fernau Elena Prieto-Rodriguez Frances A. Rosamond NONBLOCKER: Parameterized Algorithmics for minimum dominating set. 237-245 2006 conf/sofsem/2006 SOFSEM https://doi.org/10.1007/11611257_21 https://www.wikidata.org/entity/Q57359976 db/conf/sofsem/sofsem2006.html#DehneFFPR06 Michael R. Fellows Frances A. Rosamond Udi Rotics Stefan Szeider Clique-width minimization is NP-hard. 354-362 2006 conf/stoc/2006 STOC https://doi.org/10.1145/1132516.1132568 https://www.wikidata.org/entity/Q130980217 db/conf/stoc/stoc2006.html#FellowsRRS06

Jianer Chen Benny Chor Mike Fellows Xiuzhen Huang David W. Juedes Iyad A. Kanj Ge Xia Tight lower bounds for certain parameterized NP-hard problems. 216-231 2005 201 Inf. Comput. 2 https://doi.org/10.1016/j.ic.2005.05.001 https://www.wikidata.org/entity/Q57360004 db/journals/iandc/iandc201.html#ChenCFHJKX05

Jochen Alber Hongbing Fan Michael R. Fellows Henning Fernau Rolf Niedermeier Frances A. Rosamond Ulrike Stege A refined search tree technique for Dominating Set on planar graphs. 385-405 2005 71 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2004.03.007 https://www.wikidata.org/entity/Q57359997 db/journals/jcss/jcss71.html#AlberFFFNRS05

Vladimir Estivill-Castro Michael R. Fellows Michael A. Langston Frances A. Rosamond FPT is P-Time Extremal Structure I. 1-41 2005 conf/acid/2005 ACiD db/conf/acid/acid2005.html#Estivill-CastroFLR05 Frank K. H. A. Dehne Michael R. Fellows Michael A. Langston Frances A. Rosamond Kim Stevens An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. 859-869 2005 conf/cocoon/2005 COCOON https://doi.org/10.1007/11533719_87 db/conf/cocoon/cocoon2005.html#DehneFLRS05

Michael R. Fellows Frances A. Rosamond Udi Rotics Stefan Szeider Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electron. Colloquium Comput. Complex. 2005 TR05 TR05-080 db/journals/eccc/eccc12.html#TR05-080 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-080/index.html

Michael R. Fellows Frances A. Rosamond Udi Rotics Stefan Szeider Proving NP-hardness for clique-width II: non-approximability of clique-width Electron. Colloquium Comput. Complex. 2005 TR05 TR05-081 db/journals/eccc/eccc12.html#TR05-081 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-081/index.html

Jochen Alber Michael R. Fellows Rolf Niedermeier Polynomial-time data reduction for dominating set. 363-384 2004 51 J. ACM 3 https://doi.org/10.1145/990308.990309 https://www.wikidata.org/entity/Q57360014 db/journals/jacm/jacm51.html#AlberFN04

John A. Ellis Hongbing Fan Michael R. Fellows The dominating set problem is fixed parameter tractable for graphs of bounded genus. 152-168 2004 52 J. Algorithms 2 https://doi.org/10.1016/j.jalgor.2004.02.001 https://www.wikidata.org/entity/Q57360020 db/journals/jal/jal52.html#EllisFF04

Faisal N. Abu-Khzam Rebecca L. Collins Michael R. Fellows Michael A. Langston W. Henry Suters Christopher T. Symons Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. 62-69 2004 conf/alenex/2004 ALENEX/ANALC db/conf/alenex/alenex2004.html#Abu-KhzamCFLSS04 Jianer Chen Benny Chor Mike Fellows Xiuzhen Huang David W. Juedes Iyad A. Kanj Ge Xia Tight Lower Bounds for Certain Parameterized NP-Hard Problems. 150-160 2004 conf/coco/2004 CCC https://doi.org/10.1109/CCC.2004.1313826 https://doi.ieeecomputersociety.org/10.1109/CCC.2004.1313826 db/conf/coco/coco2004.html#ChenCFHJKX04 Michael R. Fellows A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. 1-2 https://doi.org/10.1007/978-3-540-30140-0_1 2004 conf/esa/2004 ESA db/conf/esa/esa2004.html#Fellows04 Michael R. Fellows Christian Knauer Naomi Nishimura Prabhakar Ragde Frances A. Rosamond Ulrike Stege Dimitrios M. Thilikos Sue Whitesides Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. 311-322 https://doi.org/10.1007/978-3-540-30140-0_29 2004 conf/esa/2004 ESA db/conf/esa/esa2004.html#FellowsKNRRSTW04 Michael R. Fellows Stefan Szeider Graham Wrightson On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. 223-234 https://doi.org/10.1007/978-3-540-28639-4_20 2004 conf/iwpec/2004 IWPEC db/conf/iwpec/iwpec2004.html#FellowsSW04 Frank K. H. A. Dehne Michael R. Fellows Frances A. Rosamond Peter Shaw 0001 Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. 271-280 https://doi.org/10.1007/978-3-540-28639-4_24 2004 conf/iwpec/2004 IWPEC db/conf/iwpec/iwpec2004.html#DehneFRS04 Mike Fellows Pinar Heggernes Frances A. Rosamond Christian Sloper Jan Arne Telle Finding k Disjoint Triangles in an Arbitrary Graph. 235-244 https://doi.org/10.1007/978-3-540-30559-0_20 2004 conf/wg/2004 WG db/conf/wg/wg2004.html#FellowsHRST04 Benny Chor Mike Fellows David W. Juedes Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. 257-269 https://doi.org/10.1007/978-3-540-30559-0_22 2004 conf/wg/2004 WG db/conf/wg/wg2004.html#ChorFJ04 Rodney G. Downey Michael R. Fellows Frank K. H. A. Dehne Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings 3162 3-540-23071-8 IWPEC Lecture Notes in Computer Science Springer 2004 https://doi.org/10.1007/b100584 db/conf/iwpec/iwpec2004.html

Tim Bell 0001 Harold W. Thimbleby Mike Fellows Ian H. Witten Neal Koblitz Matthew Powell Explaining cryptographic systems. 199-215 2003 40 Comput. Educ. 3 https://doi.org/10.1016/S0360-1315(02)00102-1 https://www.wikidata.org/entity/Q57360043 db/journals/ce/ce40.html#BellTFWKP03

Michael R. Fellows Michael T. Hallett Ulrike Stege Analogs & duals of the MAST problem for sequences & trees. 192-216 2003 49 J. Algorithms 1 https://doi.org/10.1016/S0196-6774(03)00081-6 https://www.wikidata.org/entity/Q57360025 db/journals/jal/jal49.html#FellowsHS03

Jianer Chen Michael R. Fellows Foreword from the guest editors. 653 2003 67 J. Comput. Syst. Sci. 4 https://doi.org/10.1016/j.jcss.2003.09.004 https://www.wikidata.org/entity/Q57360038 db/journals/jcss/jcss67.html#ChenF03

Michael R. Fellows Catherine McCartin On the parametric complexity of schedules to minimize tardy tasks. 317-324 2003 2 Theor. Comput. Sci. 298 https://doi.org/10.1016/S0304-3975(02)00811-3 https://www.wikidata.org/entity/Q57360052 db/journals/tcs/tcs298.html#FellowsM03

Hans L. Bodlaender Michael R. Fellows Dimitrios M. Thilikos Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. 239-248 https://doi.org/10.1007/978-3-540-45138-9_18 2003 conf/mfcs/2003 MFCS db/conf/mfcs/mfcs2003.html#BodlaenderFT03 Michael R. Fellows New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. 505-520 https://doi.org/10.1007/978-3-540-45078-8_44 2003 conf/wads/2003 WADS db/conf/wads/wads2003.html#Fellows03 Michael R. Fellows Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. 1-12 https://doi.org/10.1007/978-3-540-39890-5_1 2003 conf/wg/2003 WG db/conf/wg/wg2003.html#Fellows03 Frank K. H. A. Dehne Michael R. Fellows Frances A. Rosamond An FPT Algorithm for Set Splitting. 180-191 https://doi.org/10.1007/978-3-540-39890-5_16 2003 conf/wg/2003 WG db/conf/wg/wg2003.html#DehneFR03 Rodney G. Downey Vladimir Estivill-Castro Michael R. Fellows Elena Prieto-Rodriguez Frances A. Rosamond Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. 2003 conf/cats/2003 CATS https://doi.org/10.1016/S1571-0661(04)81014-4 https://www.wikidata.org/entity/Q57360033 db/journals/entcs/entcs78.html#DowneyEFPR03 209-222 Tim Bell 0001 Ian H. Witten Michael R. Fellows Computer Science Unplugged - an enrichment and extension programme for primary-aged children. I-IV, 1-105 csunplugged.org http://csunplugged.org/ 2002 Michael R. Fellows Jens Gramm Rolf Niedermeier On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. 262-273 2002 conf/stacs/2002 STACS https://doi.org/10.1007/3-540-45841-7_21 db/conf/stacs/stacs2002.html#FellowsGN02 Jochen Alber Michael R. Fellows Rolf Niedermeier Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. 150-159 2002 conf/swat/2002 SWAT https://doi.org/10.1007/3-540-45471-3_16 db/conf/swat/swat2002.html#AlberFN02 John A. Ellis Hongbing Fan Michael R. Fellows The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. 180-189 2002 conf/swat/2002 SWAT https://doi.org/10.1007/3-540-45471-3_19 db/conf/swat/swat2002.html#EllisFF02 Michael R. Fellows Parameterized Complexity: The Main Ideas and Connections to Practical Computing. 2002 conf/cats/2002 CATS https://doi.org/10.1016/S1571-0661(04)00301-9 https://www.wikidata.org/entity/Q57360058 db/journals/entcs/entcs61.html#Fellows02 1-19

Michael R. Fellows Jens Gramm Rolf Niedermeier Parameterized Intractability of Motif Search Problems https://arxiv.org/abs/cs/0205056 2002 CoRR cs.CC/0205056 db/journals/corr/corr0205.html#cs-CC-0205056

Jochen Alber Michael R. Fellows Rolf Niedermeier Polynomial Time Data Reduction for Dominating Set https://arxiv.org/abs/cs/0207066 2002 CoRR cs.DS/0207066 db/journals/corr/corr0207.html#cs-DS-0207066

Rodney G. Downey Michael R. Fellows Index sets and parametric reductions. 329-348 2001 40 Arch. Math. Log. 5 https://doi.org/10.1007/s001530100082 https://www.wikidata.org/entity/Q57360070 db/journals/aml/aml40.html#DowneyF01

Michael J. Dinneen Kevin Cattell Michael R. Fellows Forbidden minors to graphs with small feedback sets. 215-252 2001 230 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(00)00083-2 https://www.wikidata.org/entity/Q57360063 db/journals/dm/dm230.html#DinneenCF01

Vida Dujmovic Michael R. Fellows Michael T. Hallett Matthew Kitching Giuseppe Liotta Catherine McCartin Naomi Nishimura Prabhakar Ragde Frances A. Rosamond Matthew Suderman Sue Whitesides David R. Wood On the Parameterized Complexity of Layered Graph Drawing. 488-499 2001 conf/esa/2001 ESA https://doi.org/10.1007/3-540-44676-1_41 db/conf/esa/esa2001.html#DujmovicFHKLMNRRSWW01 Vida Dujmovic Michael R. Fellows Michael T. Hallett Matthew Kitching Giuseppe Liotta Catherine McCartin Naomi Nishimura Prabhakar Ragde Frances A. Rosamond Matthew Suderman Sue Whitesides David R. Wood A Fixed-Parameter Approach to Two-Layer Planarization. 1-15 2001 conf/gd/2001 GD https://doi.org/10.1007/3-540-45848-4_1 db/conf/gd/gd2001.html#DujmovicFHKLMNRRSWW01 Michael R. Fellows Parameterized Complexity: The Main Ideas and Some Research Frontiers. 291-307 2001 conf/isaac/2001 ISAAC https://doi.org/10.1007/3-540-45678-3_26 https://www.wikidata.org/entity/Q57360076 db/conf/isaac/isaac2001.html#Fellows01 Jochen Alber Hongbing Fan Michael R. Fellows Henning Fernau Rolf Niedermeier Frances A. Rosamond Ulrike Stege Refined Search Tree Technique for DOMINATING SET on Planar Graphs. 111-122 2001 conf/mfcs/2001 MFCS https://doi.org/10.1007/3-540-44683-4_11 db/conf/mfcs/mfcs2001.html#AlberFFFNRS01

Rodney G. Downey Michael R. Fellows Venkatesh Raman 0001 The complexity of irredundant sets parameterized by size. 155-167 2000 100 Discret. Appl. Math. 3 db/journals/dam/dam100.html#DowneyFR00 https://doi.org/10.1016/S0166-218X(99)00185-7

Kevin Cattell Michael J. Dinneen Rodney G. Downey Michael R. Fellows Michael A. Langston On computing graph minor obstruction sets. 107-127 2000 233 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs233.html#CattellDDFL00 https://doi.org/10.1016/S0304-3975(97)00300-9

Hans L. Bodlaender Michael R. Fellows Michael T. Hallett Todd Wareham Tandy J. Warnow The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. 167-188 2000 244 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs244.html#BodlaenderFHWW00 https://doi.org/10.1016/S0304-3975(98)00342-9

Michael R. Fellows Parameterized Complexity: The Main Ideas and Connections to Practical Computing. 51-77 2000 conf/dagstuhl/2000ea Experimental Algorithmics https://doi.org/10.1007/3-540-36383-1_3 db/conf/dagstuhl/ea2000.html#Fellows00 Michael R. Fellows Catherine McCartin Frances A. Rosamond Ulrike Stege Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. 240-251 2000 conf/fsttcs/2000 FSTTCS https://doi.org/10.1007/3-540-44450-5_19 https://www.wikidata.org/entity/Q59442097 db/conf/fsttcs/fsttcs2000.html#FellowsMRS00 Rodney G. Downey Michael R. Fellows Parameterized Complexity 1999 1-437 Springer Monographs in Computer Science 978-1-4612-6798-0 978-1-4612-0515-9 038794883X https://doi.org/10.1007/978-1-4612-0515-9 https://www.worldcat.org/oclc/37004493 https://www.wikidata.org/entity/Q62143179

Rodney G. Downey Michael R. Fellows Ulrike Stege Computational Tractability: The View From Mars. 73-97 1999 69 Bull. EATCS db/journals/eatcs/eatcs69.html#DowneyFS99

Rodney G. Downey Michael R. Fellows Alexander Vardy Geoff Whittle The Parametrized Complexity of Some Fundamental Problems in Coding Theory. 545-570 1999 29 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp29.html#DowneyFVW99 https://doi.org/10.1137/S0097539797323571

R. Balasubramanian Michael R. Fellows Venkatesh Raman 0001 An Improved Fixed-Parameter Algorithm for Vertex Cover. 163-168 1998 65 Inf. Process. Lett. 3 db/journals/ipl/ipl65.html#BalasubramanianFR98 https://doi.org/10.1016/S0020-0190(97)00213-5

Michael R. Fellows Pavol Hell Karen Seyffarth Constructions of large planar networks with given degree and diameter. 275-281 1998 32 Networks 4 https://doi.org/10.1002/(SICI)1097-0037(199812)32:4<275::AID-NET4>3.0.CO;2-G db/journals/networks/networks32.html#FellowsHS98

Rodney G. Downey Michael R. Fellows Kenneth W. Regan Parameterized Circuit Complexity and the W Hierarchy. 97-115 1998 191 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs191.html#DowneyFR98 https://doi.org/10.1016/S0304-3975(96)00317-9

Rodney G. Downey Michael R. Fellows Threshold Dominating Sets and an Improved Characterization of W[2]. 123-140 1998 209 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs209.html#DowneyF98 https://doi.org/10.1016/S0304-3975(97)00101-1

Michael R. Fellows Michael T. Hallett Chantal Korostensky Ulrike Stege Analogs and Duals of the MAST Problem for Sequences and Trees. 103-114 https://doi.org/10.1007/3-540-68530-8_9 1998 conf/esa/1998 ESA db/conf/esa/esa98.html#FellowsHKS98 Michael R. Fellows Michael T. Hallett Ulrike Stege On the Multiple Gene Duplication Problem. 347-356 https://doi.org/10.1007/3-540-49381-6_37 1998 conf/isaac/1998 ISAAC db/conf/isaac/isaac98.html#FellowsHS98

Liming Cai Jianer Chen Rodney G. Downey Michael R. Fellows On the parameterized complexity of short computation and factorization. 321-337 1997 36 Arch. Math. Log. 4-5 https://doi.org/10.1007/s001530050069 db/journals/aml/aml36.html#CaiCDF97

Liming Cai Jianer Chen Rodney G. Downey Michael R. Fellows Advice Classes of Parameterized Tractability. 119-138 1997 84 Ann. Pure Appl. Log. 1 db/journals/apal/apal84.html#CaiCDF97 https://doi.org/10.1016/S0168-0072(95)00020-8

Bruno Courcelle Rodney G. Downey Michael R. Fellows A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. 1194-1198 1997 3 J. Univers. Comput. Sci. 11 db/journals/jucs/jucs3.html#CourcelleDF97 https://doi.org/10.3217/jucs-003-11-1194

Rodney G. Downey Michael R. Fellows Ulrike Stege Parameterized complexity: A framework for systematically confronting computational intractability. 49-99 1997 Contemporary Trends in Discrete Mathematics conf/dimacs/dimacs49 db/conf/dimacs/dimacs49.html#DowneyFS97 https://doi.org/10.1090/dimacs/049/04

Marco Cesati Michael R. Fellows Sparse Parameterized Problems. 1-15 1996 82 Ann. Pure Appl. Log. 1 db/journals/apal/apal82.html#CesatiF96 https://doi.org/10.1016/0168-0072(95)00069-0 https://www.wikidata.org/entity/Q57360100

Kevin Cattell Michael J. Dinneen Michael R. Fellows A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. 197-203 1996 57 Inf. Process. Lett. 4 db/journals/ipl/ipl57.html#CattellDF96 https://doi.org/10.1016/0020-0190(95)00190-5 https://www.wikidata.org/entity/Q57360096

Noga Alon Michael R. Fellows Donovan R. Hare Vertex transversals that dominate. 21-31 1996 21 J. Graph Theory 1 https://doi.org/10.1002/(SICI)1097-0118(199601)21:1<21::AID-JGT3>3.0.CO;2-O db/journals/jgt/jgt21.html#AlonFH96

Hans L. Bodlaender Michael R. Fellows Patricia A. Evans Finite-State Computability of Annotations of Strings and Trees. 384-391 1996 conf/cpm/1996 CPM db/conf/cpm/cpm96.html#BodlaenderFE96 https://doi.org/10.1007/3-540-61258-0_28 https://www.wikidata.org/entity/Q59567979 Rodney G. Downey Michael R. Fellows Kenneth W. Regan Descriptive complexity and the W hierarchy. 119-134 1996 Proof Complexity and Feasible Arithmetics conf/dimacs/dimacs39 db/conf/dimacs/dimacs39.html#DowneyFR96 https://doi.org/10.1090/dimacs/039/07 Rodney G. Downey Michael R. Fellows Udayan Taylor The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]. 194-213 1996 DMTCS conf/dmtcs/1996 db/conf/dmtcs/dmtcs1996.html#DowneyFT96

Michael R. Fellows Jan Kratochvíl Matthias Middendorf Frank Pfeiffer The Complexity of Induced Minors and Related Problems. 266-282 1995 13 Algorithmica 3 db/journals/algorithmica/algorithmica13.html#FellowsKMP95 https://doi.org/10.1007/BF01190507

Karl R. Abrahamson Rodney G. Downey Michael R. Fellows Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. 235-276 1995 73 Ann. Pure Appl. Log. 3 db/journals/apal/apal73.html#AbrahamsonDF95 https://doi.org/10.1016/0168-0072(94)00034-Z https://www.wikidata.org/entity/Q56620260

Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Michael T. Hallett Harold T. Wareham Parameterized complexity analysis in computational biology. 49-57 1995 11 Comput. Appl. Biosci. 1 db/journals/bioinformatics/bioinformatics11.html#BodlaenderDFHW95 https://doi.org/10.1093/bioinformatics/11.1.49 https://www.wikidata.org/entity/Q59567988

Michael R. Fellows Pavol Hell Karen Seyffarth Large Planar Graphs with Given Diameter and Maximum Degree. 133-153 1995 61 Discret. Appl. Math. 2 https://doi.org/10.1016/0166-218X(94)00011-2 https://www.wikidata.org/entity/Q57360113 db/journals/dam/dam61.html#FellowsHS95

Liming Cai Jianer Chen Rodney G. Downey Michael R. Fellows On the Structure of Parameterized Problems in NP. 38-49 1995 123 Inf. Comput. 1 db/journals/iandc/iandc123.html#CaiCDF95 https://doi.org/10.1006/inco.1995.1156 https://www.wikidata.org/entity/Q57360120

Hans L. Bodlaender Michael R. Fellows W[2]-hardness of precedence constrained K-processor scheduling. 93-97 1995 18 Oper. Res. Lett. 2 https://doi.org/10.1016/0167-6377(95)00031-9 https://www.wikidata.org/entity/Q59567993 db/journals/orl/orl18.html#BodlaenderF95

Rodney G. Downey Michael R. Fellows Fixed-Parameter Tractability and Completeness I: Basic Results. 873-921 1995 24 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp24.html#DowneyF95 https://doi.org/10.1137/S0097539792228228 https://www.wikidata.org/entity/Q56620258

Rodney G. Downey Michael R. Fellows Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. 109-131 1995 141 Theor. Comput. Sci. 1&2 db/journals/tcs/tcs141.html#DowneyF95 https://doi.org/10.1016/0304-3975(94)00097-3 https://www.wikidata.org/entity/Q55891725

Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Harold T. Wareham The Parameterized Complexity of Sequence Alignment and Consensus. 31-54 1995 147 Theor. Comput. Sci. 1&2 db/journals/tcs/tcs147.html#BodlaenderDFW95 https://doi.org/10.1016/0304-3975(94)00251-D https://www.wikidata.org/entity/Q57360127

Kevin Cattell Michael J. Dinneen Michael R. Fellows Obstructions to Within a Few Vertices or Edges of Acyclic. 415-427 1995 conf/wads/1995 WADS db/conf/wads/wads95.html#CattellDF95 https://doi.org/10.1007/3-540-60220-8_81

Michael R. Fellows Michael A. Langston On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. 769-779 1994 49 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss49.html#FellowsL94 https://doi.org/10.1016/S0022-0000(05)80079-0 https://www.wikidata.org/entity/Q57360134

Michael R. Fellows Gerd Fricke Stephen T. Hedetniemi David Pokrass Jacobs The Private Neighbor Cube. 41-47 1994 7 SIAM J. Discret. Math. 1 https://doi.org/10.1137/S0895480191199026 db/journals/siamdm/siamdm7.html#FellowsFHJ94

Hans L. Bodlaender Rodney G. Downey Michael R. Fellows Harold T. Wareham The Parameterized Complexity of Sequence Alignment and Consensus. 15-30 1994 conf/cpm/1994 CPM db/conf/cpm/cpm94.html#BodlaenderDFW94 https://doi.org/10.1007/3-540-58094-8_2 Bruce M. Kapron Michael R. Fellows Rodney G. Downey Michael T. Hallett Harold T. Wareham The Parameterized Complexity of Some Problems in Logic and Linguistics. 89-100 1994 conf/lfcs/1994 LFCS db/conf/lfcs/lfcs1994.html#HallettW94 https://doi.org/10.1007/3-540-58140-5_10 Liming Cai Jianer Chen Rodney G. Downey Michael R. Fellows On the Structure of Parameterized Problems in NP (Extended Abstract). 509-520 1994 conf/stacs/1994 STACS db/conf/stacs/stacs94.html#CaiCDF94 https://doi.org/10.1007/3-540-57785-8_167 Hans L. Bodlaender Michael R. Fellows Michael T. Hallett Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. 449-458 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195229 https://www.wikidata.org/entity/Q59567994 db/conf/stoc/stoc1994.html#BodlaenderFH94 Michael R. Fellows Neal Koblitz Fixed-Parameter Complexity and Cryptography. 121-131 1993 conf/aaecc/1993 AAECC db/conf/aaecc/aaecc1993.html#FellowsK93 https://doi.org/10.1007/3-540-56686-4_38 Rodney G. Downey Patricia A. Evans Michael R. Fellows Parameterized Learning Complexity. 51-57 1993 conf/colt/1993 COLT https://doi.org/10.1145/168304.168311 db/conf/colt/colt1993.html#DowneyEF93 Michael R. Fellows Michael T. Hallett Harold T. Wareham DNA Physical Mapping: Three Ways Difficult. 157-168 1993 conf/esa/1993 ESA db/conf/esa/esa93.html#FellowsHW93 https://doi.org/10.1007/3-540-57273-2_52 Karl R. Abrahamson Rodney G. Downey Michael R. Fellows Fixed-Parameter Intractability II (Extended Abstract). 374-385 1993 conf/stacs/1993 STACS db/conf/stacs/stacs93.html#AbrahamsonDF93 https://doi.org/10.1007/3-540-56503-5_38

Michael R. Fellows Neal Koblitz Self-Witnessing Polynomial-Time Complexity and Prime Factorization. 231-235 1992 2 Des. Codes Cryptogr. 3 db/journals/dcc/dcc2.html#FellowsK92 https://doi.org/10.1007/BF00141967 https://www.wikidata.org/entity/Q57360143

Michael R. Fellows Michael A. Langston On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. 117-126 1992 5 SIAM J. Discret. Math. 1 db/journals/siamdm/siamdm5.html#FellowsL92 https://doi.org/10.1137/0405010

Lowell Campbell Gunnar E. Carlsson Michael J. Dinneen Vance Faber Michael R. Fellows Michael A. Langston James W. Moore Andrew P. Mullhaupt Harlan B. Sexton Small Diameter Symmetric Networks from Linear Groups. 218-220 1992 41 IEEE Trans. Computers 2 db/journals/tc/tc41.html#CampbellCDFFLMMS92 https://doi.org/10.1109/12.123397 http://doi.ieeecomputersociety.org/10.1109/12.123397 https://www.wikidata.org/entity/Q57360148

Rodney G. Downey Michael R. Fellows Fixed-Parameter Intractability. 36-49 1992 conf/coco/1992 SCT db/conf/coco/coco92.html#DowneyF92 https://doi.org/10.1109/SCT.1992.215379 https://doi.ieeecomputersociety.org/10.1109/SCT.1992.215379 Michael R. Fellows Neal Koblitz Self-Witnessing Polynomial-Time Complexity and Prime Factorization. 107-110 1992 conf/coco/1992 SCT db/conf/coco/coco92.html#FellowsK92 https://doi.org/10.1109/SCT.1992.215385 https://doi.ieeecomputersociety.org/10.1109/SCT.1992.215385 Michael R. Fellows Neal Koblitz Kid Krypto. 371-389 https://doi.org/10.1007/3-540-48071-4_27 1992 conf/crypto/1992 CRYPTO db/conf/crypto/crypto92.html#FellowsK92 Rodney G. Downey Michael R. Fellows Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy. 191-225 1992 conf/dagstuhl/1992complexity Complexity Theory: Current Research db/conf/dagstuhl/complexity1992.html#DowneyF92 Nancy Casey Michael R. Fellows Implementing the Standards: Let's Focus on the First Four. 1992 Discrete Mathematics in the Schools conf/dimacs/dimacs36 db/conf/dimacs/dimacs36.html#CaseyF92 https://doi.org/10.1090/dimacs/036/06 51-65 Hans L. Bodlaender Michael R. Fellows Tandy J. Warnow Two Strikes Against Perfect Phylogeny. 273-283 1992 conf/icalp/1992 ICALP db/conf/icalp/icalp92.html#BodlaenderFW92 https://doi.org/10.1007/3-540-55719-9_80 https://www.wikidata.org/entity/Q56430104 Karl R. Abrahamson Michael R. Fellows Christopher B. Wilson Parallel Self-Reducibility. 67-70 1992 conf/icci/1992 ICCI db/conf/icci/icci1992.html#AbrahamsonFW92 S. Rao Kosaraju Mike Fellows Avi Wigderson John A. Ellis Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada STOC ACM 1992 978-0-89791-511-3 https://doi.org/10.1145/129712 db/conf/stoc/stoc92.html

Michael R. Fellows Mark N. Hoover Perfect domination. 141-150 1991 3 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/3/ocr-ajc-v3-p141.pdf db/journals/ajc/ajc3.html#FellowsH91

James Abello Michael R. Fellows John Stillwell On the complexity and combinatorics of covering finite complexes. 103-112 1991 4 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/4/ocr-ajc-v4-p103.pdf db/journals/ajc/ajc4.html#AbelloFS91

Karl R. Abrahamson Michael R. Fellows Michael A. Langston Bernard M. E. Moret Constructive complexity. 3-16 1991 34 Discret. Appl. Math. 1-3 https://doi.org/10.1016/0166-218X(91)90074-7 https://www.wikidata.org/entity/Q57360155 db/journals/dam/dam34.html#AbrahamsonFLM91

Michael R. Fellows Michael A. Langston Fast search algorithms for layout permutation problems. 321-337 1991 12 Integr. 3 https://doi.org/10.1016/0167-9260(91)90028-J https://www.wikidata.org/entity/Q57360160 db/journals/integration/integration12.html#FellowsL91

Michael J. Dinneen Michael R. Fellows Vance Faber Algebraic Constructions of Efficient Broadcast Networks. 152-158 1991 conf/aaecc/1991 AAECC db/conf/aaecc/aaecc1991.html#DinneenFF91 https://doi.org/10.1007/3-540-54522-0_104 Michael R. Fellows Michael A. Langston Constructivity Issues in Graph Algorithms. 150-158 1991 conf/constructivity/1991 Constructivity in Computer Science db/conf/constructivity/constructivity1991.html#FellowsL91 https://doi.org/10.1007/BFb0021088 Michael R. Fellows Jan Kratochvíl Matthias Middendorf Frank Pfeiffer Induced minors and related problems. 179-182 1991 conf/gst/1991 Graph Structure Theory db/conf/gst/gst1991.html#FellowsKMP91 Karl R. Abrahamson Michael R. Fellows Finite automata, bounded treewidth, and well-quasiordering. 539-563 1991 conf/gst/1991 Graph Structure Theory db/conf/gst/gst1991.html#AbrahamsonF91

Michael R. Fellows Transversals of Vertex Partitions in Graphs. 206-215 1990 3 SIAM J. Discret. Math. 2 db/journals/siamdm/siamdm3.html#Fellows90 https://doi.org/10.1137/0403018 https://www.wikidata.org/entity/Q56390835

Daniel J. Kleitman Michael R. Fellows Radius and diameter in Manhattan lattices. 119-125 1989 73 Discret. Math. 1-2 https://doi.org/10.1016/0012-365X(88)90139-2 https://www.wikidata.org/entity/Q57360192 db/journals/dm/dm73.html#KleitmanF89

Michael R. Fellows Nancy G. Kinnersley Michael A. Langston Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation. 37-45 1989 Computers and Mathematics https://doi.org/10.1007/978-1-4613-9647-5_5 conf/cm/1989 db/conf/cm/cm1989.html#FellowsKL89 On the Complexity of Fixed Parameter Problems (Extended Abstract) Karl R. Abrahamson John A. Ellis Michael R. Fellows Manuel E. Mata 210-215 conf/focs/FOCS30 1989 FOCS db/conf/focs/focs89.html#AbrahamsonEFM89 https://doi.org/10.1109/SFCS.1989.63480 https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63480 An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) Michael R. Fellows Michael A. Langston 520-525 conf/focs/FOCS30 1989 FOCS db/conf/focs/focs89.html#FellowsL89 https://doi.org/10.1109/SFCS.1989.63528 https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63528 On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) Michael R. Fellows Michael A. Langston 501-512 conf/stoc/STOC21 1989 STOC db/conf/stoc/stoc89.html#FellowsL89 https://doi.org/10.1145/73007.73055

Michael R. Fellows Donald K. Friesen Michael A. Langston On Finding Optimal and Near-Optimal Lineal Spanning Trees. 549-560 1988 3 Algorithmica db/journals/algorithmica/algorithmica3.html#FellowsFL88 https://doi.org/10.1007/BF01762131 https://www.wikidata.org/entity/Q57360176

Michael R. Fellows Michael A. Langston Nonconstructive tools for proving polynomial-time decidability. 727-739 1988 35 J. ACM 3 https://doi.org/10.1145/44483.44491 https://www.wikidata.org/entity/Q55881135 db/journals/jacm/jacm35.html#FellowsL88

Michael R. Fellows Michael A. Langston Processor Utilization in a Linearly Connected Parallel Processing System. 594-603 1988 37 IEEE Trans. Computers 5 db/journals/tc/tc37.html#FellowsL88 https://doi.org/10.1109/12.4610 http://doi.ieeecomputersociety.org/10.1109/12.4610 https://www.wikidata.org/entity/Q57360186

Michael R. Fellows Michael A. Langston Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. 278-287 1988 conf/awoc/1988 AWOC db/conf/awoc/awoc88.html#FellowsL88 https://doi.org/10.1007/BFb0040395

Michael R. Fellows Michael A. Langston Nonconstructive Advances in Polynomial-Time Complexity. 155-162 1987 26 Inf. Process. Lett. 3 db/journals/ipl/ipl26.html#FellowsL87 https://doi.org/10.1016/0020-0190(87)90054-8 https://www.wikidata.org/entity/Q57360197

James Abello Karl R. Abrahamson Faisal N. Abu-Khzam Deepak Ajwani Jochen Alber Noga Alon R. Balasubramanian Julien Baste Cristina Bazgan Timothy C. BellTim Bell 0001 Matthias Bentert Benjamin Bergougnoux Nadja Betzler René van Bevern Rob H. Bisseling Nello Blaser Hans L. Bodlaender Leo Brueggeman Laurent Bulteau Benjamin Merlin Bumpus Kevin Burrage Liming Cai Lowell Campbell Gunnar E. Carlsson Katrin Casel Nancy Casey Ümit V. Çatalyürek Kevin Cattell Marco Cesati Jianer Chen Zhi-Zhong Chen Cédric Chevalier Morgan Chopin Benny Chor Florian Chudigiewitsch Rebecca L. Collins Bruno Courcelle Robert Crowston Marek Cygan Adam R. Day Frank DehneFrank K. H. A. Dehne Stephan Diehl 0001 Michael J. Dinneen Michael Dom Rodney G. DowneyRod Downey Vida Dujmovic Tala Eagling-Vose Judith Egan John A. Ellis Rosa Enciso Jessica A. Enright Gábor Erdélyi Vladimir Estivill-Castro Patricia A. Evans Vance Faber Hongbing Fan Marcelo Fonseca Faraj Henning Fernau Guillaume Fertin Rudolf Fleischer Jörg Flum Fedor V. Fomin Gerd Fricke Tobias Friedrich 0001 Donald K. Friesen Bin Fu Serge Gaspers Panos Giannopoulos Petr A. Golovach Lars Gottesbüren Jens Gramm Noam Greenberg Mario Grobler Jiong Guo Gregory Z. Gutin Michael T. Hallett Donovan R. Hare Tzvika Hartman Stephen T. Hedetniemi Pinar Heggernes Pavol Hell Danny Hermelin Tobias Heuer Mark N. Hoover Xiuzhen Huang David Pokrass Jacobs Lars Jaffke Bart M. P. Jansen Haitao Jiang 0005 Mark Jones 0001 David W. Juedes Iyad KanjIyad A. Kanj Bruce M. Kapron George Karypis Kamer Kaya Bakhadyr Khoussainov Eun Jung Kim 0002 Nancy G. Kinnersley Aliz Izabella Király Matthew Kitching Daniel J. Kleitman Christian Knauer Neal Koblitz Christian Komusiewicz Chantal Korostensky S. Rao Kosaraju Ioannis KoutisYiannis Koutis Jan Kratochvíl Ariel Kulik David C. Kutner Jakub Lacki Martin Lackner Gad M. Landau Johannes Langguth Michael A. Langston Laura Larios-Jones Erik Jan van Leeuwen Xiaoye S. LiXiaoye Sherry Li Giuseppe Liotta Yang Liu 0002 Daniel Lokshtanov Elena Losievskaja Shev MacNamaraShev Mac Federico Mancini 0001 Barnaby Martin Dániel Marx Tomás Masarík Manuel E. Mata Ruben Mayer Catherine McCartin Nicole Megow Johannes Meintrup Daniel Meister 0001 Alexander G. Melnikov Matthias Middendorf Neeldhara Misra Yosuke Mizutani Matthias Mnich James W. Moore Bernard M. E. Moret Hannes Moser Amer E. Mouawad Moritz MuellerMoritz Müller Andrew P. Mullhaupt Nina Narodytska Rolf Niedermeier Naomi Nishimura Mateus de Oliveira Oliveira Charis Papadopoulos Christophe Paul François Pellegrini Fabrizio Petrini Andreas Pfandler Frank Pfeiffer Geevarghese Philip Matthew Powell Elena Prieto-Rodriguez Fábio Protti Mark A. Ragan Prabhakar Ragde Venkatesh Raman 0001 Igor Razgon Kenneth W. Regan Frances A. RosamondFran Rosamond Jörg Rothe Udi Rotics Liat Rozenberg Stefan Rümmele Imre Z. Ruzsa Ilya Safro Emmanuel Sam Saket Saurabh 0001 Lena SchendLena Piras Sebastian Schlag Daniel Schmand Christian Schulz 0003 Harlan B. Sexton Karen Seyffarth Hadas Shachnai Roohani Sharma Peter Shaw 0001 Sebastian Siebertz Somnath Sikdar Maise Dantas da Silva Christian Sloper Sagi Snir Uéverton S. SouzaUéverton dos Santos Souza R. Sritharan Ulrike Stege Kim Stevens John Stillwell Darren Strash Ondrej Suchý 0001 Matthew Suderman Blair D. Sullivan W. Henry Suters Christopher T. Symons Stefan Szeider Xuehou Tan Udayan Taylor Jan Arne Telle Dimitrios M. Thilikos Harold W. Thimbleby Stéphan Thomassé Carsten Thomassen Bora Uçar Johannes Uhlmann Alexander Vardy Stéphane Vialette R. VijayaragunathanVijayaragunathan Ramamoorthi Yngve Villanger Lusheng Wang 0001 Todd WarehamHarold T. Wareham Tandy J. Warnow Mathias Weller Mark Weyer Sue Whitesides Geoff Whittle Avi Wigderson Christopher B. Wilson Ian H. Witten David R. Wood Graham Wrightson Ge Xia Ella Yates Anders Yeo Nathan Yu Albert-Jan Nicholas YzelmanAlbert-Jan Yzelman Binhai Zhu