![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Frances A. Rosamond
Person information
- affiliation: Charles Darwin University, Darwin, Australia
- affiliation: University of Bergen, Norway
- affiliation (former): University of Newcastle, Australia
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c54]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
- [c53]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 - [c52]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 - [i12]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) - [i11]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) - [i10]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
- [j38]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
- [i9]Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond:
Parameterized String Equations. CoRR abs/2104.14171 (2021) - 2020
- [j37]Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi:
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms 13(9): 236 (2020) - [c51]Michael R. Fellows, Frances A. Rosamond:
Collaborating with Hans: Some Remaining Wonderments. Treewidth, Kernels, and Algorithms 2020: 7-17 - [c50]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
- [j36]Mingyu Xiao, Frances A. Rosamond:
Frontiers in Algorithmics. Theor. Comput. Sci. 786: 1 (2019) - [i8]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
- [j35]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) - [j34]Frances A. Rosamond:
Computational Thinking Enrichment: Public-Key Cryptography. Informatics Educ. 17(1): 93-103 (2018) - [j33]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93: 30-40 (2018) - [j32]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) - [c49]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 - [c48]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 - [i7]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
- [e2]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] - [e1]Mingyu Xiao, Frances A. Rosamond:
Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. Lecture Notes in Computer Science 10336, Springer 2017, ISBN 978-3-319-59604-4 [contents] - 2016
- [j31]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) - [c47]Holger Dell
, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond:
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC 2016: 30:1-30:9 - [r2]Frances A. Rosamond:
Max Leaf Spanning Tree. Encyclopedia of Algorithms 2016: 1211-1215 - 2015
- [j30]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) - [j29]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) - [j28]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
- [j27]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) - [c46]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
- [j26]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) - [j25]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) - [j24]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) - [c45]Michael R. Fellows
, Danny Hermelin
, Frances A. Rosamond
, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468 - [c44]René van Bevern, Michael R. Fellows
, Serge Gaspers, Frances A. Rosamond
:
Myhill-Nerode Methods for Hypergraphs. ISAAC 2013: 372-382 - 2012
- [j23]Michael Dom, Michael R. Fellows
, Frances A. Rosamond
, Somnath Sikdar:
The Parameterized Complexity of Stabbing Rectangles. Algorithmica 62(1-2): 564-594 (2012) - [j22]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) - [j21]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) - [j20]Michael R. Fellows
, Serge Gaspers, Frances A. Rosamond
:
Parameterizing by the Number of Numbers. Theory Comput. Syst. 50(4): 675-693 (2012) - [c43]Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele:
The Parameterized Complexity of Abduction. AAAI 2012: 743-749 - [c42]Frances A. Rosamond
:
Passion Plays: Melodramas about Mathematics. The Multivariate Algorithmic Revolution and Beyond 2012: 80-87 - [c41]Tim Bell
, Frances A. Rosamond
, Nancy Casey:
Computer Science Unplugged and Related Projects in Math and Computer Science Popularization. The Multivariate Algorithmic Revolution and Beyond 2012: 398-456 - [c40]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 - [c39]Michael R. Fellows
, Ariel Kulik, Frances A. Rosamond
, Hadas Shachnai:
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012: 351-362 - [i6]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) - 2011
- [j19]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) - [j18]Frances A. Rosamond
, Roswitha Bardohl, Stephan Diehl
, Uwe Geisler, Gordon Bolduan, Annette Lessmöllmann
, Andreas Schwill, Ulrike Stege:
Reaching out to the media: become a computer science ambassador. Commun. ACM 54(3): 113-116 (2011) - [j17]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) - [j16]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) - [c38]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 - [c37]Michael R. Fellows
, Tobias Friedrich, Danny Hermelin
, Nina Narodytska, Frances A. Rosamond
:
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527 - [p2]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Multivariate Complexity Theory. Computer Science, The Hardware, Software and Heart of It 2011: 269-293 - [p1]Frances A. Rosamond:
Statistics of the Field. Computer Science, The Hardware, Software and Heart of It 2011: 421-466 - 2010
- [j15]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) - [j14]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) - [c36]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 - [c35]Michael R. Fellows
, Serge Gaspers, Frances A. Rosamond
:
Parameterizing by the Number of Numbers. IPEC 2010: 123-134 - [c34]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 - [i5]Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Parameterizing by the Number of Numbers. CoRR abs/1007.2021 (2010)
2000 – 2009
- 2009
- [j13]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) - [j12]Michael R. Fellows
, Frances A. Rosamond
, Udi Rotics, Stefan Szeider
:
Clique-Width is NP-Complete. SIAM J. Discret. Math. 23(2): 909-939 (2009) - [j11]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) - [j10]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) - [c33]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 - [c32]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 - [c31]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 - [c30]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 - [c29]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 - [c28]Michael R. Fellows
, Danny Hermelin
, Frances A. Rosamond
:
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. IWPEC 2009: 149-160 - [c27]Michael Dom, Michael R. Fellows
, Frances A. Rosamond
:
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. WALCOM 2009: 298-309 - [i4]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
- [j9]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) - [j8]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) - [j7]Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A. Rosamond
, Yinglei Song:
Parameterized Complexity and Biopolymer Sequence Comparison. Comput. J. 51(3): 270-291 (2008) - [j6]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) - [c26]Nadja Betzler, Michael R. Fellows
, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
:
Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 - [c25]Egbert Mujuni, Frances A. Rosamond:
Parameterized Complexity of the Clique Partition Problem. CATS 2008: 75-78 - [c24]Michael R. Fellows
, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond
, Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305 - [c23]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 - [c22]Michael R. Fellows
, Danny Hermelin
, Moritz Müller, Frances A. Rosamond
:
A Purely Democratic Characterization of W[1]. IWPEC 2008: 103-114 - [c21]Hans L. Bodlaender
, Michael R. Fellows
, Pinar Heggernes
, Federico Mancini, Charis Papadopoulos
, Frances A. Rosamond
:
Clustering with Partial Information. MFCS 2008: 144-155 - [r1]Frances A. Rosamond:
Max Leaf Spanning Tree. Encyclopedia of Algorithms 2008 - [i3]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
- [j5]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) - [j4]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) - [c20]Michael R. Fellows
, Frances A. Rosamond
:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. CiE 2007: 268-277 - [c19]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 - [c18]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 - [c17]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 - [c16]Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321 - 2006
- [j3]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) - [c15]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 - [c14]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 - [c13]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 - [c12]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
:
Clique-width minimization is NP-hard. STOC 2006: 354-362 - 2005
- [j2]Stephan K. Chalup
, Drew Mellor, Fran Rosamond:
The machine intelligence Hex project. Comput. Sci. Educ. 15(4): 245-273 (2005) - [j1]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) - [c11]Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond:
FPT is P-Time Extremal Structure I. ACiD 2005: 1-41 - [c10]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 - [i2]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) - [i1]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
- [c9]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 - [c8]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 - [c7]Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle:
Finding k Disjoint Triangles in an Arbitrary Graph. WG 2004: 235-244 - 2003
- [c6]Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond:
An FPT Algorithm for Set Splitting. WG 2003: 180-191 - [c5]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 - 2001
- [c4]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 - [c3]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 - [c2]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
- [c1]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
Coauthor Index
aka: Mike Fellows
![](https://dblp.org/img/cog.dark.24x24.png)
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 2024-08-26 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint