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

Processor Utilization in a Linearly Connected Parallel Processing System., and . IEEE Trans. Computers, 37 (5): 594-603 (1988)Quadratic Kernelization for Convex Recoloring of Trees., , , , , and . Algorithmica, 61 (2): 362-388 (2011)FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders., and . TOCT, 6 (4): 16:1-16:26 (2014)An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem., , , , and . Theory Comput. Syst., 41 (3): 479-492 (2007)Polynomial Time Data Reduction for Dominating Set, , and . CoRR, (2002)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)The Private Neighbor Cube., , , and . SIAM J. Discret. Math., 7 (1): 41-47 (1994)A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals., , and . J. Univers. Comput. Sci., 3 (11): 1194-1198 (1997)On problems without polynomial kernels., , , and . J. Comput. Syst. Sci., 75 (8): 423-434 (2009)