Nonconstructive Advances in Polynomial-Time Complexity. - Michael R. Fellows; Michael A. Langston (Inf. Process. Lett., 1987)

Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. - Michael R. Fellows; Michael A. Langston (AWOC, 1988)

On Finding Optimal and Near-Optimal Lineal Spanning Trees. - Michael R. Fellows; Donald K. Friesen; Michael A. Langston (Algorithmica, 1988)

Nonconstructive tools for proving polynomial-time decidability. - Michael R. Fellows; Michael A. Langston (J. ACM, 1988)

Processor Utilization in a Linearly Connected Parallel Processing System. - Michael R. Fellows; Michael A. Langston (IEEE Trans. Computers, 1988)

Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation. - Michael R. Fellows; Nancy G. Kinnersley; Michael A. Langston (Computers and Mathematics, 1989)

On the Complexity of Fixed Parameter Problems (Extended Abstract) - Karl R. Abrahamson; John A. Ellis; Michael R. Fellows; Manuel E. Mata (FOCS, 1989)

An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) - Michael R. Fellows; Michael A. Langston (FOCS, 1989)

On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) - Michael R. Fellows; Michael A. Langston (STOC, 1989)

Radius and diameter in Manhattan lattices. - Daniel J. Kleitman; Michael R. Fellows (Discret. Math., 1989)

Transversals of Vertex Partitions in Graphs. - Michael R. Fellows (SIAM J. Discret. Math., 1990)

Algebraic Constructions of Efficient Broadcast Networks. - Michael J. Dinneen; Michael R. Fellows; Vance Faber (AAECC, 1991)

Constructivity Issues in Graph Algorithms. - Michael R. Fellows; Michael A. Langston (Constructivity in Computer Science, 1991)

Finite automata, bounded treewidth, and well-quasiordering. - Karl R. Abrahamson; Michael R. Fellows (Graph Structure Theory, 1991)

Induced minors and related problems. - Michael R. Fellows; Jan Kratochvíl; Matthias Middendorf; Frank Pfeiffer (Graph Structure Theory, 1991)

On the complexity and combinatorics of covering finite complexes. - James Abello; Michael R. Fellows; John Stillwell (Australas. J Comb., 1991)

Perfect domination. - Michael R. Fellows; Mark N. Hoover (Australas. J Comb., 1991)

Constructive complexity. - Karl R. Abrahamson; Michael R. Fellows; Michael A. Langston; Bernard M. E. Moret (Discret. Appl. Math., 1991)

Fast search algorithms for layout permutation problems. - Michael R. Fellows; Michael A. Langston (Integr., 1991)

Fixed-Parameter Intractability. - Rodney G. Downey; Michael R. Fellows (SCT, 1992)

Kid Krypto. - Michael R. Fellows; Neal Koblitz (CRYPTO, 1992)

Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy. - Rodney G. Downey; Michael R. Fellows (Complexity Theory: Current Research, 1992)

Implementing the Standards: Let's Focus on the First Four. - Nancy Casey; Michael R. Fellows (Discrete Mathematics in the Schools, 1992)

Two Strikes Against Perfect Phylogeny. - Hans L. Bodlaender; Michael R. Fellows; Tandy J. Warnow (ICALP, 1992)

Parallel Self-Reducibility. - Karl R. Abrahamson; Michael R. Fellows; Christopher B. Wilson (ICCI, 1992)

Self-Witnessing Polynomial-Time Complexity and Prime Factorization. - Michael R. Fellows; Neal Koblitz (Des. Codes Cryptogr., 1992)

On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. - Michael R. Fellows; Michael A. Langston (SIAM J. Discret. Math., 1992)

Small Diameter Symmetric Networks from Linear Groups. - 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 (IEEE Trans. Computers, 1992)

Fixed-Parameter Complexity and Cryptography. - Michael R. Fellows; Neal Koblitz (AAECC, 1993)

