Author of the publication

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.

, , , , and . TAMC, volume 10185 of Lecture Notes in Computer Science, page 348-361. (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

The Complexity of Finding Small Separators in Temporal Graphs., , , and . MFCS, volume 117 of LIPIcs, page 45:1-45:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Restless Temporal Path Parameterized Above Lower Bounds.. CoRR, (2022)Interference-free walks in time: temporally disjoint paths., , , , and . Auton. Agents Multi Agent Syst., 37 (1): 1 (2023)The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing., , , and . IPEC, volume 214 of LIPIcs, page 26:1-26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Computational Complexity of Finding Separators in Temporal Graphs., , , and . CoRR, (2017)As Time Goes By: Reflections on Treewidth for Temporal Graphs., , , , and . Treewidth, Kernels, and Algorithms, volume 12160 of Lecture Notes in Computer Science, page 49-77. Springer, (2020)Finding Temporal Paths Under Waiting Time Constraints., , , and . Algorithmica, 83 (9): 2754-2802 (2021)Representative families for matroid intersections, with applications to location, packing, and covering problems., , and . Discret. Appl. Math., (2021)Computing maximum matchings in temporal graphs., , , , and . J. Comput. Syst. Sci., (November 2023)Computing Maximum Matchings in Temporal Graphs., , , , and . CoRR, (2019)