Michael R. Fellows

235 papers A* 13A 12B 25C 9Misc 6Journal 119Unranked 43
YearRankTypeTitle / Venue / Authors
2026 J jnl
On solution discovery via reconfiguration.
J. Comput. Syst. Sci.
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2025 J jnl
On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves.
J. Comput. Syst. Sci.
Benjamin Bergougnoux, Nello Blaser, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Emmanuel Sam
2024 B conf
Breaking a Graph into Connected Components with Small Dominating Sets.
MFCS
Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
2024 — conf
Games That Cannot Go on Forever! Active Participation in Research Is the Main Issue for Kids.
CMSC
Michael R. Fellows, Frances A. Rosamond
2023 A conf
On Solution Discovery via Reconfiguration.
ECAI
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2023 J jnl
On Solution Discovery via Reconfiguration.
CoRR
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2023 C conf
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves.
CIAC
Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach
2023 J jnl
Open Problems in (Hyper)Graph Decomposition.
CoRR
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, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman
2023 J jnl
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports
George Karypis, Christian Schulz, 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
2022 J jnl
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.
Artif. Intell.
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2021 J jnl
Parameterized String Equations.
CoRR
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
2020 — conf
Collaborating with Hans: Some Remaining Wonderments.
Treewidth, Kernels, and Algorithms
Michael R. Fellows, Frances A. Rosamond
2020 A* conf
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
IJCAI
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2019 J jnl
Diversity in Combinatorial Optimization.
CoRR
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2018 — conf
A Survey on the Complexity of Flood-Filling Games.
Adventures Between Lower Bounds and Higher Altitudes
Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 J jnl
A brief history of Edward K. Blum and the Journal of Computer and System Sciences.
J. Comput. Syst. Sci.
Michael R. Fellows, Frances A. Rosamond
2018 J jnl
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.
Discret. Appl. Math.
Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 J jnl
Parameterized approximation via fidelity preserving transformations.
J. Comput. Syst. Sci.
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2018 — conf
What Is Known About Vertex Cover Kernelization?
Adventures Between Lower Bounds and Higher Altitudes
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
2018 J jnl
What is known about Vertex Cover Kernelization?
CoRR
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
2017 — ed.
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday
Computability and Complexity
Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond
2017 — conf
Surfing with Rod.
Computability and Complexity
Michael R. Fellows
2016 J jnl
Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You.
Bull. EATCS
Michael R. Fellows
2016 J jnl
Tractable Parameterizations for the Minimum Linear Arrangement Problem.
ACM Trans. Comput. Theory
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2015 J jnl
Control complexity in Bucklin and fallback voting: A theoretical analysis.
J. Comput. Syst. Sci.
Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015 J jnl
Control complexity in Bucklin and fallback voting: An experimental analysis.
J. Comput. Syst. Sci.
Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015 J jnl
Myhill-Nerode Methods for Hypergraphs.
Algorithmica
René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2015 J jnl
On the parameterized complexity of dynamic problems.
Theor. Comput. Sci.
Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
2015 J jnl
The Flood-It game parameterized by the vertex cover number.
Electron. Notes Discret. Math.
Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva
2015 J jnl
Tractability and hardness of flood-filling games on trees.
Theor. Comput. Sci.
Michael R. Fellows, Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva
2014 J jnl
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.
ACM Trans. Comput. Theory
Michael R. Fellows, Bart M. P. Jansen
2014 C conf
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.
COCOA
Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
2014 J jnl
Parameterized complexity of firefighting.
J. Comput. Syst. Sci.
Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen
2014 J jnl
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci.
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
2013 J jnl
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
Theor. Comput. Sci.
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2013 J jnl
Distortion is Fixed Parameter Tractable.
ACM Trans. Comput. Theory
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2013 B conf
FPT Is Characterized by Useful Obstruction Sets.
WG
Michael R. Fellows, Bart M. P. Jansen
2013 J jnl
FPT is Characterized by Useful Obstruction Sets
CoRR
Michael R. Fellows, Bart M. P. Jansen
2013 — ed.
Frontiers in Algorithmics
FAW-AAIM
Michael R. Fellows, Xuehou Tan, Binhai Zhu
2013 — book
Fundamentals of Parameterized Complexity.
Rodney G. Downey, Michael R. Fellows
2013 B conf
Myhill-Nerode Methods for Hypergraphs.
ISAAC
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2013 J jnl
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
Eur. J. Comb.
Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond
2013 A conf
Tractable Parameterizations for the Minimum Linear Arrangement Problem.
ESA
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2012 J jnl
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241).
Dagstuhl Reports
Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh
2012 J jnl
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
CoRR
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012 J jnl
Local search: Is brute-force avoidable?
J. Comput. Syst. Sci.
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
2012 — conf
Parameterized Approximation via Fidelity Preserving Transformations.
ICALP (1)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2012 J jnl
Parameterizing by the Number of Numbers.
Theory Comput. Syst.
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012 A* conf
The Parameterized Complexity of Abduction.
AAAI
Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele
2012 J jnl
The Parameterized Complexity of Stabbing Rectangles.
Algorithmica
Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar
2012 Misc conf
Train Marshalling Is Fixed Parameter Tractable.
FUN
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond
2012 J jnl
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.
Algorithmica
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
2011 J jnl
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
ACM Trans. Comput. Theory
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2011 J jnl
A generalization of Nemhauser and Trotterʼs local optimization theorem.
J. Comput. Syst. Sci.
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2011 A* conf
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable.
IJCAI
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2011 J jnl
Control Complexity in Bucklin and Fallback Voting
CoRR
Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe
2011 J jnl
Facility location problems: A parameterized view.
Discret. Appl. Math.
Michael R. Fellows, Henning Fernau
2011 J jnl
Graph-based data clustering with overlaps.
Discret. Optim.
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2011 J jnl
Haplotype Inference Constrained by Plausible Haplotype Data.
IEEE ACM Trans. Comput. Biol. Bioinform.
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2011 — ch.
Multivariate Complexity Theory.
Computer Science, The Hardware, Software and Heart of It
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2011 J jnl
On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput.
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011 J jnl
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE ACM Trans. Comput. Biol. Bioinform.
Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2011 B conf
Parameterized Complexity of the Firefighter Problem.
ISAAC
Cristina Bazgan, Morgan Chopin, Michael R. Fellows
2011 J jnl
Quadratic Kernelization for Convex Recoloring of Trees.
Algorithmica
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2011 — conf
Recent Developments in the Theory of Pre-processing.
FAW-AAIM
Michael R. Fellows
2011 — conf
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
FSTTCS
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
2011 J jnl
Special Issue on Parameterized Complexity of Discrete Optimization.
Discret. Optim.
Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin
2011 J jnl
Upper and lower bounds for finding connected motifs in vertex-colored graphs.
J. Comput. Syst. Sci.
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2010 C conf
A Linear Kernel for Co-Path/Cycle Packing.
AAIM
Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu
2010 J jnl
Clustering with partial information.
Theor. Comput. Sci.
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2010 — conf
Determining the Winner of a Dodgson Election is Hard.
FSTTCS
Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh
2010 J jnl
Parameterized Control Complexity in Fallback Voting
CoRR
Gábor Erdélyi, Michael R. Fellows
2010 J jnl
Parameterizing by the Number of Numbers
CoRR
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2010 B conf
Parameterizing by the Number of Numbers.
IPEC
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2010 J jnl
The parameterized complexity of some minimum label problems.
J. Comput. Syst. Sci.
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
2010 J jnl
W-Hierarchies Defined by Symmetric Gates.
Theory Comput. Syst.
Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2009 B conf
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
MFCS
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009 J jnl
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
CoRR
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009 A conf
A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
STACS
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier
2009 J jnl
Abstract Milling with Turn Costs
CoRR
Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2009 J jnl
Clique-Width is NP-Complete.
SIAM J. Discret. Math.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2009 J jnl
Derivation of algorithms for cutwidth and related graph layout parameters.
J. Comput. Syst. Sci.
Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
2009 — conf
Distortion Is Fixed Parameter Tractable.
ICALP (1)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2009 J jnl
Fixed-parameter algorithms for Kemeny rankings.
Theor. Comput. Sci.
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2009 Misc conf
Graph-Based Data Clustering with Overlaps.
COCOON
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
2009 B conf
Haplotype Inference Constrained by Plausible Haplotype Data.
CPM
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2009 — conf
How similarity helps to efficiently compute Kemeny rankings.
AAMAS (1)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2009 A* conf
Local Search: Is Brute-Force Avoidable?
IJCAI
Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2009 J jnl
On problems without polynomial kernels.
J. Comput. Syst. Sci.
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2009 J jnl
On the parameterized complexity of multiple-interval graph problems.
Theor. Comput. Sci.
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette
2009 B conf
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.
WALCOM
Michael Dom, Michael R. Fellows, Frances A. Rosamond
2009 — ed.
Perspectives Workshop: Preventing the Brainware Crisis, 31.03. - 03.04.2009
Perspectives Workshop: Preventing the Brainware Crisis
Stephan Diehl, Michael R. Fellows, Ulrike Stege
2009 J jnl
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Comput. Syst.
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
2009 B conf
The Parameterized Complexity of Some Minimum Label Problems.
WG
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
2009 C conf
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology.
IWOCA
Michael R. Fellows
2009 — conf
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.
IWPEC
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
2009 — conf
What Makes Equitable Connected Partition Easy.
IWPEC
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
2008 — conf
A Purely Democratic Characterization of W[1].
IWPEC
Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2008 B conf
Clustering with Partial Information.
MFCS
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2008 C conf
Facility Location Problems: A Parameterized View.
AAIM
Michael R. Fellows, Henning Fernau
2008 J jnl
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2008 C conf
Fixed-Parameter Algorithms for Kemeny Scores.
AAIM
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2008 B conf
Graph Layout Problems Parameterized by Vertex Cover.
ISAAC
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
2008 B conf
Leaf Powers and Their Properties: Using the Trees.
ISAAC
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
2008 — conf
On Problems without Polynomial Kernels (Extended Abstract).
ICALP (1)
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2008 J jnl
On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica
Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
2008 B conf
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
CPM
Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier
2008 J jnl
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
CoRR
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2008 J jnl
Parameterized approximation of dominating set problems.
Inf. Process. Lett.
Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
2008 J jnl
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors.
Comput. J.
Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2007 J jnl
An O(2
Theory Comput. Syst.
Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
2007 Misc conf
Connected Coloring Completion for General Graphs: Algorithms and Complexity.
COCOON
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
2007 J jnl
Crown Structures for Vertex Cover Kernelization.
Theory Comput. Syst.
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters
2007 B conf
Efficient Parameterized Preprocessing for Cluster Editing.
FCT
Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
2007 C conf
On the Complexity of Some Colorful Problems Parameterized by Treewidth.
COCOA
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2007 Misc conf
Quadratic Kernelization for Convex Recoloring of Trees.
COCOON
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2007 A* conf
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
ICALP
Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2007 C conf
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
CiE
Michael R. Fellows, Frances A. Rosamond
2007 J jnl
The Complexity of Polynomial-Time Approximation.
Theory Comput. Syst.
Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond
2006 J jnl
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica
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
2006 A* conf
Clique-width minimization is NP-hard.
STOC
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2006 — conf
Kernelization for Convex Recoloring.
ACiD
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2006 B conf
NONBLOCKER: Parameterized Algorithmics for minimum dominating set.
SOFSEM
Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond
2006 J jnl
On The Parameterized Intractability Of Motif Search Problems.
Comb.
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
2006 J jnl
On finding short resolution refutations and small unsatisfiable subsets.
Theor. Comput. Sci.
Michael R. Fellows, Stefan Szeider, Graham Wrightson
2006 — conf
Parameterized Approximation Problems.
IWPEC
Rodney G. Downey, Michael R. Fellows, Catherine McCartin
2006 — conf
The Lost Continent of Polynomial Time: Preprocessing and Kernelization.
IWPEC
Michael R. Fellows
2006 — conf
The Undirected Feedback Vertex Set Problem Has a Poly(
IWPEC
Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond
2005 J jnl
A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci.
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2005 Misc conf
An O(2
COCOON
Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
2005 — conf
FPT is P-Time Extremal Structure I.
ACiD
Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond
2005 J jnl
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2005 J jnl
Proving NP-hardness for clique-width II: non-approximability of clique-width
Electron. Colloquium Comput. Complex.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2004 A conf
A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing.
ESA
Michael R. Fellows
2004 A conf
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
ESA
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2004 — conf
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover.
IWPEC
Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
2004 — conf
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
ALENEX/ANALC
Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons
2004 — conf
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.
IWPEC
Michael R. Fellows, Stefan Szeider, Graham Wrightson
2004 — ed.
Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings
IWPEC
Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne
2004 J jnl
Polynomial-time data reduction for dominating set.
J. ACM
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
2004 J jnl
The dominating set problem is fixed parameter tractable for graphs of bounded genus.
J. Algorithms
John A. Ellis, Hongbing Fan, Michael R. Fellows
2003 B conf
An FPT Algorithm for Set Splitting.
WG
Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
2003 J jnl
Analogs & duals of the MAST problem for sequences & trees.
J. Algorithms
Michael R. Fellows, Michael T. Hallett, Ulrike Stege
2003 B conf
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.
WG
Michael R. Fellows
2003 — conf
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.
CATS
Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond
2003 J jnl
Foreword from the guest editors.
J. Comput. Syst. Sci.
Jianer Chen, Michael R. Fellows
2003 B conf
New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.
WADS
Michael R. Fellows
2003 J jnl
On the parametric complexity of schedules to minimize tardy tasks.
Theor. Comput. Sci.
Michael R. Fellows, Catherine McCartin
2003 B conf
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.
MFCS
Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
2002 — book
Computer Science Unplugged - an enrichment and extension programme for primary-aged children.
Tim Bell, Ian H. Witten, Michael R. Fellows
2002 — conf
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.
SWAT
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
2002 A conf
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems.
STACS
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
2002 — conf
Parameterized Complexity: The Main Ideas and Connections to Practical Computing.
CATS
Michael R. Fellows
2002 J jnl
Parameterized Intractability of Motif Search Problems
CoRR
Michael R. Fellows, Jens Gramm, Rolf Niedermeier
2002 J jnl
Polynomial Time Data Reduction for Dominating Set
CoRR
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
2002 — conf
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.
SWAT
John A. Ellis, Hongbing Fan, Michael R. Fellows
2001 A conf
A Fixed-Parameter Approach to Two-Layer Planarization.
GD
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
2001 J jnl
Forbidden minors to graphs with small feedback sets.
Discret. Math.
Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
2001 J jnl
Index sets and parametric reductions.
Arch. Math. Log.
Rodney G. Downey, Michael R. Fellows
2001 A conf
On the Parameterized Complexity of Layered Graph Drawing.
ESA
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
2001 B conf
Parameterized Complexity: The Main Ideas and Some Research Frontiers.
ISAAC
Michael R. Fellows
2001 B conf
Refined Search Tree Technique for DOMINATING SET on Planar Graphs.
MFCS
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2000 — conf
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
FSTTCS
Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
2000 J jnl
On computing graph minor obstruction sets.
Theor. Comput. Sci.
Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2000 — conf
Parameterized Complexity: The Main Ideas and Connections to Practical Computing.
Experimental Algorithmics
Michael R. Fellows
2000 J jnl
The complexity of irredundant sets parameterized by size.
Discret. Appl. Math.
Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
2000 J jnl
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.
Theor. Comput. Sci.
Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy J. Warnow
1999 J jnl
Computational Tractability: The View From Mars.
Bull. EATCS
Rodney G. Downey, Michael R. Fellows, Ulrike Stege
1999 — book
Parameterized Complexity
Rodney G. Downey, Michael R. Fellows
1999 J jnl
The Parametrized Complexity of Some Fundamental Problems in Coding Theory.
SIAM J. Comput.
Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle
1998 J jnl
An Improved Fixed-Parameter Algorithm for Vertex Cover.
Inf. Process. Lett.
R. Balasubramanian, Michael R. Fellows, Venkatesh Raman
1998 A conf
Analogs and Duals of the MAST Problem for Sequences and Trees.
ESA
Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege
1998 J jnl
Constructions of large planar networks with given degree and diameter.
Networks
Michael R. Fellows, Pavol Hell, Karen Seyffarth
1998 B conf
On the Multiple Gene Duplication Problem.
ISAAC
Michael R. Fellows, Michael T. Hallett, Ulrike Stege
1998 J jnl
Parameterized Circuit Complexity and the W Hierarchy.
Theor. Comput. Sci.
Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
1998 J jnl
Threshold Dominating Sets and an Improved Characterization of
Theor. Comput. Sci.
Rodney G. Downey, Michael R. Fellows
1997 J jnl
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.
J. Univers. Comput. Sci.
Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
1997 J jnl
Advice Classes of Parameterized Tractability.
Ann. Pure Appl. Log.
Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1997 J jnl
On the parameterized complexity of short computation and factorization.
Arch. Math. Log.
Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1997 — conf
Parameterized complexity: A framework for systematically confronting computational intractability.
Contemporary Trends in Discrete Mathematics
Rodney G. Downey, Michael R. Fellows, Ulrike Stege
1996 J jnl
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.
Inf. Process. Lett.
Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
1996 — conf
Descriptive complexity and the
Proof Complexity and Feasible Arithmetics
Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
1996 B conf
Finite-State Computability of Annotations of Strings and Trees.
CPM
Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
1996 J jnl
Sparse Parameterized Problems.
Ann. Pure Appl. Log.
Marco Cesati, Michael R. Fellows
1996 — conf
The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1].
DMTCS
Rodney G. Downey, Michael R. Fellows, Udayan Taylor
1996 J jnl
Vertex transversals that dominate.
J. Graph Theory
Noga Alon, Michael R. Fellows, Donovan R. Hare
1995 J jnl
Fixed-Parameter Tractability and Completeness I: Basic Results.
SIAM J. Comput.
Rodney G. Downey, Michael R. Fellows
1995 J jnl
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1].
Theor. Comput. Sci.
Rodney G. Downey, Michael R. Fellows
1995 J jnl
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues.
Ann. Pure Appl. Log.
Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
1995 J jnl
Large Planar Graphs with Given Diameter and Maximum Degree.
Discret. Appl. Math.
Michael R. Fellows, Pavol Hell, Karen Seyffarth
1995 B conf
Obstructions to Within a Few Vertices or Edges of Acyclic.
WADS
Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
1995 J jnl
On the Structure of Parameterized Problems in NP.
Inf. Comput.
Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1995 J jnl
Parameterized complexity analysis in computational biology.
Comput. Appl. Biosci.
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
1995 J jnl
The Complexity of Induced Minors and Related Problems.
Algorithmica
Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
1995 J jnl
The Parameterized Complexity of Sequence Alignment and Consensus.
Theor. Comput. Sci.
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
1995 J jnl
W[2]-hardness of precedence constrained K-processor scheduling.
Oper. Res. Lett.
Hans L. Bodlaender, Michael R. Fellows
1994 A* conf
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy.
STOC
Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett
1994 J jnl
On Search, Decision, and the Efficiency of Polynomial-Time Algorithms.
J. Comput. Syst. Sci.
Michael R. Fellows, Michael A. Langston
1994 A conf
On the Structure of Parameterized Problems in NP (Extended Abstract).
STACS
Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1994 B conf
The Parameterized Complexity of Sequence Alignment and Consensus.
CPM
Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
1994 Misc conf
The Parameterized Complexity of Some Problems in Logic and Linguistics.
LFCS
Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham
1994 J jnl
The Private Neighbor Cube.
SIAM J. Discret. Math.
Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1993 A conf
DNA Physical Mapping: Three Ways Difficult.
ESA
Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
1993 — conf
Fixed-Parameter Complexity and Cryptography.
AAECC
Michael R. Fellows, Neal Koblitz
1993 A conf
Fixed-Parameter Intractability II (Extended Abstract).
STACS
Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
1993 A* conf
Parameterized Learning Complexity.
COLT
Rodney G. Downey, Patricia A. Evans, Michael R. Fellows
1992 — conf
Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy.
Complexity Theory: Current Research
Rodney G. Downey, Michael R. Fellows
1992 — conf
Fixed-Parameter Intractability.
SCT
Rodney G. Downey, Michael R. Fellows
1992 — conf
Implementing the Standards: Let's Focus on the First Four.
Discrete Mathematics in the Schools
Nancy Casey, Michael R. Fellows
1992 A* conf
Kid Krypto.
CRYPTO
Michael R. Fellows, Neal Koblitz
1992 J jnl
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design.
SIAM J. Discret. Math.
Michael R. Fellows, Michael A. Langston
1992 C conf
Parallel Self-Reducibility.
ICCI
Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson
1992 — conf
Self-Witnessing Polynomial-Time Complexity and Prime Factorization.
SCT
Michael R. Fellows, Neal Koblitz
1992 J jnl
Self-Witnessing Polynomial-Time Complexity and Prime Factorization.
Des. Codes Cryptogr.
Michael R. Fellows, Neal Koblitz
1992 J jnl
Small Diameter Symmetric Networks from Linear Groups.
IEEE Trans. Computers
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
1992 A* conf
Two Strikes Against Perfect Phylogeny.
ICALP
Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow
1991 — conf
Algebraic Constructions of Efficient Broadcast Networks.
AAECC
Michael J. Dinneen, Michael R. Fellows, Vance Faber
1991 J jnl
Constructive complexity.
Discret. Appl. Math.
Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret
1991 — conf
Constructivity Issues in Graph Algorithms.
Constructivity in Computer Science
Michael R. Fellows, Michael A. Langston
1991 J jnl
Fast search algorithms for layout permutation problems.
Integr.
Michael R. Fellows, Michael A. Langston
1991 — conf
Finite automata, bounded treewidth, and well-quasiordering.
Graph Structure Theory
Karl R. Abrahamson, Michael R. Fellows
1991 — conf
Induced minors and related problems.
Graph Structure Theory
Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer
1991 J jnl
On the complexity and combinatorics of covering finite complexes.
Australas. J Comb.
James Abello, Michael R. Fellows, John Stillwell
1991 J jnl
Perfect domination.
Australas. J Comb.
Michael R. Fellows, Mark N. Hoover
1990 J jnl
Transversals of Vertex Partitions in Graphs.
SIAM J. Discret. Math.
Michael R. Fellows
1989 A* conf
An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)
FOCS
Michael R. Fellows, Michael A. Langston
1989 — conf
Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation.
Computers and Mathematics
Michael R. Fellows, Nancy G. Kinnersley, Michael A. Langston
1989 A* conf
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract)
STOC
Michael R. Fellows, Michael A. Langston
1989 A* conf
On the Complexity of Fixed Parameter Problems (Extended Abstract)
FOCS
Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata
1989 J jnl
Radius and diameter in Manhattan lattices.
Discret. Math.
Daniel J. Kleitman, Michael R. Fellows
1988 — conf
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design.
AWOC
Michael R. Fellows, Michael A. Langston
1988 J jnl
Nonconstructive tools for proving polynomial-time decidability.
J. ACM
Michael R. Fellows, Michael A. Langston
1988 J jnl
On Finding Optimal and Near-Optimal Lineal Spanning Trees.
Algorithmica
Michael R. Fellows, Donald K. Friesen, Michael A. Langston
1988 J jnl
Processor Utilization in a Linearly Connected Parallel Processing System.
IEEE Trans. Computers
Michael R. Fellows, Michael A. Langston
1987 J jnl
Nonconstructive Advances in Polynomial-Time Complexity.
Inf. Process. Lett.
Michael R. Fellows, Michael A. Langston