Parameterized Learning Complexity. - Rodney G. Downey; Patricia A. Evans; Michael R. Fellows (COLT, 1993)

DNA Physical Mapping: Three Ways Difficult. - Michael R. Fellows; Michael T. Hallett; Harold T. Wareham (ESA, 1993)

Fixed-Parameter Intractability II (Extended Abstract). - Karl R. Abrahamson; Rodney G. Downey; Michael R. Fellows (STACS, 1993)

The Parameterized Complexity of Some Problems in Logic and Linguistics. - Bruce M. Kapron; Michael R. Fellows; Rodney G. Downey; Michael T. Hallett; Harold T. Wareham (LFCS, 1994)

On the Structure of Parameterized Problems in NP (Extended Abstract). - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (STACS, 1994)

Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. - Hans L. Bodlaender; Michael R. Fellows; Michael T. Hallett (STOC, 1994)

On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. - Michael R. Fellows; Michael A. Langston (J. Comput. Syst. Sci., 1994)

The Private Neighbor Cube. - Michael R. Fellows; Gerd Fricke; Stephen T. Hedetniemi; David Pokrass Jacobs (SIAM J. Discret. Math., 1994)

Obstructions to Within a Few Vertices or Edges of Acyclic. - Kevin Cattell; Michael J. Dinneen; Michael R. Fellows (WADS, 1995)

The Complexity of Induced Minors and Related Problems. - Michael R. Fellows; Jan Kratochvíl; Matthias Middendorf; Frank Pfeiffer (Algorithmica, 1995)

Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. - Karl R. Abrahamson; Rodney G. Downey; Michael R. Fellows (Ann. Pure Appl. Log., 1995)

Parameterized complexity analysis in computational biology. - Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Michael T. Hallett; Harold T. Wareham (Comput. Appl. Biosci., 1995)

Large Planar Graphs with Given Diameter and Maximum Degree. - Michael R. Fellows; Pavol Hell; Karen Seyffarth (Discret. Appl. Math., 1995)

On the Structure of Parameterized Problems in NP. - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (Inf. Comput., 1995)

W[2]-hardness of precedence constrained K-processor scheduling. - Hans L. Bodlaender; Michael R. Fellows (Oper. Res. Lett., 1995)

Fixed-Parameter Tractability and Completeness I: Basic Results. - Rodney G. Downey; Michael R. Fellows (SIAM J. Comput., 1995)

The Parameterized Complexity of Sequence Alignment and Consensus. - Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Harold T. Wareham (Theor. Comput. Sci., 1995)

Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. - Rodney G. Downey; Michael R. Fellows (Theor. Comput. Sci., 1995)

Finite-State Computability of Annotations of Strings and Trees. - Hans L. Bodlaender; Michael R. Fellows; Patricia A. Evans (CPM, 1996)

Descriptive complexity and the W hierarchy. - Rodney G. Downey; Michael R. Fellows; Kenneth W. Regan (Proof Complexity and Feasible Arithmetics, 1996)

The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]. - Rodney G. Downey; Michael R. Fellows; Udayan Taylor (DMTCS, 1996)

Sparse Parameterized Problems. - Marco Cesati; Michael R. Fellows (Ann. Pure Appl. Log., 1996)

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. - Kevin Cattell; Michael J. Dinneen; Michael R. Fellows (Inf. Process. Lett., 1996)

Vertex transversals that dominate. - Noga Alon; Michael R. Fellows; Donovan R. Hare (J. Graph Theory, 1996)

Parameterized complexity: A framework for systematically confronting computational intractability. - Rodney G. Downey; Michael R. Fellows; Ulrike Stege (Contemporary Trends in Discrete Mathematics, 1997)

On the parameterized complexity of short computation and factorization. - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (Arch. Math. Log., 1997)

Advice Classes of Parameterized Tractability. - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (Ann. Pure Appl. Log., 1997)

A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. - Bruno Courcelle; Rodney G. Downey; Michael R. Fellows (J. Univers. Comput. Sci., 1997)

Analogs and Duals of the MAST Problem for Sequences and Trees. - Michael R. Fellows; Michael T. Hallett; Chantal Korostensky; Ulrike Stege (ESA, 1998)

On the Multiple Gene Duplication Problem. - Michael R. Fellows; Michael T. Hallett; Ulrike Stege (ISAAC, 1998)

An Improved Fixed-Parameter Algorithm for Vertex Cover. - R. Balasubramanian; Michael R. Fellows; Venkatesh Raman 001 (Inf. Process. Lett., 1998)

Constructions of large planar networks with given degree and diameter. - Michael R. Fellows; Pavol Hell; Karen Seyffarth (Networks, 1998)

Threshold Dominating Sets and an Improved Characterization of W[2]. - Rodney G. Downey; Michael R. Fellows (Theor. Comput. Sci., 1998)

Parameterized Circuit Complexity and the W Hierarchy. - Rodney G. Downey; Michael R. Fellows; Kenneth W. Regan (Theor. Comput. Sci., 1998)

Computational Tractability: The View From Mars. - Rodney G. Downey; Michael R. Fellows; Ulrike Stege (Bull. EATCS, 1999)

The Parametrized Complexity of Some Fundamental Problems in Coding Theory. - Rodney G. Downey; Michael R. Fellows; Alexander Vardy; Geoff Whittle (SIAM J. Comput., 1999)

Parameterized Complexity - Rodney G. Downey; Michael R. Fellows (Springer, 1999)

Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. - Michael R. Fellows; Catherine McCartin; Frances A. Rosamond; Ulrike Stege (FSTTCS, 2000)

The complexity of irredundant sets parameterized by size. - Rodney G. Downey; Michael R. Fellows; Venkatesh Raman 001 (Discret. Appl. Math., 2000)

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. - Hans L. Bodlaender; Michael R. Fellows; Michael T. Hallett; Todd Wareham; Tandy J. Warnow (Theor. Comput. Sci., 2000)

On computing graph minor obstruction sets. - Kevin Cattell; Michael J. Dinneen; Rodney G. Downey; Michael R. Fellows; Michael A. Langston (Theor. Comput. Sci., 2000)

On the Parameterized Complexity of Layered Graph Drawing. - 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 (ESA, 2001)

A Fixed-Parameter Approach to Two-Layer Planarization. - 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 (GD, 2001)

Parameterized Complexity: The Main Ideas and Some Research Frontiers. - Michael R. Fellows (ISAAC, 2001)

Index sets and parametric reductions. - Rodney G. Downey; Michael R. Fellows (Arch. Math. Log., 2001)

Forbidden minors to graphs with small feedback sets. - Michael J. Dinneen; Kevin Cattell; Michael R. Fellows (Discret. Math., 2001)

Computer Science Unplugged - an enrichment and extension programme for primary-aged children. - Tim Bell 001; Ian H. Witten; Michael R. Fellows (csunplugged.org, 2002)

On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. - Michael R. Fellows; Jens Gramm; Rolf Niedermeier (STACS, 2002)

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. - Jochen Alber; Michael R. Fellows; Rolf Niedermeier (SWAT, 2002)

Parameterized Complexity: The Main Ideas and Connections to Practical Computing. - Michael R. Fellows (CATS, 2002)

Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. - Hans L. Bodlaender; Michael R. Fellows; Dimitrios M. Thilikos (MFCS, 2003)

New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. - Michael R. Fellows (WADS, 2003)

An FPT Algorithm for Set Splitting. - Frank K. H. A. Dehne; Michael R. Fellows; Frances A. Rosamond (WG, 2003)

Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. - Michael R. Fellows (WG, 2003)

Explaining cryptographic systems. - Tim Bell 001; Harold W. Thimbleby; Mike Fellows; Ian H. Witten; Neal Koblitz; Matthew Powell (Comput. Educ., 2003)

Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. - Rodney G. Downey; Vladimir Estivill-Castro; Michael R. Fellows; Elena Prieto-Rodriguez; Frances A. Rosamond (CATS, 2003)

Analogs & duals of the MAST problem for sequences & trees. - Michael R. Fellows; Michael T. Hallett; Ulrike Stege (J. Algorithms, 2003)

Foreword from the guest editors. - Jianer Chen; Michael R. Fellows (J. Comput. Syst. Sci., 2003)

On the parametric complexity of schedules to minimize tardy tasks. - Michael R. Fellows; Catherine McCartin (Theor. Comput. Sci., 2003)

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. - Faisal N. Abu-Khzam; Rebecca L. Collins; Michael R. Fellows; Michael A. Langston; W. Henry Suters; Christopher T. Symons (ALENEX/ANALC, 2004)

A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. - Michael R. Fellows (ESA, 2004)

Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. - Frank K. H. A. Dehne; Michael R. Fellows; Frances A. Rosamond; Peter Shaw 001 (IWPEC, 2004)

Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. - Benny Chor; Mike Fellows; David W. Juedes (WG, 2004)

Finding k Disjoint Triangles in an Arbitrary Graph. - Mike Fellows; Pinar Heggernes; Frances A. Rosamond; Christian Sloper; Jan Arne Telle (WG, 2004)

Polynomial-time data reduction for dominating set. - Jochen Alber; Michael R. Fellows; Rolf Niedermeier (J. ACM, 2004)

The dominating set problem is fixed parameter tractable for graphs of bounded genus. - John A. Ellis; Hongbing Fan; Michael R. Fellows (J. Algorithms, 2004)

FPT is P-Time Extremal Structure I. - Vladimir Estivill-Castro; Michael R. Fellows; Michael A. Langston; Frances A. Rosamond (ACiD, 2005)

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (Electron. Colloquium Comput. Complex., 2005)

Proving NP-hardness for clique-width II: non-approximability of clique-width - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (Electron. Colloquium Comput. Complex., 2005)

Tight lower bounds for certain parameterized NP-hard problems. - Jianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David W. Juedes; Iyad A. Kanj; Ge Xia (Inf. Comput., 2005)

A refined search tree technique for Dominating Set on planar graphs. - Jochen Alber; Hongbing Fan; Michael R. Fellows; Henning Fernau; Rolf Niedermeier; Frances A. Rosamond; Ulrike Stege (J. Comput. Syst. Sci., 2005)

Kernelization for Convex Recoloring. - Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Frances A. Rosamond; Mark Weyer (ACiD, 2006)

The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. - Kevin Burrage; Vladimir Estivill-Castro; Michael R. Fellows; Michael A. Langston; Shev Mac; Frances A. Rosamond (IWPEC, 2006)

Parameterized Approximation Problems. - Rodney G. Downey; Michael R. Fellows; Catherine McCartin (IWPEC, 2006)

The Lost Continent of Polynomial Time: Preprocessing and Kernelization. - Michael R. Fellows (IWPEC, 2006)

NONBLOCKER: Parameterized Algorithmics for minimum dominating set. - Frank K. H. A. Dehne; Michael R. Fellows; Henning Fernau; Elena Prieto-Rodriguez; Frances A. Rosamond (SOFSEM, 2006)

Clique-width minimization is NP-hard. - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (STOC, 2006)

A Fixed-Parameter Approach to 2-Layer Planarization. - 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 (Algorithmica, 2006)

On The Parameterized Intractability Of Motif Search Problems. - Michael R. Fellows; Jens Gramm; Rolf Niedermeier (Comb., 2006)

On finding short resolution refutations and small unsatisfiable subsets. - Michael R. Fellows; Stefan Szeider; Graham Wrightson (Theor. Comput. Sci., 2006)

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. - Michael R. Fellows; Frances A. Rosamond (CiE, 2007)

