( en | de | ru )

 

Disambiguation of "Rosamond, Frances A."

Author of the publication

copydeleteadd this publication to your clipboard
Quadratic Kernelization for Convex Recoloring of Trees.

, , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 86-96. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Frances Allen

Frances Buttelmann

Frances McGinnity

Daniela Frances

Frances Dielmann

 

Other publications of authors with the same name

Local Search: Is Brute-Force Avoidable?, , , , , and . IJCAI, page 486-491. (2009)Efficient Parameterized Preprocessing for Cluster Editing., , , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 312-321. Springer, (2007)Distortion Is Fixed Parameter Tractable., , , , , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 463-474. Springer, (2009)The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number., and . CiE, volume 4497 of Lecture Notes in Computer Science, page 268-277. Springer, (2007)A Fixed-Parameter Approach to Two-Layer Planarization., , , , , , , , , and 2 other author(s). GD, volume 2265 of Lecture Notes in Computer Science, page 1-15. Springer, (2001)On the parameterized complexity of multiple-interval graph problems., , , and . Theor. Comput. Sci., 410 (1): 53-61 (2009)Clustering with Partial Information., , , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 144-155. Springer, (2008)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Collaborating with Hans: Some Remaining Wonderments., and . Treewidth, Kernels, and Algorithms, volume 12160 of Lecture Notes in Computer Science, page 7-17. Springer, (2020)FPT is P-Time Extremal Structure I., , , and . ACiD, volume 4 of Texts in Algorithmics, page 1-41. King's College, London, (2005)