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 100 of 198  
    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
    Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw.
    On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.
    Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings 2014 (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
    Conference paper
    Michael R. Fellows, Henning Fernau.
    Facility location problems: A parameterized view.
    Discrete Applied Mathematics 2011, Volume 159 (0) 2011
    Conference paper
    Michael R. Fellows.
    Recent Developments in the Theory of Pre-processing.
    Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier.
    Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
    IEEE/ACM Trans. Comput. Biology Bioinform. 2011, Volume 8 (0) 2011
    Conference paper
    Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond.
    Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable.
    IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 2011 (0) 2011
    Conference paper
    Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer.
    Quadratic Kernelization for Convex Recoloring of Trees.
    Algorithmica 2011, Volume 61 (0) 2011
    Conference paper
    Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier.
    A generalization of Nemhauser and Trotter?s local optimization theorem.
    J. Comput. Syst. Sci. 2011, Volume 77 (0) 2011
    Conference paper
    Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg.
    Haplotype Inference Constrained by Plausible Haplotype Data.
    IEEE/ACM Trans. Comput. Biology Bioinform. 2011, Volume 8 (0) 2011
    Conference paper
    Cristina Bazgan, Morgan Chopin, Michael R. Fellows.
    Parameterized Complexity of the Firefighter Problem.
    Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo.
    Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India 2011 (0) 2011
    Book chapter
    Michael R. Fellows, Serge Gaspers, Frances A. Rosamond.
    Multivariate Complexity Theory.
    Computer Science, The Hardware, Software and Heart of It 2011 (0) 2011
    Conference paper
    Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu.
    A Linear Kernel for Co-Path/Cycle Packing.
    Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings 2010 (0) 2010
    Journal article
    Michael R. Fellows, Serge Gaspers, Frances A. Rosamond.
    Parameterizing by the Number of Numbers
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Michael R. Fellows, Jiong Guo, Iyad A. Kanj.
    The parameterized complexity of some minimum label problems.
    J. Comput. Syst. Sci. 2010, Volume 76 (0) 2010
    Conference paper
    Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances Rosamond, Sue Whitesides, Nathan Yu.
    Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.
    Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers 2010 (0) 2010
    Conference paper
    Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh.
    Determining the Winner of a Dodgson Election is Hard.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India 2010 (0) 2010
    Conference paper
    Michael R. Fellows, Serge Gaspers, Frances A. Rosamond.
    Parameterizing by the Number of Numbers.
    Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings 2010 (0) 2010
    Journal article
    Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond.
    W-Hierarchies Defined by Symmetric Gates.
    Theory Comput. Syst. 2010, Volume 46 (0) 2010
    Conference paper
    Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond.
    Clustering with partial information.
    Theor. Comput. Sci. 2010, Volume 411 (0) 2010
    Journal article
    Gábor Erdélyi, Michael R. Fellows.
    Parameterized Control Complexity in Fallback Voting
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond.
    How similarity helps to efficiently compute Kemeny rankings.
    8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 1 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann.
    Graph-Based Data Clustering with Overlaps.
    Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg.
    Haplotype Inference Constrained by Plausible Haplotype Data.
    Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh.
    Distortion Is Fixed Parameter Tractable.
    Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger.
    Local Search: Is Brute-Force Avoidable?
    IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009 2009 (0) 2009
    Conference paper
    Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý.
    What Makes Equitable Connected Partition Easy.
    Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Danny Hermelin, Frances A. Rosamond.
    Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.
    Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier.
    A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
    Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Jiong Guo, Iyad A. Kanj.
    The Parameterized Complexity of Some Minimum Label Problems.
    Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers 2010 (0) 2009
    Conference paper
    Michael Dom, Michael R. Fellows, Frances A. Rosamond.
    Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.
    WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Michael R. Fellows.
    Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology.
    Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers 2009 (0) 2009
    Conference paper
    Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier.
    A Generalization of Nemhauser and Trotter's Local Optimization Theorem
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Michael R. Fellows, Panos Giannopoulos, Christian Knauer, C. Paul, Frances A. Rosamond, Sue Whitesides, N. Yu.
    Abstract Milling with Turn Costs
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos.
    Derivation of algorithms for cutwidth and related graph layout parameters.
    J. Comput. Syst. Sci. 2009, Volume 75 (0) 2009
    Conference paper
    Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin.
    On problems without polynomial kernels.
    J. Comput. Syst. Sci. 2009, Volume 75 (0) 2009
    Conference paper
    Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh.
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
    Theory Comput. Syst. 2009, Volume 45 (0) 2009
    Conference paper
    Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette.
    On the parameterized complexity of multiple-interval graph problems.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond.
    Fixed-parameter algorithms for Kemeny rankings.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier.
    A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
    26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009 (0) 2009
    Journal article
    Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider.
    Clique-Width is NP-Complete.
    SIAM J. Discrete Math. 2009, Volume 23 (0) 2009
    Conference paper
    Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond.
    Fixed-Parameter Algorithms for Kemeny Scores.
    Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Michael R. Fellows, Henning Fernau.
    Facility Location Problems: A Parameterized View.
    Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier.
    Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.
    Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin.
    On Problems without Polynomial Kernels (Extended Abstract).
    Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games 2008 (0) 2008
    Conference paper
    Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle.
    Leaf Powers and Their Properties: Using the Trees.
    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh.
    Graph Layout Problems Parameterized by Vertex Cover.
    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond.
    A Purely Democratic Characterization of W[1].
    Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond.
    Clustering with Partial Information.
    Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides.
    Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
    Algorithmica 2008, Volume 52 (0) 2008
    Conference paper
    Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood.
    On the Parameterized Complexity of Layered Graph Drawing.
    Algorithmica 2008, Volume 52 (0) 2008
    Conference paper
    Rodney G. Downey, Michael R. Fellows, Michael A. Langston.
    The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors.
    Comput. J. 2008, Volume 51 (0) 2008
    Conference paper
    Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh.
    Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond.
    Parameterized approximation of dominating set problems.
    Inf. Process. Lett. 2009, Volume 109 (0) 2008
    Conference paper
    Michael R. Fellows, Frances A. Rosamond.
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
    Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer.
    Quadratic Kernelization for Convex Recoloring of Trees.
    Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir.
    Connected Coloring Completion for General Graphs: Algorithms and Complexity.
    Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw.
    Efficient Parameterized Preprocessing for Cluster Editing.
    Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette.
    Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
    Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings 2007 (0) 2007
    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.
    Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond.
    The Complexity of Polynomial-Time Approximation.
    Theory Comput. Syst. 2007, Volume 41 (0) 2007
    Conference paper
    Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens.
    An O(2
    Theory Comput. Syst. 2007, Volume 41 (0) 2007
    Conference paper
    Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters.
    Crown Structures for Vertex Cover Kernelization.
    Theory Comput. Syst. 2007, Volume 41 (0) 2007
    Conference paper
    Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer.
    Kernelization for Convex Recoloring.
    Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK 2006 (0) 2006
    Conference paper
    Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond.
    The Undirected Feedback Vertex Set Problem Has a Poly(
    Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Rodney G. Downey, Michael R. Fellows, Catherine McCartin.
    Parameterized Approximation Problems.
    Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Michael R. Fellows.
    The Lost Continent of Polynomial Time: Preprocessing and Kernelization.
    Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond.
    NONBLOCKER: Parameterized Algorithmics for minimum dominating set.
    SOFSEM 2006: Theory and Practice of Computer Science, 32nd Conference on Current Trends in Theory and Practice of Computer Science, Merín, Czech Republic, January 21-27, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider.
    Clique-width minimization is NP-hard.
    Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006 2006 (0) 2006
    Conference paper
    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.
    A Fixed-Parameter Approach to 2-Layer Planarization.
    Algorithmica 2006, Volume 45 (0) 2006
    Conference paper
    Michael R. Fellows, Jens Gramm, Rolf Niedermeier.
    On The Parameterized Intractability Of Motif Search Problems.
    Combinatorica 2006, Volume 26 (0) 2006
    Conference paper
    Michael R. Fellows, Stefan Szeider, Graham Wrightson.
    On finding short resolution refutations and small unsatisfiable subsets.
    Theor. Comput. Sci. 2006, Volume 351 (0) 2006
    Conference paper
    Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond.
    FPT is P-Time Extremal Structure I.
    Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK 2005 (0) 2005
    Conference paper
    Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens.
    An O(2
    Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider.
    Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider.
    Proving NP-hardness for clique-width II: non-approximability of clique-width
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Show item 1 to 100 of 198  

    Your query returned 198 matches in the database.