Connected Coloring Completion for General Graphs: Algorithms and Complexity. - Benny Chor; Michael R. Fellows; Mark A. Ragan; Igor Razgon; Frances A. Rosamond; Sagi Snir (COCOON, 2007)

Efficient Parameterized Preprocessing for Cluster Editing. - Michael R. Fellows; Michael A. Langston; Frances A. Rosamond; Peter Shaw 001 (FCT, 2007)

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. - Michael R. Fellows; Guillaume Fertin; Danny Hermelin; Stéphane Vialette (ICALP, 2007)

Crown Structures for Vertex Cover Kernelization. - Faisal N. Abu-Khzam; Michael R. Fellows; Michael A. Langston; W. Henry Suters (Theory Comput. Syst., 2007)

The Complexity of Polynomial-Time Approximation. - Liming Cai; Michael R. Fellows; David W. Juedes; Frances A. Rosamond (Theory Comput. Syst., 2007)

An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. - Frank K. H. A. Dehne; Michael R. Fellows; Michael A. Langston; Frances A. Rosamond; Kim Stevens (Theory Comput. Syst., 2007)

Fixed-Parameter Algorithms for Kemeny Scores. - Nadja Betzler; Michael R. Fellows; Jiong Guo; Rolf Niedermeier; Frances A. Rosamond (AAIM, 2008)

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. - Nadja Betzler; Michael R. Fellows; Christian Komusiewicz; Rolf Niedermeier (CPM, 2008)

On Problems without Polynomial Kernels (Extended Abstract). - Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Danny Hermelin (ICALP (1), 2008)

Graph Layout Problems Parameterized by Vertex Cover. - Michael R. Fellows; Daniel Lokshtanov; Neeldhara Misra; Frances A. Rosamond; Saket Saurabh 001 (ISAAC, 2008)

Leaf Powers and Their Properties: Using the Trees. - Michael R. Fellows; Daniel Meister 001; Frances A. Rosamond; R. Sritharan; Jan Arne Telle (ISAAC, 2008)

A Purely Democratic Characterization of W[1]. - Michael R. Fellows; Danny Hermelin; Moritz Müller; Frances A. Rosamond (IWPEC, 2008)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Sue Whitesides; David R. Wood (Algorithmica, 2008)

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. - Michael R. Fellows; Christian Knauer; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Ulrike Stege; Dimitrios M. Thilikos; Sue Whitesides (Algorithmica, 2008)

The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. - Rodney G. Downey; Michael R. Fellows; Michael A. Langston (Comput. J., 2008)

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Elena Losievskaja; Frances A. Rosamond; Saket Saurabh 001 (CoRR, 2008)

Parameterized approximation of dominating set problems. - Rodney G. Downey; Michael R. Fellows; Catherine McCartin; Frances A. Rosamond (Inf. Process. Lett., 2008)

How similarity helps to efficiently compute Kemeny rankings. - Nadja Betzler; Michael R. Fellows; Jiong Guo; Rolf Niedermeier; Frances A. Rosamond (AAMAS (1), 2009)

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. - Michael R. Fellows (IWOCA, 2009)

What Makes Equitable Connected Partition Easy. - Rosa Enciso; Michael R. Fellows; Jiong Guo; Iyad A. Kanj; Frances A. Rosamond; Ondrej Suchý 001 (IWPEC, 2009)

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. - Michael R. Fellows; Danny Hermelin; Frances A. Rosamond (IWPEC, 2009)

A Generalization of Nemhauser and Trotter's Local Optimization Theorem. - Michael R. Fellows; Jiong Guo; Hannes Moser; Rolf Niedermeier (STACS, 2009)

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. - Michael Dom; Michael R. Fellows; Frances A. Rosamond (WALCOM, 2009)

Abstract Milling with Turn Costs - Michael R. Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (CoRR, 2009)

