Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Michael R.
    Last name: Fellows
    DBLP: f/MichaelRFellows
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 197  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, E. J. Kim, Frances A. Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo.
    Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
    J. Comput. Syst. Sci. 2014, Volume 80 (0) 2014
    Conference paper
    Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen.
    Parameterized complexity of firefighting.
    J. Comput. Syst. Sci. 2014, Volume 80 (0) 2014
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen.
    FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders.
    TOCT 2014, Volume 6 (0) 2014
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond.
    Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
    Eur. J. Comb. 2013, Volume 34 (0) 2013
    Journal article
    Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond.
    Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
    Theor. Comput. Sci. 2013, Volume 472 (0) 2013
    Journal article
    Michael R. Fellows, Bart M. P. Jansen.
    FPT is Characterized by Useful Obstruction Sets
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai.
    Tractable Parameterizations for the Minimum Linear Arrangement Problem.
    Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen.
    FPT Is Characterized by Useful Obstruction Sets.
    Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers 2013 (0) 2013
    Conference paper
    Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh.
    Distortion is Fixed Parameter Tractable.
    TOCT 2013, Volume 5 (0) 2013
    Conference paper
    René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond.
    Myhill-Nerode Methods for Hypergraphs.
    Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings 2013 (0) 2013
    Journal article
    Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar.
    The Parameterized Complexity of Stabbing Rectangles.
    Algorithmica 2012, Volume 62 (0) 2012
    Conference paper
    Michael R. Fellows, Serge Gaspers, Frances A. Rosamond.
    Parameterizing by the Number of Numbers.
    Theory Comput. Syst. 2012, Volume 50 (0) 2012
    Conference paper
    Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger.
    Local search: Is brute-force avoidable?
    J. Comput. Syst. Sci. 2012, Volume 78 (0) 2012
    Journal article
    Michael R. Fellows, Danny Hermelin, Frances A. Rosamond.
    Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.
    Algorithmica 2012, Volume 64 (0) 2012
    Conference paper
    Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond.
    Train Marshalling Is Fixed Parameter Tractable.
    Fun with Algorithms - 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai.
    Parameterized Approximation via Fidelity Preserving Transformations.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele.
    The Parameterized Complexity of Abduction.
    Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada. 2012 (0) 2012
    Journal article
    René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond.
    How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh.
    Data Reduction and Problem Kernels (Dagstuhl Seminar 12241).
    Dagstuhl Reports 2012, Volume 2 (0) 2012
    Conference paper
    Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen.
    On the complexity of some colorful problems parameterized by treewidth.
    Inf. Comput. 2011, Volume 209 (0) 2011
    Journal article
    Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann.
    Graph-based data clustering with overlaps.
    Discrete Optimization 2011, Volume 8 (0) 2011
    Journal article
    Michael R. Fellows, Fedor V. Fomin, Gregory Gutin.
    Special Issue on Parameterized Complexity of Discrete Optimization.
    Discrete Optimization 2011, Volume 8 (0) 2011
    Journal article
    Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe.
    Control Complexity in Bucklin and Fallback Voting
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette.
    Upper and lower bounds for finding connected motifs in vertex-colored graphs.
    J. Comput. Syst. Sci. 2011, Volume 77 (0) 2011
    Conference paper
    Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier.
    A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
    TOCT 2010, Volume 2 (0) 2011
    Show item 1 to 25 of 197  

    Your query returned 197 matches in the database.