( en | de | ru )

 

Disambiguation of "Rosamond, Frances A."

Author of the publication

copydeleteadd this publication to your clipboard
Determining the Winner of a Dodgson Election is Hard.

, , , , and . FSTTCS, volume 8 of LIPIcs, page 459-468. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)

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

Frances Dielmann

Daniela Frances

 

Other publications of authors with the same name

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)Efficient Parameterized Preprocessing for Cluster Editing., , , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 312-321. Springer, (2007)Local Search: Is Brute-Force Avoidable?, , , , , and . IJCAI, page 486-491. (2009)On the parameterized complexity of multiple-interval graph problems., , , and . Theor. Comput. Sci., 410 (1): 53-61 (2009)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)Clustering with Partial Information., , , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 144-155. Springer, (2008)Determining the Winner of a Dodgson Election is Hard., , , , and . FSTTCS, volume 8 of LIPIcs, page 459-468. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average., , , , , , and . FSTTCS, volume 13 of LIPIcs, page 229-240. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Connected Coloring Completion for General Graphs: Algorithms and Complexity., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 75-85. Springer, (2007)