Lena Schend - RankMe

20 papers A 4B 1Misc 2Journal 11Unranked 1

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	The possible winner with uncertain weights problem. J. Comput. Syst. Sci. Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia
2022	J	`jnl`	Altruistic Hedonic Games. J. Artif. Intell. Res. Anna Maria Kerkmann, Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend, Alessandra Wiechers
2020	J	`jnl`	Hedonic Games with Ordinal Preferences and Thresholds. J. Artif. Intell. Res. Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2018	J	`jnl`	Borda-induced hedonic games with friends, enemies, and neutral players. Math. Soc. Sci. Jörg Rothe, Hilmar Schadrack, Lena Schend
2016	A	`conf`	Altruistic Hedonic Games. AAMAS Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend
2016	—	`—`	From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games. Lena Schend
2016	J	`jnl`	Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games. Ann. Math. Artif. Intell. Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2015	J	`jnl`	Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2015	J	`jnl`	Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015	J	`jnl`	Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend
2015	A	`conf`	Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds. AAMAS Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2014	A	`conf`	Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2014	—	`conf`	The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants. STAIRS Yannick Reisch, Jörg Rothe, Lena Schend
2014	Misc	`conf`	Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games. ISAIM Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend
2013	J	`jnl`	Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey. Ann. Math. Artif. Intell. Jörg Rothe, Lena Schend
2013	J	`jnl`	Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. CoRR Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend
2012	J	`jnl`	Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach CoRR Jörg Rothe, Lena Schend
2012	B	`conf`	Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. SEA Jörg Rothe, Lena Schend
2012	A	`conf`	The Possible Winner Problem with Uncertain Weights. ECAI Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia
2012	Misc	`conf`	Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. ISAIM Jörg Rothe, Lena Schend