Frances A. Rosamond

111 papers A* 5A 5B 15C 5Misc 5Journal 50Unranked 21
YearRankTypeTitle / Venue / Authors
2026 J jnl
On solution discovery via reconfiguration.
J. Comput. Syst. Sci.
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2025 J jnl
On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves.
J. Comput. Syst. Sci.
Benjamin Bergougnoux, Nello Blaser, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Emmanuel Sam
2024 B conf
Breaking a Graph into Connected Components with Small Dominating Sets.
MFCS
Matthias Bentert, Michael R. Fellows, Petr A. Golovach, Frances A. Rosamond, Saket Saurabh
2024 — conf
Games That Cannot Go on Forever! Active Participation in Research Is the Main Issue for Kids.
CMSC
Michael R. Fellows, Frances A. Rosamond
2023 A conf
On Solution Discovery via Reconfiguration.
ECAI
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2023 J jnl
On Solution Discovery via Reconfiguration.
CoRR
Michael R. Fellows, Mario Grobler, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Frances A. Rosamond, Daniel Schmand, Sebastian Siebertz
2023 C conf
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves.
CIAC
Emmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach
2023 J jnl
Open Problems in (Hyper)Graph Decomposition.
CoRR
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
2023 J jnl
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports
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
2022 J jnl
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.
Artif. Intell.
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2021 J jnl
Parameterized String Equations.
CoRR
Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond
2020 — conf
Collaborating with Hans: Some Remaining Wonderments.
Treewidth, Kernels, and Algorithms
Michael R. Fellows, Frances A. Rosamond
2020 A* conf
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
IJCAI
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2020 J jnl
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.
Algorithms
Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi
2019 J jnl
Diversity in Combinatorial Optimization.
CoRR
Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond
2019 J jnl
Frontiers in Algorithmics.
Theor. Comput. Sci.
Mingyu Xiao, Frances A. Rosamond
2018 — conf
A Survey on the Complexity of Flood-Filling Games.
Adventures Between Lower Bounds and Higher Altitudes
Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 J jnl
A brief history of Edward K. Blum and the Journal of Computer and System Sciences.
J. Comput. Syst. Sci.
Michael R. Fellows, Frances A. Rosamond
2018 J jnl
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.
Discret. Appl. Math.
Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
2018 J jnl
Computational Thinking Enrichment: Public-Key Cryptography.
Informatics Educ.
Frances A. Rosamond
2018 J jnl
Parameterized approximation via fidelity preserving transformations.
J. Comput. Syst. Sci.
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2018 — conf
What Is Known About Vertex Cover Kernelization?
Adventures Between Lower Bounds and Higher Altitudes
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
2018 J jnl
What is known about Vertex Cover Kernelization?
CoRR
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller
2017 — ed.
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday
Computability and Complexity
Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond
2017 Misc ed.
Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings
FAW
Mingyu Xiao, Frances A. Rosamond
2016 — ch.
Max Leaf Spanning Tree.
Encyclopedia of Algorithms
Frances A. Rosamond
2016 B conf
The First Parameterized Algorithms and Computational Experiments Challenge.
IPEC
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
2016 J jnl
Tractable Parameterizations for the Minimum Linear Arrangement Problem.
ACM Trans. Comput. Theory
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2015 J jnl
Myhill-Nerode Methods for Hypergraphs.
Algorithmica
René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2015 J jnl
On the parameterized complexity of dynamic problems.
Theor. Comput. Sci.
Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
2015 J jnl
The Flood-It game parameterized by the vertex cover number.
Electron. Notes Discret. Math.
Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva
2014 C conf
On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.
COCOA
Faisal N. Abu-Khzam, Judith Egan, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
2013 J jnl
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
Theor. Comput. Sci.
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2013 J jnl
Distortion is Fixed Parameter Tractable.
ACM Trans. Comput. Theory
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2013 B conf
Myhill-Nerode Methods for Hypergraphs.
ISAAC
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2013 J jnl
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity.
Eur. J. Comb.
Michael R. Fellows, Bart M. P. Jansen, Frances A. Rosamond
2013 A conf
Tractable Parameterizations for the Minimum Linear Arrangement Problem.
ESA
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai
2012 — conf
Computer Science Unplugged and Related Projects in Math and Computer Science Popularization.
The Multivariate Algorithmic Revolution and Beyond
Tim Bell, Frances A. Rosamond, Nancy Casey
2012 J jnl
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding
CoRR
René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012 J jnl
Local search: Is brute-force avoidable?
J. Comput. Syst. Sci.
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger
2012 — conf
Parameterized Approximation via Fidelity Preserving Transformations.
ICALP (1)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
2012 J jnl
Parameterizing by the Number of Numbers.
Theory Comput. Syst.
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2012 — conf
Passion Plays: Melodramas about Mathematics.
The Multivariate Algorithmic Revolution and Beyond
Frances A. Rosamond
2012 A* conf
The Parameterized Complexity of Abduction.
AAAI
Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele
2012 J jnl
The Parameterized Complexity of Stabbing Rectangles.
Algorithmica
Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar
2012 Misc conf
Train Marshalling Is Fixed Parameter Tractable.
FUN
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond
2012 J jnl
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.
Algorithmica
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
2011 A* conf
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable.
IJCAI
Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2011 J jnl
Haplotype Inference Constrained by Plausible Haplotype Data.
IEEE ACM Trans. Comput. Biol. Bioinform.
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2011 — ch.
Multivariate Complexity Theory.
Computer Science, The Hardware, Software and Heart of It
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2011 J jnl
On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput.
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011 J jnl
Quadratic Kernelization for Convex Recoloring of Trees.
Algorithmica
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2011 J jnl
Reaching out to the media: become a computer science ambassador.
Commun. ACM
Frances A. Rosamond, Roswitha Bardohl, Stephan Diehl, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann, Andreas Schwill, Ulrike Stege
2011 — conf
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
FSTTCS
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
2011 — ch.
Statistics of the Field.
Computer Science, The Hardware, Software and Heart of It
Frances A. Rosamond
2010 J jnl
Clustering with partial information.
Theor. Comput. Sci.
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2010 — conf
Determining the Winner of a Dodgson Election is Hard.
FSTTCS
Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh
2010 B conf
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.
WG
Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2010 J jnl
Parameterizing by the Number of Numbers
CoRR
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2010 B conf
Parameterizing by the Number of Numbers.
IPEC
Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2010 J jnl
W-Hierarchies Defined by Symmetric Gates.
Theory Comput. Syst.
Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2009 J jnl
Abstract Milling with Turn Costs
CoRR
Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2009 J jnl
Clique-Width is NP-Complete.
SIAM J. Discret. Math.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2009 — conf
Distortion Is Fixed Parameter Tractable.
ICALP (1)
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2009 J jnl
Fixed-parameter algorithms for Kemeny rankings.
Theor. Comput. Sci.
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2009 B conf
Haplotype Inference Constrained by Plausible Haplotype Data.
CPM
Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg
2009 — conf
How similarity helps to efficiently compute Kemeny rankings.
AAMAS (1)
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2009 A* conf
Local Search: Is Brute-Force Avoidable?
IJCAI
Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger
2009 J jnl
On the parameterized complexity of multiple-interval graph problems.
Theor. Comput. Sci.
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette
2009 B conf
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.
WALCOM
Michael Dom, Michael R. Fellows, Frances A. Rosamond
2009 J jnl
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Comput. Syst.
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
2009 — conf
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.
IWPEC
Michael R. Fellows, Danny Hermelin, Frances A. Rosamond
2009 — conf
What Makes Equitable Connected Partition Easy.
IWPEC
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
2008 — conf
A Purely Democratic Characterization of W[1].
IWPEC
Michael R. Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2008 B conf
Clustering with Partial Information.
MFCS
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2008 J jnl
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Algorithmica
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2008 C conf
Fixed-Parameter Algorithms for Kemeny Scores.
AAIM
Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
2008 B conf
Graph Layout Problems Parameterized by Vertex Cover.
ISAAC
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
2008 B conf
Leaf Powers and Their Properties: Using the Trees.
ISAAC
Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
2008 — ch.
Max Leaf Spanning Tree.
Encyclopedia of Algorithms
Frances A. Rosamond
2008 J jnl
On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica
Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
2008 J jnl
Parameterized Complexity and Biopolymer Sequence Comparison.
Comput. J.
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond, Yinglei Song
2008 — conf
Parameterized Complexity of the Clique Partition Problem.
CATS
Egbert Mujuni, Frances A. Rosamond
2008 J jnl
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
CoRR
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh
2008 J jnl
Parameterized approximation of dominating set problems.
Inf. Process. Lett.
Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
2007 J jnl
An O(2
Theory Comput. Syst.
Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
2007 Misc conf
Connected Coloring Completion for General Graphs: Algorithms and Complexity.
COCOON
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
2007 B conf
Efficient Parameterized Preprocessing for Cluster Editing.
FCT
Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
2007 C conf
On the Complexity of Some Colorful Problems Parameterized by Treewidth.
COCOA
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2007 Misc conf
Quadratic Kernelization for Convex Recoloring of Trees.
COCOON
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2007 C conf
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
CiE
Michael R. Fellows, Frances A. Rosamond
2007 J jnl
The Complexity of Polynomial-Time Approximation.
Theory Comput. Syst.
Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond
2006 J jnl
A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica
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
2006 A* conf
Clique-width minimization is NP-hard.
STOC
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2006 — conf
Kernelization for Convex Recoloring.
ACiD
Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2006 B conf
NONBLOCKER: Parameterized Algorithmics for minimum dominating set.
SOFSEM
Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto-Rodriguez, Frances A. Rosamond
2006 — conf
The Undirected Feedback Vertex Set Problem Has a Poly(
IWPEC
Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond
2005 J jnl
A refined search tree technique for Dominating Set on planar graphs.
J. Comput. Syst. Sci.
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2005 Misc conf
An O(2
COCOON
Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens
2005 — conf
FPT is P-Time Extremal Structure I.
ACiD
Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond
2005 J jnl
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2005 J jnl
Proving NP-hardness for clique-width II: non-approximability of clique-width
Electron. Colloquium Comput. Complex.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2004 A conf
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
ESA
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2004 B conf
Finding k Disjoint Triangles in an Arbitrary Graph.
WG
Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
2004 — conf
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
Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, Peter Shaw
2003 B conf
An FPT Algorithm for Set Splitting.
WG
Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
2003 — conf
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems.
CATS
Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond
2001 A conf
A Fixed-Parameter Approach to Two-Layer Planarization.
GD
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 A conf
On the Parameterized Complexity of Layered Graph Drawing.
ESA
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 B conf
Refined Search Tree Technique for DOMINATING SET on Planar Graphs.
MFCS
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege
2000 — conf
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems.
FSTTCS
Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege