2 papers
cs.DS2018
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein +2
Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For -vertex and $…
cs.MA2017
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche +2
Voter control problems model situations in which an external agent tries toaffect the result of an election by adding or deleting the fewest number of voters. The goal of the agent…