Michael R. Fellows - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Parameterized Algorithmics for Finding Connected Motifs in Biological NetworksNadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier. tcbb, 8(5):1296-1308, 2011. [doi]

Quadratic Kernelization for Convex Recoloring of TreesHans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer. algorithmica, 61(2):362-388, 2011. [doi]

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion ProblemsMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier. toct, 2(2):5, 2011. [doi]

On the complexity of some colorful problems parameterized by treewidthMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen. iandc, 209(2):143-153, 2011. [doi]

Recent Developments in the Theory of Pre-processingMichael R. Fellows. AAIM 2011: 4-5 [doi]

Special Issue on Parameterized Complexity of Discrete OptimizationMichael R. Fellows, Fedor V. Fomin, Gregory Gutin. disopt, 8(1):1, 2011. [doi]

Upper and lower bounds for finding connected motifs in vertex-colored graphsMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. jcss, 77(4):799-811, 2011. [doi]

Graph-based data clustering with overlapsMichael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann. disopt, 8(1):2-17, 2011. [doi]

Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints TractableMichael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond. IJCAI 2011: 522-527 [doi]

2010

Clustering with partial informationHans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond. TCS, 411(7-9):1202-1211, 2010. [doi]

A Linear Kernel for Co-Path/Cycle PackingZhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu. AAIM 2010: 90-102 [doi]

W-Hierarchies Defined by Symmetric GatesMichael R. Fellows, JÃ¶rg Flum, Danny Hermelin, Moritz MÃ¼ller, Frances A. Rosamond. mst, 46(2):311-339, 2010. [doi]

The parameterized complexity of some minimum label problemsMichael R. Fellows, Jiong Guo, Iyad A. Kanj. jcss, 76(8):727-740, 2010. [doi]

Parameterizing by the Number of NumbersMichael R. Fellows, Serge Gaspers, Frances A. Rosamond. iwpec 2010: 123-134 [doi]

Determining the Winner of a Dodgson Election is HardMichael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh. fsttcs 2010: 459-468 [doi]

2009

How similarity helps to efficiently compute Kemeny rankingsNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond. atal 2009: 657-664 [doi]

Fixed-parameter algorithms for Kemeny rankingsNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond. TCS, 410(45):4554-4570, 2009. [doi]

On problems without polynomial kernelsHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin. jcss, 75(8):423-434, 2009. [doi]

Derivation of algorithms for cutwidth and related graph layout parametersHans Leo Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos. jcss, 75(4):231-244, 2009. [doi]

Parameterized Complexity of Stabbing Rectangles and Squares in the PlaneMichael Dom, Michael R. Fellows, Frances A. Rosamond. walcom 2009: 298-309 [doi]

What Makes Equitable Connected Partition EasyRosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej SuchÃ½. iwpec 2009: 122-133 [doi]

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf NumberMichael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh. mst, 45(4):822-848, 2009. [doi]

Distortion Is Fixed Parameter TractableMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh. icalp 2009: 463-474 [doi]

The Parameterized Complexity of Some Minimum Label ProblemsMichael R. Fellows, Jiong Guo, Iyad A. Kanj. wg 2010: 88-99 [doi]

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion ProblemsMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier. mfcs 2009: 319-330 [doi]

Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter EcologyMichael R. Fellows. iwoca 2009: 2-10 [doi]

A Generalization of Nemhauser and Trotter s Local Optimization TheoremMichael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier. STACS 2009: 409-420 [doi]

Local Search: Is Brute-Force Avoidable?Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger. IJCAI 2009: 486-491 [doi]

Clique-Width is NP-CompleteMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. siamdm, 23(2):909-939, 2009. [doi]

Haplotype Inference Constrained by Plausible Haplotype DataMichael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg. cpm 2009: 339-352 [doi]

Well-Quasi-Orders in Subclasses of Bounded Treewidth GraphsMichael R. Fellows, Danny Hermelin, Frances A. Rosamond. iwpec 2009: 149-160 [doi]

