Michael R. Fellows
Orcid: 0000-0002-6148-9212Affiliations:
- University of Bergen, Department of Informatics, Norway
- Charles Darwin University, Darwin, Australia (former)
- University of Newcastle, NSW, Australia (former)
- University of Victoria, Department of Computer Science, BC, Canada (former)
- University of Idaho, Moscow, ID, USA (former)
- University of New Mexico, Albuquerque, NM, USA (former)
- University of California, San Diego, CA, USA (PhD 1985)
According to our database1,
Michael R. Fellows
authored at least 202 papers
between 1987 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on uib.no
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
On csauthors.net:
Bibliography
2023
Dagstuhl Reports, 2023
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
2022
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.
Artif. Intell., 2022
2021
2020
Proceedings of the Treewidth, Kernels, and Algorithms, 2020
2019
2018
J. Comput. Syst. Sci., 2018
J. Comput. Syst. Sci., 2018
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.
Discret. Appl. Math., 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018
2017
2016
ACM Trans. Comput. Theory, 2016
Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You.
Bull. EATCS, 2016
2015
J. Comput. Syst. Sci., 2015
J. Comput. Syst. Sci., 2015
Electron. Notes Discret. Math., 2015
2014
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.
ACM Trans. Comput. Theory, 2014
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
J. Comput. Syst. Sci., 2014
Proceedings of the Combinatorial Optimization and Applications, 2014
2013
Texts in Computer Science, Springer, ISBN: 978-1-4471-5559-1, 2013
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
Theor. Comput. Sci., 2013
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
Eur. J. Comb., 2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
2012
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
CoRR, 2012
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.
Algorithmica, 2012
Proceedings of the Fun with Algorithms - 6th International Conference, 2012
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
2011
ACM Trans. Comput. Theory, 2011
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
J. Comput. Syst. Sci., 2011
J. Comput. Syst. Sci., 2011
Inf. Comput., 2011
Discret. Optim., 2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011
2010
J. Comput. Syst. Sci., 2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
Theor. Comput. Sci., 2009
Theory Comput. Syst., 2009
J. Comput. Syst. Sci., 2009
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009
2008
CoRR, 2008
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors.
Comput. J., 2008
Algorithmica, 2008
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008
Proceedings of the Algorithmic Aspects in Information and Management, 2008
2007
An O(2<sup>O(k)</sup>n<sup>3</sup>) FPT Algorithm for the Undirected Feedback Vertex Set Problem.
Theory Comput. Syst., 2007
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
Proceedings of the Computation and Logic in the Real World, 2007
2006
Theor. Comput. Sci., 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
Kernelization for Convex Recoloring.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006
2005
J. Comput. Syst. Sci., 2005
Electron. Colloquium Comput. Complex., 2005
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex., 2005
FPT is P-Time Extremal Structure I.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005
2004
J. Algorithms, 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004
A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing.
Proceedings of the Algorithms, 2004
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004
2003
Theor. Comput. Sci., 2003
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.
Proceedings of the Computing: the Australasian Theory Symposiumm, 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003
2002
Proceedings of the Computing: the Australasian Theory Symposium, 2002
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.
Proceedings of the Algorithm Theory, 2002
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Computer Science Unplugged - an enrichment and extension programme for primary-aged children.
csunplugged.org, 2002
2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Proceedings of the Graph Drawing, 9th International Symposium, 2001
Proceedings of the Algorithms, 2001
2000
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.
Theor. Comput. Sci., 2000
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000
1999
Monographs in Computer Science, Springer, ISBN: 038794883X, 1999
SIAM J. Comput., 1999
Computational Tractability: The View From Mars.
Bull. EATCS, 1999
1998
Theor. Comput. Sci., 1998
Networks, 1998
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
Proceedings of the Algorithms, 1998
1997
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals.
J. Univers. Comput. Sci., 1997
Arch. Math. Log., 1997
Parameterized complexity: A framework for systematically confronting computational intractability.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1996
Inf. Process. Lett., 1996
The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1].
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
Proceedings of the Proof Complexity and Feasible Arithmetics, 1996
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996
1995
Theor. Comput. Sci., 1995
Theor. Comput. Sci., 1995
SIAM J. Comput., 1995
Oper. Res. Lett., 1995
Discret. Appl. Math., 1995
Comput. Appl. Biosci., 1995
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues.
Ann. Pure Appl. Log., 1995
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
1994
J. Comput. Syst. Sci., 1994
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the STACS 94, 1994
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994
1993
Proceedings of the STACS 93, 1993
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993
Proceedings of the Applied Algebra, 1993
1992
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design.
SIAM J. Discret. Math., 1992
Des. Codes Cryptogr., 1992
Parallel Self-Reducibility.
Proceedings of the Computing and Information, 1992
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
Proceedings of the Discrete Mathematics in the Schools, 1992
Fixed Parameter Tractability and Completeness.
Proceedings of the Complexity Theory: Current Research, 1992
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992
1991
Australas. J Comb., 1991
Induced minors and related problems.
Proceedings of the Graph Structure Theory, 1991
Finite automata, bounded treewidth, and well-quasiordering.
Proceedings of the Graph Structure Theory, 1991
Proceedings of the Constructivity in Computer Science, 1991
Proceedings of the Applied Algebra, 1991
1990
1989
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation.
Proceedings of the Computers and Mathematics, 1989
1988
IEEE Trans. Computers, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987