35 citations · 200 across the 47 of their papers we have counts for
33 papers · 1 filter
Stability of Special Graph Classes
Robin Weishaupt, Jörg Rothe
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $Θ_2^{\text{P}…
Complexity of Stability
Fabian Frei, Edith Hemaspaandra, Jörg Rothe
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computatio…
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules
Dorothea Baumeister, Joerg Rothe
The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winn…
Control Complexity in Bucklin and Fallback Voting
Gábor Erdélyi, Michael Fellows, Jörg Rothe +1
Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. To protect elections from such co…
Bucklin Voting is Broadly Resistant to Control
Gábor Erdélyi, Lena Piras, Jörg Rothe
Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. These actions modify an election'…
The Complexity of Probabilistic Lobbying
Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau +3
We propose models for lobbying in a probabilistic environment, in which an actor (called "The Lobby") seeks to influence voters' preferences of voting for or against multiple issue…