M. Fellows

Most-cited papers

Fundamentals of Parameterized Complexity
R. Downey, M. Fellows
2013Texts in Computer Science1,515 citations
Semantic Scholar
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
M. Fellows, B. Jansen, Frances A. Rosamond
2013European journal of combinatorics (Print)109 citations Open access
Semantic Scholar
CS Unplugged: An enrichment and extension programme for primary-aged students
Tim Bell, I. Witten, M. Fellows
201576 citations
Semantic Scholar
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
Julien Baste, M. Fellows, Lars Jaffke, Tomáš Masařík +3 more
2019International Joint Conference on Artificial Intelligence73 citations Open access
Semantic Scholar
Upper and lower bounds for finding connected motifs in vertex-colored graphs
M. Fellows, G. Fertin, Danny Hermelin, S. Vialette
2011Journal of computer and system sciences (Print)73 citations Open access
Semantic Scholar
Parameterized approximation via fidelity preserving transformations
M. Fellows, A. Kulik, Frances A. Rosamond, H. Shachnai
2012Journal of computer and system sciences (Print)64 citations Open access
Semantic Scholar
Control complexity in Bucklin and fallback voting: A theoretical analysis
G. Erdélyi, M. Fellows, J. Rothe, Lena Schend
2015Journal of computer and system sciences (Print)59 citations Open access
Semantic Scholar
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks
Nadja Betzler, René van Bevern, M. Fellows, Christian Komusiewicz +1 more
2011IEEE/ACM Transactions on Computational Biology & Bioinformatics54 citations
Semantic Scholar
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
R. Crowston, M. Fellows, G. Gutin, Mark Jones +5 more
2014Journal of computer and system sciences (Print)48 citations Open access
Semantic Scholar
Tractable Parameterizations for the Minimum Linear Arrangement Problem
M. Fellows, Danny Hermelin, Frances A. Rosamond, H. Shachnai
2013TOCT41 citations Open access
Semantic Scholar
Parameterizing by the Number of Numbers
M. Fellows, Serge Gaspers, Frances A. Rosamond
2010Theory of Computing Systems37 citations Open access
Semantic Scholar
What Makes Equitable Connected Partition Easy
Rosa Enciso, M. Fellows, Jiong Guo, Iyad A. Kanj +2 more
2009IWPEC36 citations Open access
Semantic Scholar
What Is Known About Vertex Cover Kernelization?
M. Fellows, Lars Jaffke, A. Király, Frances A. Rosamond +1 more
2018Adventures Between Lower Bounds and Higher Altitudes30 citations Open access
Semantic Scholar
Parameterized complexity of firefighting
C. Bazgan, M. Chopin, M. Cygan, M. Fellows +2 more
2014Journal of computer and system sciences (Print)28 citations Open access
Semantic Scholar
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)
M. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh
2012Dagstuhl Reports28 citations
Semantic Scholar
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average
R. Crowston, M. Fellows, G. Gutin, Mark Jones +3 more
2011Foundations of Software Technology and Theoretical Computer Science28 citations
Semantic Scholar
A Linear Kernel for Co-Path/Cycle Packing
Zhi-Zhong Chen, M. Fellows, Bin Fu, Hai-Tao Jiang +3 more
2010Algorithmic Applications in Management22 citations
Semantic Scholar
On the parameterized complexity of dynamic problems
Faisal N. Abu-Khzam, Judith Egan, M. Fellows, Frances A. Rosamond +1 more
2015Theoretical Computer Science21 citations Open access
Semantic Scholar
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable
M. Fellows, T. Friedrich, Danny Hermelin, Nina Narodytska +1 more
2011International Joint Conference on Artificial Intelligence21 citations Open access
Semantic Scholar
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
M. Dom, M. Fellows, Frances A. Rosamond
2009Workshop on Algorithms and Computation21 citations
Semantic Scholar
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
M. Fellows, Danny Hermelin, Frances A. Rosamond
2012Algorithmica20 citations
Semantic Scholar
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
R. Downey, Judith Egan, M. Fellows, Frances A. Rosamond +1 more
201419 citations Open access
Semantic Scholar
Myhill–Nerode Methods for Hypergraphs
René van Bevern, R. Downey, M. Fellows, Serge Gaspers +1 more
2012Algorithmica17 citations Open access
Semantic Scholar
Control Complexity in Bucklin and Fallback Voting
G. Erdélyi, M. Fellows, Lena Schend, J. Rothe
2011arXiv.org17 citations
Semantic Scholar
The Parameterized Complexity of Abduction
M. Fellows, A. Pfandler, Frances A. Rosamond, Stefan Rümmele
2012AAAI Conference on Artificial Intelligence16 citations Open access
Semantic Scholar
Parameterized control complexity in bucklin voting and in fallback voting
G. Erdélyi, M. Fellows
201015 citations
Semantic Scholar
Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday
A. Day, M. Fellows, Noam Greenberg, B. Khoussainov +2 more
201711 citations Open access
Semantic Scholar
Tractability and hardness of flood-filling games on trees
M. Fellows, U. Souza, F. Protti, Maise Dantas da Silva
2015Theoretical Computer Science11 citations Open access
Semantic Scholar
Parameterizing by the Number of Numbers
M. Fellows, Serge Gaspers, Frances A. Rosamond
2011Theory of Computing Systems11 citations
Semantic Scholar
Parameterized Complexity of the Firefighter Problem
C. Bazgan, M. Chopin, M. Fellows
2011International Symposium on Algorithms and Computation11 citations Open access
Semantic Scholar
Simultaneously Satisfying Linear Equations Over $\mathbb{F}_2$: MaxLin2 and Max-$r$-Lin2 Parameterized Above Average
R. Crowston, M. Fellows, G. Gutin, Mark Jones +3 more
201111 citations
Semantic Scholar
Determining the Winner of a Dodgson Election is Hard
M. Fellows, B. Jansen, D. Lokshtanov, Frances A. Rosamond +1 more
2010Foundations of Software Technology and Theoretical Computer Science11 citations
Semantic Scholar
Haplotype Inference Constrained by Plausible Haplotype Data
M. Fellows, Tzvika Hartman, Danny Hermelin, G. Landau +2 more
2009IEEE/ACM Transactions on Computational Biology & Bioinformatics11 citations
Semantic Scholar
On Solution Discovery via Reconfiguration
M. Fellows, M. Grobler, Nicole Megow, Amer E. Mouawad +4 more
2023European Conference on Artificial Intelligence10 citations Open access
Semantic Scholar
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
M. Fellows, Xue-Hou Tan, Bin-Hai Zhu
2013Lecture Notes in Computer Science9 citations
Semantic Scholar
The Parameterized Complexity of Stabbing Rectangles
M. Dom, M. Fellows, Frances A. Rosamond, S. Sikdar
2012Algorithmica9 citations
Semantic Scholar
Train Marshalling Is Fixed Parameter Tractable
Leo Brueggeman, M. Fellows, Rudolf Fleischer, M. Lackner +4 more
2012Fun with Algorithms9 citations Open access
Semantic Scholar
W-Hierarchies Defined by Symmetric Gates
M. Fellows, J. Flum, Danny Hermelin, Moritz Müller +1 more
2010Theory of Computing Systems9 citations
Semantic Scholar
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
M. Fellows, P. Giannopoulos, Christian Knauer, C. Paul +3 more
2010International Workshop on Graph-Theoretic Concepts in Computer Science9 citations
Semantic Scholar
Collaborating with Hans: Some Remaining Wonderments
M. Fellows, Frances A. Rosamond
2020Treewidth, Kernels, and Algorithms7 citations
Semantic Scholar
A Survey on the Complexity of Flood-Filling Games
M. Fellows, Frances A. Rosamond, Maise Dantas da Silva, U. Souza
2018Adventures Between Lower Bounds and Higher Altitudes7 citations Open access
Semantic Scholar
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints
Faisal N. Abu-Khzam, Judith Egan, M. Fellows, Frances A. Rosamond +1 more
2014International Conference on Combinatorial Optimization and Applications7 citations
Semantic Scholar
Kernelization Lower Bounds
R. Downey, M. Fellows
20137 citations
Semantic Scholar
Multivariate Complexity Theory
M. Fellows, Serge Gaspers, Frances A. Rosamond
2011Computer Science, The Hardware, Software and Heart of It7 citations
Semantic Scholar
Corrigendum to “Advice classes of parameterized tractability” [Ann. Pure Appl. Logic 84 (1) (1997) 119–138]
Li-Ming Cai, J. Chen, R. Downey, M. Fellows
20186 citations Open access
Semantic Scholar
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders
M. Fellows, B. Jansen
2013TOCT6 citations Open access
Semantic Scholar
Diversity in Combinatorial Optimization
Julien Baste, M. Fellows, Lars Jaffke, Tomáš Masařík +3 more
2019arXiv.org4 citations
Semantic Scholar
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number
M. Fellows, F. Protti, Frances A. Rosamond, Maise Dantas da Silva +1 more
2017Discrete Applied Mathematics4 citations Open access
Semantic Scholar
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves
E. Sam, M. Fellows, Frances A. Rosamond, P. Golovach
2023International/Italian Conference on Algorithms and Complexity3 citations
Semantic Scholar
Myhill–Nerode Methods for Hypergraphs
René van Bevern, Rodney G. Downey, M. Fellows, Serge Gaspers +1 more
2013Algorithmica3 citations Open access
Semantic Scholar