36 citations · 122 across the 33 of their papers we have counts for
4 papers · 1 filter
Cluster Editing for Multi-Layer and Temporal Graphs
Jiehua Chen, Hendrik Molter, Manuel Sorge +1
Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical Cluster Editing problem. In Multi-L…
How hard is it to satisfy (almost) all roommates?
Jiehua Chen, Danny Hermelin, Manuel Sorge +1
The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set o…
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…
On the Number of Single-Peaked Narcissistic or Single-Crossing Narcissistic Preference Profiles
Jiehua Chen, Ugo P. Finnendahl
We investigate preference profiles for a set of voters, where each voter has a preference order on a finite set of alternatives (that is, a linear o…