default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael R. Fellows
Mike Fellows
Person information
- affiliation: University of Bergen, Department of Informatics, Norway
- affiliation (former): Charles Darwin University, Darwin, Australia
- affiliation (former): University of Newcastle, NSW, Australia
- affiliation (former): University of Victoria, Department of Computer Science, BC, Canada
- affiliation (former): University of Idaho, Moscow, ID, USA
- affiliation (former): University of New Mexico, Albuquerque, NM, USA
- affiliation (PhD 1985): University of California, San Diego, CA, USA
- award: Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c112]Michael R. Fellows
, Frances A. Rosamond:
Games That Cannot Go on Forever! Active Participation in Research Is the Main Issue for Kids. CMSC 2024: 15-35- [c111]Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh:
Breaking a Graph into Connected Components with Small Dominating Sets. MFCS 2024: 24:1-24:15 - 2023
- [c110]Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach:
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. CIAC 2023: 353-367 - [c109]Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz:
On Solution Discovery via Reconfiguration. ECAI 2023: 700-707 - [i19]Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz:
On Solution Discovery via Reconfiguration. CoRR abs/2304.14295 (2023) - [i18]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i17]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [j100]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303: 103644 (2022) - 2021
- [i16]Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond:
Parameterized String Equations. CoRR abs/2104.14171 (2021) - 2020
- [c108]Michael R. Fellows, Frances A. Rosamond:
Collaborating with Hans: Some Remaining Wonderments. Treewidth, Kernels, and Algorithms 2020: 7-17 - [c107]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI 2020: 1119-1125
2010 – 2019
- 2019
- [i15]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity in Combinatorial Optimization. CoRR abs/1903.07410 (2019) - 2018
- [j99]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. Discret. Appl. Math. 245: 94-100 (2018) - [j98]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93: 30-40 (2018) - [j97]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) - [c106]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 - [c105]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
- [c104]Michael R. Fellows:
Surfing with Rod. Computability and Complexity 2017: 9-18 - [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
- [j96]Michael R. Fellows:
Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You. Bull. EATCS 119 (2016) - [j95]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory 8(2): 6:1-6:12 (2016) - 2015
- [j94]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) - [j93]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. Electron. Notes Discret. Math. 50: 35-40 (2015) - [j92]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) - [j91]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) - [j90]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) - [j89]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
- [j88]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) - [j87]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) - [j86]Michael R. Fellows, Bart M. P. Jansen:
FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. ACM Trans. Comput. Theory 6(4): 16:1-16:26 (2014) - [c103]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 - [j85]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) - [j84]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) - [j83]Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh:
Distortion is Fixed Parameter Tractable. ACM Trans. Comput. Theory 5(4): 16:1-16:20 (2013) - [c102]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468 - [c101]René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: 372-382 - [c100]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
- [j82]Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar:
The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62(1-2): 564-594 (2012) - [j81]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) - [j80]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) - [j79]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012) - [c99]Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele:
The Parameterized Complexity of Abduction. AAAI 2012: 743-749 - [c98]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 - [c97]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
- [j78]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) - [j77]Michael R. Fellows, Henning Fernau:
Facility location problems: A parameterized view. Discret. Appl. Math. 159(11): 1118-1130 (2011) - [j76]Michael R. Fellows, Fedor V. Fomin, Gregory Z. Gutin:
Special Issue on Parameterized Complexity of Discrete Optimization. Discret. Optim. 8(1): 1 (2011) - [j75]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-based data clustering with overlaps. Discret. Optim. 8(1): 2-17 (2011) - [j74]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) - [j73]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) - [j72]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) - [j71]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. Biol. Bioinform. 8(5): 1296-1308 (2011) - [j70]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. Biol. Bioinform. 8(6): 1692-1699 (2011) - [j69]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. ACM Trans. Comput. Theory 2(2): 5:1-5:23 (2011) - [c96]Michael R. Fellows:
Recent Developments in the Theory of Pre-processing. FAW-AAIM 2011: 4-5 - [c95]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 - [c94]Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527 - [c93]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
- [j68]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) - [j67]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) - [j66]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) - [c92]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 - [c91]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 - [c90]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. IPEC 2010: 123-134 - [c89]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
- [j65]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) - [j64]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) - [j63]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) - [j62]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Clique-Width is NP-Complete. SIAM J. Discret. Math. 23(2): 909-939 (2009) - [j61]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) - [j60]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) - [c88]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 - [c87]Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 - [c86]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 - [c85]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 - [c84]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 - [c83]Michael R. Fellows:
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. IWOCA 2009: 2-10 - [c82]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 - [c81]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond:
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160 - [c80]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. MFCS 2009: 319-330 - [c79]Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier:
A Generalization of Nemhauser and Trotter's Local Optimization Theorem. STACS 2009: 409-420 - [c78]Michael Dom, Michael R. Fellows, Frances A. Rosamond:
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309 - [c77]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
- [j59]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) - [j58]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) - [j57]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) - [j56]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) - [c76]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 - [c75]Michael R. Fellows, Henning Fernau:
Facility Location Problems: A Parameterized View. AAIM 2008: 188-199 - [c74]Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 - [c73]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574 - [c72]Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305 - [c71]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 - [c70]Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond:
A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114 - [c69]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
- [j55]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) - [j54]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) - [j53]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) - [c68]Michael R. Fellows, Frances A. Rosamond:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE 2007: 268-277 - [c67]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 - [c66]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 - [c65]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 - [c64]Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321 - [c63]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
- [j52]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) - [j51]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
On The Parameterized Intractability Of Motif Search Problems. Comb. 26(2): 141-167 (2006) - [j50]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006) - [c62]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 - [c61]Rodney G. Downey, Michael R. Fellows, Catherine McCartin:
Parameterized Approximation Problems. IWPEC 2006: 121-129 - [c60]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 - [c59]Michael R. Fellows:
The Lost Continent of Polynomial Time: Preprocessing and Kernelization. IWPEC 2006: 276-277 - [c58]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 - [c57]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Clique-width minimization is NP-hard. STOC 2006: 354-362 - 2005
- [j49]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) - [j48]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) - [c56]Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond:
FPT is P-Time Extremal Structure I. ACiD 2005: 1-41 - [c55]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. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Proving NP-hardness for clique-width II: non-approximability of clique-width. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j47]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial-time data reduction for dominating set. J. ACM 51(3): 363-384 (2004) - [j46]John A. Ellis, Hongbing Fan, Michael R. Fellows:
The dominating set problem is fixed parameter tractable for graphs of bounded genus. J. Algorithms 52(2): 152-168 (2004) - [c54]Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons:
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. ALENEX/ANALC 2004: 62-69 - [c53]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. CCC 2004: 150-160 - [c52]Michael R. Fellows:
A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. ESA 2004: 1-2 - [c51]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. ESA 2004: 311-322 - [c50]Michael R. Fellows, Stefan Szeider, Graham Wrightson:
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234 - [c49]Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw:
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover. IWPEC 2004: 271-280 - [c48]Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle:
Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244 - [c47]Benny Chor, Mike Fellows, David W. Juedes:
Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. WG 2004: 257-269 - [e2]Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne:
Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3162, Springer 2004, ISBN 3-540-23071-8 [contents] - 2003
- [j45]Tim Bell, Harold W. Thimbleby, Mike Fellows, Ian H. Witten, Neal Koblitz, Matthew Powell:
Explaining cryptographic systems. Comput. Educ. 40(3): 199-215 (2003) - [j44]Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
Analogs & duals of the MAST problem for sequences & trees. J. Algorithms 49(1): 192-216 (2003) - [j43]Jianer Chen, Michael R. Fellows:
Foreword from the guest editors. J. Comput. Syst. Sci. 67(4): 653 (2003) - [j42]Michael R. Fellows, Catherine McCartin:
On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 298(2): 317-324 (2003) - [c46]Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248 - [c45]Michael R. Fellows:
New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. WADS 2003: 505-520 - [c44]Michael R. Fellows:
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. WG 2003: 1-12 - [c43]Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond:
An FPT Algorithm for Set Splitting. WG 2003: 180-191 - [c42]Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond:
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. CATS 2003: 209-222 - 2002
- [b2]Tim Bell, Ian H. Witten, Michael R. Fellows:
Computer Science Unplugged - an enrichment and extension programme for primary-aged children. csunplugged.org 2002, pp. I-IV, 1-105 - [c41]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. STACS 2002: 262-273 - [c40]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case. SWAT 2002: 150-159 - [c39]John A. Ellis, Hongbing Fan, Michael R. Fellows:
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus. SWAT 2002: 180-189 - [c38]Michael R. Fellows:
Parameterized Complexity: The Main Ideas and Connections to Practical Computing. CATS 2002: 1-19 - [i2]Michael R. Fellows, Jens Gramm, Rolf Niedermeier:
Parameterized Intractability of Motif Search Problems. CoRR cs.CC/0205056 (2002) - [i1]Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Polynomial Time Data Reduction for Dominating Set. CoRR cs.DS/0207066 (2002) - 2001
- [j41]Rodney G. Downey, Michael R. Fellows:
Index sets and parametric reductions. Arch. Math. Log. 40(5): 329-348 (2001) - [j40]Michael J. Dinneen, Kevin Cattell, Michael R. Fellows:
Forbidden minors to graphs with small feedback sets. Discret. Math. 230(1-3): 215-252 (2001) - [c37]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:
On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499 - [c36]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 Two-Layer Planarization. GD 2001: 1-15 - [c35]Michael R. Fellows:
Parameterized Complexity: The Main Ideas and Some Research Frontiers. ISAAC 2001: 291-307 - [c34]Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege:
Refined Search Tree Technique for DOMINATING SET on Planar Graphs. MFCS 2001: 111-122 - 2000
- [j39]Rodney G. Downey, Michael R. Fellows, Venkatesh Raman:
The complexity of irredundant sets parameterized by size. Discret. Appl. Math. 100(3): 155-167 (2000) - [j38]Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000) - [j37]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy J. Warnow:
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244(1-2): 167-188 (2000) - [c33]Michael R. Fellows:
Parameterized Complexity: The Main Ideas and Connections to Practical Computing. Experimental Algorithmics 2000: 51-77 - [c32]Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege:
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. FSTTCS 2000: 240-251
1990 – 1999
- 1999
- [b1]Rodney G. Downey, Michael R. Fellows:
Parameterized Complexity. Monographs in Computer Science, Springer 1999, ISBN 978-1-4612-6798-0, pp. 1-437 - [j36]Rodney G. Downey, Michael R. Fellows, Ulrike Stege:
Computational Tractability: The View From Mars. Bull. EATCS 69: 73-97 (1999) - [j35]Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle:
The Parametrized Complexity of Some Fundamental Problems in Coding Theory. SIAM J. Comput. 29(2): 545-570 (1999) - 1998
- [j34]R. Balasubramanian, Michael R. Fellows, Venkatesh Raman:
An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. 65(3): 163-168 (1998) - [j33]Michael R. Fellows, Pavol Hell, Karen Seyffarth:
Constructions of large planar networks with given degree and diameter. Networks 32(4): 275-281 (1998) - [j32]Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan:
Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998) - [j31]Rodney G. Downey, Michael R. Fellows:
Threshold Dominating Sets and an Improved Characterization of W[2]. Theor. Comput. Sci. 209(1-2): 123-140 (1998) - [c31]Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege:
Analogs and Duals of the MAST Problem for Sequences and Trees. ESA 1998: 103-114 - [c30]Michael R. Fellows, Michael T. Hallett, Ulrike Stege:
On the Multiple Gene Duplication Problem. ISAAC 1998: 347-356 - 1997
- [j30]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the parameterized complexity of short computation and factorization. Arch. Math. Log. 36(4-5): 321-337 (1997) - [j29]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
Advice Classes of Parameterized Tractability. Ann. Pure Appl. Log. 84(1): 119-138 (1997) - [j28]Bruno Courcelle, Rodney G. Downey, Michael R. Fellows:
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. Univers. Comput. Sci. 3(11): 1194-1198 (1997) - [c29]Rodney G. Downey, Michael R. Fellows, Ulrike Stege:
Parameterized complexity: A framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics 1997: 49-99 - 1996
- [j27]Marco Cesati, Michael R. Fellows:
Sparse Parameterized Problems. Ann. Pure Appl. Log. 82(1): 1-15 (1996) - [j26]Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. Inf. Process. Lett. 57(4): 197-203 (1996) - [j25]Noga Alon, Michael R. Fellows, Donovan R. Hare:
Vertex transversals that dominate. J. Graph Theory 21(1): 21-31 (1996) - [c28]Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans:
Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391 - [c27]Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan:
Descriptive complexity and the W hierarchy. Proof Complexity and Feasible Arithmetics 1996: 119-134 - [c26]Rodney G. Downey, Michael R. Fellows, Udayan Taylor:
The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]. DMTCS 1996: 194-213 - 1995
- [j24]Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995) - [j23]Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows:
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Log. 73(3): 235-276 (1995) - [j22]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham:
Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. 11(1): 49-57 (1995) - [j21]Michael R. Fellows, Pavol Hell, Karen Seyffarth:
Large Planar Graphs with Given Diameter and Maximum Degree. Discret. Appl. Math. 61(2): 133-153 (1995) - [j20]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the Structure of Parameterized Problems in NP. Inf. Comput. 123(1): 38-49 (1995) - [j19]Hans L. Bodlaender, Michael R. Fellows:
W[2]-hardness of precedence constrained K-processor scheduling. Oper. Res. Lett. 18(2): 93-97 (1995) - [j18]Rodney G. Downey, Michael R. Fellows:
Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput. 24(4): 873-921 (1995) - [j17]Rodney G. Downey, Michael R. Fellows:
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci. 141(1&2): 109-131 (1995) - [j16]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. 147(1&2): 31-54 (1995) - [c25]Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic. WADS 1995: 415-427 - 1994
- [j15]Michael R. Fellows, Michael A. Langston:
On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. J. Comput. Syst. Sci. 49(3): 769-779 (1994) - [j14]Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
The Private Neighbor Cube. SIAM J. Discret. Math. 7(1): 41-47 (1994) - [c24]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30 - [c23]Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham:
The Parameterized Complexity of Some Problems in Logic and Linguistics. LFCS 1994: 89-100 - [c22]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows:
On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520 - [c21]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett:
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. STOC 1994: 449-458 - 1993
- [c20]Michael R. Fellows, Neal Koblitz:
Fixed-Parameter Complexity and Cryptography. AAECC 1993: 121-131 - [c19]Rodney G. Downey, Patricia A. Evans, Michael R. Fellows:
Parameterized Learning Complexity. COLT 1993: 51-57 - [c18]Michael R. Fellows, Michael T. Hallett, Harold T. Wareham:
DNA Physical Mapping: Three Ways Difficult. ESA 1993: 157-168 - [c17]Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows:
Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385 - 1992
- [j13]Michael R. Fellows, Neal Koblitz:
Self-Witnessing Polynomial-Time Complexity and Prime Factorization. Des. Codes Cryptogr. 2(3): 231-235 (1992) - [j12]Michael R. Fellows, Michael A. Langston:
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. SIAM J. Discret. Math. 5(1): 117-126 (1992) - [j11]Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton:
Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41(2): 218-220 (1992) - [c16]Rodney G. Downey, Michael R. Fellows:
Fixed-Parameter Intractability. SCT 1992: 36-49 - [c15]Michael R. Fellows, Neal Koblitz:
Self-Witnessing Polynomial-Time Complexity and Prime Factorization. SCT 1992: 107-110 - [c14]Michael R. Fellows, Neal Koblitz:
Kid Krypto. CRYPTO 1992: 371-389 - [c13]Rodney G. Downey, Michael R. Fellows:
Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy. Complexity Theory: Current Research 1992: 191-225 - [c12]Nancy Casey, Michael R. Fellows:
Implementing the Standards: Let's Focus on the First Four. Discrete Mathematics in the Schools 1992: 51-65 - [c11]Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow:
Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283 - [c10]Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson:
Parallel Self-Reducibility. ICCI 1992: 67-70 - [e1]S. Rao Kosaraju, Mike Fellows, Avi Wigderson, John A. Ellis:
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada. ACM 1992, ISBN 0-89791-511-9 [contents] - 1991
- [j10]Michael R. Fellows, Mark N. Hoover:
Perfect domination. Australas. J Comb. 3: 141-150 (1991) - [j9]James Abello, Michael R. Fellows, John Stillwell:
On the complexity and combinatorics of covering finite complexes. Australas. J Comb. 4: 103-112 (1991) - [j8]Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret:
Constructive complexity. Discret. Appl. Math. 34(1-3): 3-16 (1991) - [j7]Michael R. Fellows, Michael A. Langston:
Fast search algorithms for layout permutation problems. Integr. 12(3): 321-337 (1991) - [c9]Michael J. Dinneen, Michael R. Fellows, Vance Faber:
Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158 - [c8]Michael R. Fellows, Michael A. Langston:
Constructivity Issues in Graph Algorithms. Constructivity in Computer Science 1991: 150-158 - [c7]Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
Induced minors and related problems. Graph Structure Theory 1991: 179-182 - [c6]Karl R. Abrahamson, Michael R. Fellows:
Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-563 - 1990
- [j6]Michael R. Fellows:
Transversals of Vertex Partitions in Graphs. SIAM J. Discret. Math. 3(2): 206-215 (1990)
1980 – 1989
- 1989
- [j5]Daniel J. Kleitman, Michael R. Fellows:
Radius and diameter in Manhattan lattices. Discret. Math. 73(1-2): 119-125 (1989) - [c5]Michael R. Fellows, Nancy G. Kinnersley, Michael A. Langston:
Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation. Computers and Mathematics 1989: 37-45 - [c4]Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata:
On the Complexity of Fixed Parameter Problems (Extended Abstract). FOCS 1989: 210-215 - [c3]Michael R. Fellows, Michael A. Langston:
An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract). FOCS 1989: 520-525 - [c2]Michael R. Fellows, Michael A. Langston:
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract). STOC 1989: 501-512 - 1988
- [j4]Michael R. Fellows, Donald K. Friesen, Michael A. Langston:
On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988) - [j3]Michael R. Fellows, Michael A. Langston:
Nonconstructive tools for proving polynomial-time decidability. J. ACM 35(3): 727-739 (1988) - [j2]Michael R. Fellows, Michael A. Langston:
Processor Utilization in a Linearly Connected Parallel Processing System. IEEE Trans. Computers 37(5): 594-603 (1988) - [c1]Michael R. Fellows, Michael A. Langston:
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. AWOC 1988: 278-287 - 1987
- [j1]Michael R. Fellows, Michael A. Langston:
Nonconstructive Advances in Polynomial-Time Complexity. Inf. Process. Lett. 26(3): 155-162 (1987)
Coauthor Index
Frances A. Rosamond
aka: Fran Rosamond
aka: Fran Rosamond
[c112] [c111] [c110] [c109] [i19] [i18] [i17] [j100] [i16] [c108] [c107] [i15] [j99] [j98] [j97] [c106] [c105] [i14] [e5] [j95] [j94] [j93] [j89] [j88] [c103] [j85] [j84] [j83] [c102] [c101] [j82] [j81] [j80] [j79] [c99] [c98] [c97] [i12] [j78] [j74] [j70] [c95] [c94] [p1] [j67] [j66] [c91] [c90] [c89] [i8] [j63] [j62] [j61] [j60] [c88] [c86] [c85] [c84] [c82] [c81] [c78] [i6] [j59] [j58] [j56] [c76] [c72] [c71] [c70] [c69] [i5] [j54] [j53] [c68] [c67] [c66] [c65] [c64] [j52] [c62] [c60] [c58] [c57] [j48] [c56] [c55] [i4] [i3] [c51] [c49] [c48] [c43] [c42] [c37] [c36] [c34] [c32]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-05 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
