Author of the publication

On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard.

, and . MFCS, volume 83 of LIPIcs, page 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

On Structural Parameterizations of Firefighting., , , and . CoRR, (2017)Solving minones-2-sat as Fast as vertex cover., , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 549-555. Springer, (2010)Elicitation for Preferences Single Peaked on Trees., and . IJCAI, page 215-221. IJCAI/AAAI Press, (2016)On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard., and . MFCS, volume 83 of LIPIcs, page 57:1-57:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Two Dots is NP-complete.. FUN, volume 49 of LIPIcs, page 24:1-24:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Computational Hardness of Manipulating Pairwise Voting Rules., , , and . AAMAS, page 358-367. ACM, (2016)Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles., , , , and . J. Graph Theory, 74 (4): 417-424 (2013)Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs., , , , and . Algorithmica, 81 (1): 26-46 (2019)Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?, , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 679-690. Springer, (2013)Algorithmic Aspects of Dominator Colorings in Graphs., , , , and . IWOCA, volume 7056 of Lecture Notes in Computer Science, page 19-30. Springer, (2011)