7 citations · 20 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
The Complexity of Finding Small Separators in Temporal Graphs
Philipp Zschoche, Till Fluschnik, Hendrik Molter +1
Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex set (the separator) with respect to two designated terminal vertices such that th…
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…