Author of the publication

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.

 

Other publications of authors with the same name

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)Processor Utilization in a Linearly Connected Parallel Processing System., and . IEEE Trans. Computers, 37 (5): 594-603 (1988)Parameterized Complexity of Stabbing Rectangles and Squares in the Plane., , and . WALCOM, volume 5431 of Lecture Notes in Computer Science, page 298-309. Springer, (2009)The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 180-189. Springer, (2002)Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 150-159. Springer, (2002)Connected Coloring Completion for General Graphs: Algorithms and Complexity., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 75-85. Springer, (2007)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 86-96. Springer, (2007)New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.. WADS, volume 2748 of Lecture Notes in Computer Science, page 505-520. Springer, (2003)Parameterized Complexity: The Main Ideas and Connections to Practical Computing.. Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, page 51-77. Springer, (2000)