On problems without polynomial kernels. - Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Danny Hermelin (J. Comput. Syst. Sci., 2009)

Derivation of algorithms for cutwidth and related graph layout parameters. - Hans L. Bodlaender; Michael R. Fellows; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2009)

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. - Michael R. Fellows; Daniel Lokshtanov; Neeldhara Misra; Matthias Mnich; Frances A. Rosamond; Saket Saurabh 001 (Theory Comput. Syst., 2009)

Clique-Width is NP-Complete. - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (SIAM J. Discret. Math., 2009)

Fixed-parameter algorithms for Kemeny rankings. - Nadja Betzler; Michael R. Fellows; Jiong Guo; Rolf Niedermeier; Frances A. Rosamond (Theor. Comput. Sci., 2009)

On the parameterized complexity of multiple-interval graph problems. - Michael R. Fellows; Danny Hermelin; Frances A. Rosamond; Stéphane Vialette (Theor. Comput. Sci., 2009)

A Linear Kernel for Co-Path/Cycle Packing. - Zhi-Zhong Chen; Michael R. Fellows; Bin Fu; Haitao Jiang; Yang Liu 002; Lusheng Wang 001; Binhai Zhu (AAIM, 2010)

Determining the Winner of a Dodgson Election is Hard. - Michael R. Fellows; Bart M. P. Jansen; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001 (FSTTCS, 2010)

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. - Mike Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (WG, 2010)

Parameterized Control Complexity in Fallback Voting - Gábor Erdélyi; Michael R. Fellows (CoRR, 2010)

The parameterized complexity of some minimum label problems. - Michael R. Fellows; Jiong Guo; Iyad A. Kanj (J. Comput. Syst. Sci., 2010)

W-Hierarchies Defined by Symmetric Gates. - Michael R. Fellows; Jörg Flum; Danny Hermelin; Moritz Müller; Frances A. Rosamond (Theory Comput. Syst., 2010)

Clustering with partial information. - Hans L. Bodlaender; Michael R. Fellows; Pinar Heggernes; Federico Mancini 001; Charis Papadopoulos; Frances A. Rosamond (Theor. Comput. Sci., 2010)

Multivariate Complexity Theory. - Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (Computer Science, The Hardware, Software and Heart of It, 2011)

Recent Developments in the Theory of Pre-processing. - Michael R. Fellows (FAW-AAIM, 2011)

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. - Robert Crowston; Michael R. Fellows; Gregory Z. Gutin; Mark Jones 001; Frances A. Rosamond; Stéphan Thomassé; Anders Yeo (FSTTCS, 2011)

Parameterized Complexity of the Firefighter Problem. - Cristina Bazgan; Morgan Chopin; Michael R. Fellows (ISAAC, 2011)

Quadratic Kernelization for Convex Recoloring of Trees. - Hans L. Bodlaender; Michael R. Fellows; Michael A. Langston; Mark A. Ragan; Frances A. Rosamond; Mark Weyer (Algorithmica, 2011)

Control Complexity in Bucklin and Fallback Voting - Gábor Erdélyi; Michael R. Fellows; Lena Piras; Jörg Rothe (CoRR, 2011)

Facility location problems: A parameterized view. - Michael R. Fellows; Henning Fernau (Discret. Appl. Math., 2011)

Special Issue on Parameterized Complexity of Discrete Optimization. - Michael R. Fellows; Fedor V. Fomin; Gregory Z. Gutin (Discret. Optim., 2011)

Graph-based data clustering with overlaps. - Michael R. Fellows; Jiong Guo; Christian Komusiewicz; Rolf Niedermeier; Johannes Uhlmann (Discret. Optim., 2011)

On the complexity of some colorful problems parameterized by treewidth. - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001; Stefan Szeider; Carsten Thomassen (Inf. Comput., 2011)

Upper and lower bounds for finding connected motifs in vertex-colored graphs. - Michael R. Fellows; Guillaume Fertin; Danny Hermelin; Stéphane Vialette (J. Comput. Syst. Sci., 2011)

