( en | de | ru )

 

Disambiguation of "Rosamond, Frances A."

Author of the publication

copydeleteadd this publication to your clipboard
The Parameterized Complexity of Abduction.

, , , and . AAAI, page 743-749. AAAI Press, (2012)

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

Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors., , and . Algorithms, 13 (9): 236 (2020)Parameterized approximation via fidelity preserving transformations., , , and . J. Comput. Syst. Sci., (2018)Abstract Milling with Turn Costs, , , , , , and . CoRR, (2009)Clique-Width is NP-Complete., , , and . SIAM J. Discret. Math., 23 (2): 909-939 (2009)Parameterized approximation of dominating set problems., , , and . Inf. Process. Lett., 109 (1): 68-70 (2008)Distortion Is Fixed Parameter Tractable., , , , , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 463-474. Springer, (2009)Max Leaf Spanning Tree.. Encyclopedia of Algorithms, Springer, (2008)Efficient Parameterized Preprocessing for Cluster Editing., , , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 312-321. Springer, (2007)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)Local Search: Is Brute-Force Avoidable?, , , , , and . IJCAI, page 486-491. (2009)