Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMichael R. Fellows
Mike Fellows
Person information
- affiliation: Charles Darwin University, Darwin, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j101]Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza:
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. Discrete Applied Mathematics 245: 94-100 (2018)- [j100]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93: 30-40 (2018) - [j99]Michael R. Fellows, Frances A. Rosamond:
A brief history of Edward K. Blum and the Journal of Computer and System Sciences. J. Comput. Syst. Sci. 94: 2-10 (2018) - [c102]Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller:
What Is Known About Vertex Cover Kernelization? Adventures Between Lower Bounds and Higher Altitudes 2018: 330-356 - [c101]Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza:
A Survey on the Complexity of Flood-Filling Games. Adventures Between Lower Bounds and Higher Altitudes 2018: 357-376 - [i14]Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller:
What is known about Vertex Cover Kernelization? CoRR abs/1811.09429 (2018) - 2017
- [c100]
- [e5]Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond:
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4 [contents] - 2016
- [j98]Michael R. Fellows:
Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You. Bulletin of the EATCS 119 (2016) - [j97]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. TOCT 8(2): 6:1-6:12 (2016) - 2015
- [j96]René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729 (2015) - [j95]Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva:
The Flood-It game parameterized by the vertex cover number. Electronic Notes in Discrete Mathematics 50: 35-40 (2015) - [j94]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4): 632-660 (2015) - [j93]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. 81(4): 661-670 (2015) - [j92]Michael R. Fellows, Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Tractability and hardness of flood-filling games on trees. Theor. Comput. Sci. 576: 102-116 (2015) - [j91]Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
On the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607: 426-434 (2015) - 2014
- [j90]Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran 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. 80(4): 687-696 (2014) - [j89]Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen:
Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80(7): 1285-1297 (2014) - [j88]Michael R. Fellows, Bart M. P. Jansen:
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. TOCT 6(4): 16:1-16:26 (2014) - [c99]Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. COCOA 2014: 625-636 - 2013
- [b3]Rodney G. Downey, Michael R. Fellows:
Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer 2013, ISBN 978-1-4471-5558-4, pp. I-SSS, 3-707 - [j87]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. 34(3): 541-566 (2013) - [j86]Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472: 81-89 (2013) - [j85]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Distortion is Fixed Parameter Tractable. TOCT 5(4): 16:1-16:20 (2013) - [c98]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468 - [c97]René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: 372-382 - [c96]Michael R. Fellows, Bart M. P. Jansen:
FPT Is Characterized by Useful Obstruction Sets. WG 2013: 261-273 - [e4]Michael R. Fellows, Xuehou Tan, Binhai Zhu:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science 7924, Springer 2013, ISBN 978-3-642-38755-5 [contents] - [i13]Michael R. Fellows, Bart M. P. Jansen:
FPT is Characterized by Useful Obstruction Sets. CoRR abs/1305.3102 (2013) - 2012
- [j84]Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar:
The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62(1-2): 564-594 (2012) - [j83]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond:
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. Algorithmica 64(1): 3-18 (2012) - [j82]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. 78(3): 707-719 (2012) - [j81]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012) - [c95]Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele:
The Parameterized Complexity of Abduction. AAAI 2012 - [c94]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 2012: 51-56 - [c93]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012: 351-362 - [i12]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 abs/1211.1299 (2012) - [i11]Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh:
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241). Dagstuhl Reports 2(6): 26-50 (2012) - 2011
- [j80]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 61(2): 362-388 (2011) - [j79]Michael R. Fellows, Henning Fernau:
Facility location problems: A parameterized view. Discrete Applied Mathematics 159(11): 1118-1130 (2011) - [j78]Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin:
Special Issue on Parameterized Complexity of Discrete Optimization. Discrete Optimization 8(1): 1 (2011) - [j77]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-based data clustering with overlaps. Discrete Optimization 8(1): 2-17 (2011) - [j76]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. 209(2): 143-153 (2011) - [j75]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. 77(4): 799-811 (2011) - [j74]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A generalization of Nemhauser and Trotterʼs local optimization theorem. J. Comput. Syst. Sci. 77(6): 1141-1158 (2011) - [j73]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. 8(5): 1296-1308 (2011) - [j72]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. 8(6): 1692-1699 (2011) - [j71]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. TOCT 2(2): 5:1-5:23 (2011) - [c92]
- [c91]Robert Crowston, Michael R. Fellows, Gregory Z. 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. FSTTCS 2011: 229-240 - [c90]Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527 - [c89]Cristina Bazgan, Morgan Chopin, Michael R. Fellows:
Parameterized Complexity of the Firefighter Problem. ISAAC 2011: 643-652 - [p1]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Multivariate Complexity Theory. Computer Science, The Hardware, Software and Heart of It 2011: 269-293 - [i10]Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe:
Control Complexity in Bucklin and Fallback Voting. CoRR abs/1103.2230 (2011) - 2010
- [j70]Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76(8): 727-740 (2010) - [j69]Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46(2): 311-339 (2010) - [j68]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010) - [c88]Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu:
A Linear Kernel for Co-Path/Cycle Packing. AAIM 2010: 90-102 - [c87]Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh:
Determining the Winner of a Dodgson Election is Hard. FSTTCS 2010: 459-468 - [c86]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. IPEC 2010: 123-134 - [c85]Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG 2010: 123-134 - [i9]Gábor Erdélyi, Michael R. Fellows:
Parameterized Control Complexity in Fallback Voting. CoRR abs/1004.3659 (2010) - [i8]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. CoRR abs/1007.2021 (2010)
2000 – 2009
- 2009
- [j67]Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. 75(4): 231-244 (2009) - [j66]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009) - [j65]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. 45(4): 822-848 (2009) - [j64]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Clique-Width is NP-Complete. SIAM J. Discrete Math. 23(2): 909-939 (2009) - [j63]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette:
On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009) - [j62]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009) - [c84]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664 - [c83]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 - [c82]Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg:
Haplotype Inference Constrained by Plausible Haplotype Data. CPM 2009: 339-352 - [c81]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474 - [c80]Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger:
Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491 - [c79]Michael R. Fellows:
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. IWOCA 2009: 2-10 - [c78]Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý:
What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133 - [c77]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond:
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160 - [c76]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330 - [c75]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420 - [c74]Michael Dom, Michael R. Fellows, Frances A. Rosamond:
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309 - [c73]Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99 - [e3]Stephan Diehl, Michael R. Fellows, Ulrike Stege:
Perspectives Workshop: Preventing the Brainware Crisis, 31.03. - 03.04.2009. Dagstuhl Seminar Proceedings 09142, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i7]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. CoRR abs/0902.2149 (2009) - [i6]Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Abstract Milling with Turn Costs. CoRR abs/0912.1050 (2009) - 2008
- [j61]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 52(2): 167-176 (2008) - [j60]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 52(2): 267-292 (2008) - [j59]Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Comput. J. 51(1): 1-6 (2008) - [j58]Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond:
Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008) - [c72]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 - [c71]Michael R. Fellows, Henning Fernau:
Facility Location Problems: A Parameterized View. AAIM 2008: 188-199 - [c70]Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 - [c69]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574 - [c68]Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305 - [c67]Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle:
Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413 - [c66]Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114 - [c65]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with Partial Information. MFCS 2008: 144-155 - [i5]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 abs/0804.3028 (2008) - 2007
- [j57]Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters:
Crown Structures for Vertex Cover Kernelization. Theory Comput. Syst. 41(3): 411-430 (2007) - [j56]Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond:
The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41(3): 459-477 (2007) - [j55]Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst. 41(3): 479-492 (2007) - [c64]Michael R. Fellows, Frances A. Rosamond:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE 2007: 268-277 - [c63]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. COCOA 2007: 366-377 - [c62]Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir:
Connected Coloring Completion for General Graphs: Algorithms and Complexity. COCOON 2007: 75-85 - [c61]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96 - [c60]Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321 - [c59]Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351 - 2006
- [j54]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 45(2): 159-182 (2006) - [j53]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
On The Parameterized Intractability Of Motif Search Problems. Combinatorica 26(2): 141-167 (2006) - [j52]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006) - [c58]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Kernelization for Convex Recoloring. ACiD 2006: 23-35 - [c57]Rodney G. Downey, Michael R. Fellows, Catherine McCartin:
Parameterized Approximation Problems. IWPEC 2006: 121-129 - [c56]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(k) Kernel. IWPEC 2006: 192-202 - [c55]Michael R. Fellows:
The Lost Continent of Polynomial Time: Preprocessing and Kernelization. IWPEC 2006: 276-277 - [c54]Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond:
NONBLOCKER: Parameterized Algorithmics for minimum dominating set. SOFSEM 2006: 237-245 - [c53]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Clique-width minimization is NP-hard. STOC 2006: 354-362 - 2005
- [j51]Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia:
Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2): 216-231 (2005) - [j50]Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
A refined search tree technique for Dominating Set on planar graphs. J. Comput. Syst. Sci. 71(4): 385-405 (2005) - [c52]Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond:
FPT is P-Time Extremal Structure I. ACiD 2005: 1-41 - [c51]Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. COCOON 2005: 859-869 - [i4]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)(080) (2005) - [i3]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)(081) (2005) - 2004
- [j49]