A generalization of Nemhauser and Trotterʼs local optimization theorem. - Michael R. Fellows; Jiong Guo; Hannes Moser; Rolf Niedermeier (J. Comput. Syst. Sci., 2011)

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. - Nadja Betzler; René van Bevern; Michael R. Fellows; Christian Komusiewicz; Rolf Niedermeier (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Haplotype Inference Constrained by Plausible Haplotype Data. - Michael R. Fellows; Tzvika Hartman; Danny Hermelin; Gad M. Landau; Frances A. Rosamond; Liat Rozenberg (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. - Michael R. Fellows; Jiong Guo; Hannes Moser; Rolf Niedermeier (ACM Trans. Comput. Theory, 2011)

The Parameterized Complexity of Abduction. - Michael R. Fellows; Andreas Pfandler; Frances A. Rosamond; Stefan Rümmele (AAAI, 2012)

Train Marshalling Is Fixed Parameter Tractable. - Leo Brueggeman; Michael R. Fellows; Rudolf Fleischer; Martin Lackner; Christian Komusiewicz; Yiannis Koutis; Andreas Pfandler; Frances A. Rosamond (FUN, 2012)

The Parameterized Complexity of Stabbing Rectangles. - Michael Dom; Michael R. Fellows; Frances A. Rosamond; Somnath Sikdar (Algorithmica, 2012)

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. - Michael R. Fellows; Danny Hermelin; Frances A. Rosamond (Algorithmica, 2012)

How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding - René van Bevern; Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (CoRR, 2012)

Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). - Michael R. Fellows; Jiong Guo; Dániel Marx; Saket Saurabh 001 (Dagstuhl Reports, 2012)

Local search: Is brute-force avoidable? - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001; Yngve Villanger (J. Comput. Syst. Sci., 2012)

Parameterizing by the Number of Numbers. - Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (Theory Comput. Syst., 2012)

Myhill-Nerode Methods for Hypergraphs. - René van Bevern; Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (ISAAC, 2013)

FPT Is Characterized by Useful Obstruction Sets. - Michael R. Fellows; Bart M. P. Jansen (WG, 2013)

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity. - Michael R. Fellows; Bart M. P. Jansen; Frances A. Rosamond (Eur. J. Comb., 2013)

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. - Michael R. Fellows; Tobias Friedrich 001; Danny Hermelin; Nina Narodytska; Frances A. Rosamond (Theor. Comput. Sci., 2013)

Distortion is Fixed Parameter Tractable. - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Elena Losievskaja; Frances A. Rosamond; Saket Saurabh 001 (ACM Trans. Comput. Theory, 2013)

Fundamentals of Parameterized Complexity. - Rodney G. Downey; Michael R. Fellows (Springer, 2013)

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. - Faisal N. Abu-Khzam; Judith Egan; Michael R. Fellows; Frances A. Rosamond; Peter Shaw 001 (COCOA, 2014)

Parameterized complexity of firefighting. - Cristina Bazgan; Morgan Chopin; Marek Cygan; Michael R. Fellows; Fedor V. Fomin; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2014)

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. - Robert Crowston; Michael R. Fellows; Gregory Z. Gutin; Mark Jones 001; Eun Jung Kim 002; Fran Rosamond; Imre Z. Ruzsa; Stéphan Thomassé; Anders Yeo (J. Comput. Syst. Sci., 2014)

FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. - Michael R. Fellows; Bart M. P. Jansen (ACM Trans. Comput. Theory, 2014)

Myhill-Nerode Methods for Hypergraphs. - René van Bevern; Rodney G. Downey; Michael R. Fellows; Serge Gaspers; Frances A. Rosamond (Algorithmica, 2015)

The Flood-It game parameterized by the vertex cover number. - Uéverton dos Santos Souza; Frances A. Rosamond; Michael R. Fellows; Fábio Protti; Maise Dantas da Silva (Electron. Notes Discret. Math., 2015)

