The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frances A. Rosamond: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Kernelization for Convex Recoloring. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:23-35 [Conf]
  2. Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond
    FPT is P-Time Extremal Structure I. [Citation Graph (0, 0)][DBLP]
    ACiD, 2005, pp:1-41 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:859-869 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:240-251 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:192-202 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:271-280 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:111-122 [Conf]
  11. Frank K. H. A. Dehne, Michael R. Fellows, Henning Fernau, Elena Prieto, Frances A. Rosamond
    NONBLOCKER: Parameterized Algorithmics for minimum dominating set. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:237-245 [Conf]
  12. Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
    Clique-width minimization is NP-hard. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:354-362 [Conf]
  13. Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle
    Finding k Disjoint Triangles in an Arbitrary Graph. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:235-244 [Conf]
  14. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
    An FPT Algorithm for Set Splitting. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:180-191 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  16. Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
    Proving NP-hardness for clique-width I: non-approximability of sequential clique-width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:080, pp:- [Journal]
  17. Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
    Proving NP-hardness for clique-width II: non-approximability of clique-width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:081, pp:- [Journal]
  18. Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond
    Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  19. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:385-405 [Journal]
  20. Michael R. Fellows, Frances A. Rosamond
    The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:268-277 [Conf]
  21. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Quadratic Kernelization for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:86-96 [Conf]
  22. Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
    Connected Coloring Completion for General Graphs: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:75-85 [Conf]
  23. Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw
    Efficient Parameterized Preprocessing for Cluster Editing. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:312-321 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:366-377 [Conf]

  25. Fixed-Parameter Algorithms for Kemeny Scores. [Citation Graph (, )][DBLP]


  26. How similarity helps to efficiently compute Kemeny rankings. [Citation Graph (, )][DBLP]


  27. Parameterized Complexity of the Clique Partition Problem. [Citation Graph (, )][DBLP]


  28. Haplotype Inference Constrained by Plausible Haplotype Data. [Citation Graph (, )][DBLP]


  29. Distortion Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]


  30. Local Search: Is Brute-Force Avoidable? [Citation Graph (, )][DBLP]


  31. Leaf Powers and Their Properties: Using the Trees. [Citation Graph (, )][DBLP]


  32. Graph Layout Problems Parameterized by Vertex Cover. [Citation Graph (, )][DBLP]


  33. What Makes Equitable Connected Partition Easy. [Citation Graph (, )][DBLP]


  34. A Purely Democratic Characterization of W[1]. [Citation Graph (, )][DBLP]


  35. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs. [Citation Graph (, )][DBLP]


  36. Clustering with Partial Information. [Citation Graph (, )][DBLP]


  37. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. [Citation Graph (, )][DBLP]


  38. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  39. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  40. Parameterized Complexity and Biopolymer Sequence Comparison. [Citation Graph (, )][DBLP]


  41. Parameterized Low-distortion Embeddings - Graph metrics into lines and trees [Citation Graph (, )][DBLP]


  42. Abstract Milling with Turn Costs [Citation Graph (, )][DBLP]


  43. Parameterizing by the Number of Numbers [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002