Michael R. Fellows
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
69
Venues
29
Active years
1989–2024
Best venue rank
A*
Where they publish
- AESA6 papers
- BISAAC6 papers
- BMFCS5 papers
- A*ICALP5 papers
- BWG4 papers
- CAAIM4 papers
- NationalCOCOON4 papers
- BCPM4 papers
- ASTACS4 papers
- A*IJCAI3 papers
- A*STOC3 papers
- CCOCOA2 papers
- BWADS2 papers
- A*FOCS2 papers
- CCIAC1 paper
- AECAI1 paper
- A*AAAI1 paper
- NationalFUN1 paper
- CIWOCA1 paper
- BWALCOM1 paper
- CCiE1 paper
- BFCT1 paper
- BSOFSEM1 paper
- AALENEX1 paper
- AGD1 paper
- NationalLFCS1 paper
- A*COLT1 paper
- A*CRYPTO1 paper
- CICCI1 paper
Papers
69 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2024 | MFCS | Breaking a Graph into Connected Components with Small Dominating Sets. | Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh |
| 2023 | CIAC | On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves. | Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach |
| 2023 | ECAI | On Solution Discovery via Reconfiguration. | Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz |
| 2020 | IJCAI | Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. | Julien Baste, Michael R. Fellows, Lars Jaffke, Toms Masark, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond |
| 2014 | COCOA | On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints. | Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw |
| 2013 | ESA | Tractable Parameterizations for the Minimum Linear Arrangement Problem. | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai |
| 2013 | ISAAC | Myhill-Nerode Methods for Hypergraphs. | Ren van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
| 2013 | WG | FPT Is Characterized by Useful Obstruction Sets. | Michael R. Fellows, Bart M. P. Jansen |
| 2012 | AAAI | The Parameterized Complexity of Abduction. | Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rmmele |
| 2012 | FUN | Train Marshalling Is Fixed Parameter Tractable. | Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond |
| 2012 | ICALP | Parameterized Approximation via Fidelity Preserving Transformations. | Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai |
| 2011 | AAIM | Recent Developments in the Theory of Pre-processing. | Michael R. Fellows |
| 2011 | IJCAI | Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. | Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond |
| 2011 | ISAAC | Parameterized Complexity of the Firefighter Problem. | Cristina Bazgan, Morgan Chopin, Michael R. Fellows |
| 2010 | AAIM | A Linear Kernel for Co-Path/Cycle Packing. | Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu |
| 2009 | COCOON | Graph-Based Data Clustering with Overlaps. | Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
| 2009 | CPM | Haplotype Inference Constrained by Plausible Haplotype Data. | Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg |
| 2009 | ICALP | Distortion Is Fixed Parameter Tractable. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
| 2009 | IJCAI | Local Search: Is Brute-Force Avoidable? | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
| 2009 | IWOCA | Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. | Michael R. Fellows |
| 2009 | MFCS | A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems. | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
| 2009 | STACS | A Generalization of Nemhauser and Trotter's Local Optimization Theorem. | Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier |
| 2009 | WALCOM | Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. | Michael Dom, Michael R. Fellows, Frances A. Rosamond |
| 2009 | WG | The Parameterized Complexity of Some Minimum Label Problems. | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
| 2008 | AAIM | Fixed-Parameter Algorithms for Kemeny Scores. | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
| 2008 | AAIM | Facility Location Problems: A Parameterized View. | Michael R. Fellows, Henning Fernau |
| 2008 | CPM | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
| 2008 | ICALP | On Problems without Polynomial Kernels (Extended Abstract). | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
| 2008 | ISAAC | Graph Layout Problems Parameterized by Vertex Cover. | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
| 2008 | ISAAC | Leaf Powers and Their Properties: Using the Trees. | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
| 2008 | MFCS | Clustering with Partial Information. | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
| 2007 | CiE | The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. | Michael R. Fellows, Frances A. Rosamond |
| 2007 | COCOA | On the Complexity of Some Colorful Problems Parameterized by Treewidth. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
| 2007 | COCOON | Quadratic Kernelization for Convex Recoloring of Trees. | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
| 2007 | COCOON | Connected Coloring Completion for General Graphs: Algorithms and Complexity. | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
| 2007 | FCT | Efficient Parameterized Preprocessing for Cluster Editing. | Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw |
| 2007 | ICALP | Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. | Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stphane Vialette |
| 2006 | STOC | Clique-width minimization is NP-hard. | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
| 2006 | SOFSEM | NONBLOCKER: Parameterized Algorithmics for minimum dominating set. | Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond |
| 2005 | COCOON | An O(2 | Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens |
| 2004 | ALENEX | Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. | Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons |
| 2004 | ESA | A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing. | Michael R. Fellows |
| 2004 | ESA | Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides |
| 2003 | MFCS | Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
| 2003 | WADS | New Directions and New Challenges in Algorithm Design and Complexity, Parameterized. | Michael R. Fellows |
| 2003 | WG | An FPT Algorithm for Set Splitting. | Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond |
| 2003 | WG | Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. | Michael R. Fellows |
| 2002 | STACS | On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems. | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
| 2001 | ESA | On the Parameterized Complexity of Layered Graph Drawing. | 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 |
| 2001 | GD | A Fixed-Parameter Approach to Two-Layer Planarization. | 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 |
| 2001 | ISAAC | Parameterized Complexity: The Main Ideas and Some Research Frontiers. | Michael R. Fellows |
| 2001 | MFCS | Refined Search Tree Technique for DOMINATING SET on Planar Graphs. | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege |
| 1998 | ESA | Analogs and Duals of the MAST Problem for Sequences and Trees. | Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege |
| 1998 | ISAAC | On the Multiple Gene Duplication Problem. | Michael R. Fellows, Michael T. Hallett, Ulrike Stege |
| 1996 | CPM | Finite-State Computability of Annotations of Strings and Trees. | Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans |
| 1995 | WADS | Obstructions to Within a Few Vertices or Edges of Acyclic. | Kevin Cattell, Michael J. Dinneen, Michael R. Fellows |
| 1994 | CPM | The Parameterized Complexity of Sequence Alignment and Consensus. | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham |
| 1994 | LFCS | The Parameterized Complexity of Some Problems in Logic and Linguistics. | Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham |
| 1994 | STOC | Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. | Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett |
| 1994 | STACS | On the Structure of Parameterized Problems in NP (Extended Abstract). | Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows |
| 1993 | COLT | Parameterized Learning Complexity. | Rodney G. Downey, Patricia A. Evans, Michael R. Fellows |
| 1993 | ESA | DNA Physical Mapping: Three Ways Difficult. | Michael R. Fellows, Michael T. Hallett, Harold T. Wareham |
| 1993 | STACS | Fixed-Parameter Intractability II (Extended Abstract). | Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows |
| 1992 | CRYPTO | Kid Krypto. | Michael R. Fellows, Neal Koblitz |
| 1992 | ICALP | Two Strikes Against Perfect Phylogeny. | Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow |
| 1992 | ICCI | Parallel Self-Reducibility. | Karl R. Abrahamson, Michael R. Fellows, Christopher B. Wilson |
| 1989 | FOCS | On the Complexity of Fixed Parameter Problems (Extended Abstract) | Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata |
| 1989 | FOCS | An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract) | Michael R. Fellows, Michael A. Langston |
| 1989 | STOC | On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) | Michael R. Fellows, Michael A. Langston |