Control complexity in Bucklin and fallback voting: A theoretical analysis. - Gábor Erdélyi; Michael R. Fellows; Jörg Rothe; Lena Schend (J. Comput. Syst. Sci., 2015)

Control complexity in Bucklin and fallback voting: An experimental analysis. - Gábor Erdélyi; Michael R. Fellows; Jörg Rothe; Lena Schend (J. Comput. Syst. Sci., 2015)

On the parameterized complexity of dynamic problems. - Faisal N. Abu-Khzam; Judith Egan; Michael R. Fellows; Frances A. Rosamond; Peter Shaw 001 (Theor. Comput. Sci., 2015)

Tractability and hardness of flood-filling games on trees. - Michael R. Fellows; Uéverton dos Santos Souza; Fábio Protti; Maise Dantas da Silva (Theor. Comput. Sci., 2015)

Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You. - Michael R. Fellows (Bull. EATCS, 2016)

Tractable Parameterizations for the Minimum Linear Arrangement Problem. - Michael R. Fellows; Danny Hermelin; Frances A. Rosamond; Hadas Shachnai (ACM Trans. Comput. Theory, 2016)

Surfing with Rod. - Michael R. Fellows (Computability and Complexity, 2017)

What Is Known About Vertex Cover Kernelization? - Michael R. Fellows; Lars Jaffke; Aliz Izabella Király; Frances A. Rosamond; Mathias Weller (Adventures Between Lower Bounds and Higher Altitudes, 2018)

A Survey on the Complexity of Flood-Filling Games. - Michael R. Fellows; Frances A. Rosamond; Maise Dantas da Silva; Uéverton S. Souza (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. - Michael R. Fellows; Fábio Protti; Frances A. Rosamond; Maise Dantas da Silva; Uéverton S. Souza (Discret. Appl. Math., 2018)

Parameterized approximation via fidelity preserving transformations. - Michael R. Fellows; Ariel Kulik; Frances A. Rosamond; Hadas Shachnai (J. Comput. Syst. Sci., 2018)

A brief history of Edward K. Blum and the Journal of Computer and System Sciences. - Michael R. Fellows; Frances A. Rosamond (J. Comput. Syst. Sci., 2018)

Diversity in Combinatorial Optimization. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (CoRR, 2019)

Collaborating with Hans: Some Remaining Wonderments. - Michael R. Fellows; Frances A. Rosamond (Treewidth, Kernels, and Algorithms, 2020)

Parameterized String Equations. - Laurent Bulteau; Michael R. Fellows; Christian Komusiewicz; Frances A. Rosamond (CoRR, 2021)

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (Artif. Intell., 2022)

On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. - Emmanuel Sam; Michael R. Fellows; Frances A. Rosamond; Petr A. Golovach (CIAC, 2023)

On Solution Discovery via Reconfiguration. - Michael R. Fellows; Mario Grobler; Nicole Megow; Amer E. Mouawad; Vijayaragunathan Ramamoorthi; Frances A. Rosamond; Daniel Schmand; Sebastian Siebertz (ECAI, 2023)

Open Problems in (Hyper)Graph Decomposition. - 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; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; 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; et al. (Dagstuhl Reports, 2023)

Games That Cannot Go on Forever! Active Participation in Research Is the Main Issue for Kids. - Michael R. Fellows; Frances A. Rosamond (CMSC, 2024)

Breaking a Graph into Connected Components with Small Dominating Sets. - Matthias Bentert; Michael R. Fellows; Petr A. Golovach; Frances A. Rosamond; Saket Saurabh 001 (MFCS, 2024)

On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves. - Benjamin Bergougnoux; Nello Blaser; Michael R. Fellows; Petr A. Golovach; Frances A. Rosamond; Emmanuel Sam (J. Comput. Syst. Sci., 2025)