On the parameterized complexity of multiple-interval graph problemsMichael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette. TCS, 410(1):53-61, 2009. [doi]

Graph-Based Data Clustering with OverlapsMichael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann. cocoon 2009: 516-526 [doi]

2008

Fixed-Parameter Algorithms for Kemeny ScoresNadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond. AAIM 2008: 60-71 [doi]

Parameterized Algorithms and Hardness Results for Some Graph Motif ProblemsNadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier. cpm 2008: 31-43 [doi]

Clustering with Partial InformationHans Leo Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond. mfcs 2008: 144-155 [doi]

On Problems without Polynomial Kernels (Extended Abstract)Hans Leo Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin. icalp 2008: 563-574 [doi]

Parameterized approximation of dominating set problemsRodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond. ipl, 109(1):68-70, 2008. [doi]

The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest EditorsRodney G. Downey, Michael R. Fellows, Michael A. Langston. cj, 51(1):1-6, 2008. [doi]

On the Parameterized Complexity of Layered Graph DrawingVida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood. algorithmica, 52(2):267-292, 2008. [doi]

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing ProblemsMichael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides. algorithmica, 52(2):167-176, 2008. [doi]

Leaf Powers and Their Properties: Using the TreesMichael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle. isaac 2008: 402-413 [doi]

A Purely Democratic Characterization of W[1]Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond. iwpec 2008: 103-114 [doi]

Facility Location Problems: A Parameterized ViewMichael R. Fellows, Henning Fernau. AAIM 2008: 188-199 [doi]

Graph Layout Problems Parameterized by Vertex CoverMichael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh. isaac 2008: 294-305 [doi]

2007

Crown Structures for Vertex Cover KernelizationFaisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters. mst, 41(3):411-430, 2007. [doi]

Quadratic Kernelization for Convex Recoloring of TreesHans Leo Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer. cocoon 2007: 86-96 [doi]

The Complexity of Polynomial-Time ApproximationLiming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond. mst, 41(3):459-477, 2007. [doi]

Connected Coloring Completion for General Graphs: Algorithms and ComplexityBenny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir. cocoon 2007: 75-85 [doi]

An O(2:::O(k):::n:::3:::) FPT Algorithm for the Undirected Feedback Vertex Set ProblemFrank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens. mst, 41(3):479-492, 2007. [doi]

Efficient Parameterized Preprocessing for Cluster EditingMichael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw. fct 2007: 312-321 [doi]

On the Complexity of Some Colorful Problems Parameterized by TreewidthMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen. cocoa 2007: 366-377 [doi]

The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf NumberMichael R. Fellows, Frances A. Rosamond. cie 2007: 268-277 [doi]

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored GraphsMichael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. icalp 2007: 340-351 [doi]

2006

Kernelization for Convex RecoloringHans Leo Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer. acid 2006: 23-35

The Undirected Feedback Vertex Set Problem Has a Poly(::::k::::) KernelKevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond. iwpec 2006: 192-202 [doi]

NONBLOCKER: Parameterized Algorithmics for minimum dominating setFrank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond. sofsem 2006: 237-245 [doi]

Parameterized Approximation ProblemsRodney G. Downey, Michael R. Fellows, Catherine McCartin. iwpec 2006: 121-129 [doi]

A Fixed-Parameter Approach to 2-Layer PlanarizationVida 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. algorithmica, 45(2):159-182, 2006. [doi]

Clique-width minimization is NP-hardMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. stoc 2006: 354-362 [doi]

The Lost Continent of Polynomial Time: Preprocessing and KernelizationMichael R. Fellows. iwpec 2006: 276-277 [doi]

On finding short resolution refutations and small unsatisfiable subsetsMichael R. Fellows, Stefan Szeider, Graham Wrightson. TCS, 351(3):351-359, 2006. [doi]

On The Parameterized Intractability Of Motif Search ProblemsMichael R. Fellows, Jens Gramm, Rolf Niedermeier. combinatorica, 26(2):141-167, 2006. [doi]

2005

A refined search tree technique for Dominating Set on planar graphsJochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege. jcss, 71(4):385-405, 2005. [doi]

An O(2:::O(k):::n:::3:::) FPT Algorithm for the Undirected Feedback Vertex Set ProblemFrank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens. cocoon 2005: 859-869 [doi]

FPT is P-Time Extremal Structure IVladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond. acid 2005: 1-41

Proving NP-hardness for clique-width I: non-approximability of sequential clique-widthMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. eccc, (080), 2005. [doi]

Proving NP-hardness for clique-width II: non-approximability of clique-widthMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. eccc, (081), 2005. [doi]

2004

Kernelization Algorithms for the Vertex Cover Problem: Theory and ExperimentsFaisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons. alenex 2004: 62-69

Polynomial-time data reduction for dominating setJochen Alber, Michael R. Fellows, Rolf Niedermeier. JACM, 51(3):363-384, 2004. [doi]

Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex CoverFrank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw. iwpec 2004: 271-280 [doi]

Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, ProceedingsRodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne, editors, Volume 3162 of Lecture Notes in Computer Science, Springer, 2004.

The dominating set problem is fixed parameter tractable for graphs of bounded genusJohn A. Ellis, Hongbing Fan, Michael R. Fellows. jal, 52(2):152-168, 2004. [doi]

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing ProblemsMichael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides. esa 2004: 311-322 [doi]

On Finding Short Resolution Refutations and Small Unsatisfiable SubsetsMichael R. Fellows, Stefan Szeider, Graham Wrightson. iwpec 2004: 223-234 [doi]

A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical ComputingMichael R. Fellows. esa 2004: 1-2 [doi]

2003

Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout AlgorithmsHans Leo Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos. mfcs 2003: 239-248 [doi]

Foreword from the guest editorsJianer Chen, Michael R. Fellows. jcss, 67(4):653, 2003. [doi]

An FPT Algorithm for Set SplittingFrank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond. criwg 2003: 180-191 [doi]

Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related ProblemsRodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond. ENTCS, 78, 2003. [doi]

Analogs & duals of the MAST problem for sequences & treesMichael R. Fellows, Michael T. Hallett, Ulrike Stege. jal, 49(1):192-216, 2003. [doi]

On the parametric complexity of schedules to minimize tardy tasksMichael R. Fellows, Catherine McCartin. TCS, 2(298):317-324, 2003. [doi]

New Directions and New Challenges in Algorithm Design and Complexity, ParameterizedMichael R. Fellows. wads 2003: 505-520 [doi]

Blow-Ups, Win/Win s, and Crown Rules: Some New Directions in FPTMichael R. Fellows. criwg 2003: 1-12 [doi]

2002

2001

Refined Search Tree Technique for DOMINATING SET on Planar GraphsJochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege. mfcs 2001: 111-122 [doi]

Forbidden minors to graphs with small feedback setsMichael J. Dinneen, Kevin Cattell, Michael R. Fellows. DM, 230(1-3):215-252, 2001. [doi]

Index sets and parametric reductionsRodney G. Downey, Michael R. Fellows. AML, 40(5):329-348, 2001. [doi]

On the Parameterized Complexity of Layered Graph DrawingVida 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. esa 2001: 488-499 [doi]

A Fixed-Parameter Approach to Two-Layer PlanarizationVida 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. gd 2002: 1-15 [doi]

Parameterized Complexity: The Main Ideas and Some Research FrontiersMichael R. Fellows. isaac 2001: 291-307 [doi]

2000

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsHans Leo Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy Warnow. TCS, 244(1-2):167-188, 2000. [doi]

On computing graph minor obstruction setsKevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston. TCS, 233(1-2):107-127, 2000. [doi]

The complexity of irredundant sets parameterized by sizeRodney G. Downey, Michael R. Fellows, Venkatesh Raman. DAM, 100(3):155-167, 2000.

Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other ProblemsMichael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege. fsttcs 2000: 240-251 [doi]

Parameterized Complexity: The Main Ideas and Connections to Practical ComputingMichael R. Fellows. dagstuhl 2002: 51-77 [doi]

PreviousNext