default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLena Schend
Person information
- affiliation: Universität Düsseldorf
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Dorothea Baumeister, Marc Neveling, Magnus Roos, Jörg Rothe, Lena Schend, Robin Weishaupt, Lirong Xia
:
The possible winner with uncertain weights problem. J. Comput. Syst. Sci. 138: 103464 (2023)- 2022
- [j8]Anna Maria Kerkmann, Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend, Alessandra Wiechers:
Altruistic Hedonic Games. J. Artif. Intell. Res. 75 (2022) - 2020
- [j7]Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Hedonic Games with Ordinal Preferences and Thresholds. J. Artif. Intell. Res. 67: 705-756 (2020)
2010 – 2019
- 2018
- [j6]Jörg Rothe, Hilmar Schadrack, Lena Schend:
Borda-induced hedonic games with friends, enemies, and neutral players. Math. Soc. Sci. 96: 21-36 (2018) - 2016
- [b1]Lena Schend:
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games. Heinrich Heine University Düsseldorf, 2016 - [j5]Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
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. 77(3-4): 317-333 (2016) - [c9]Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend:
Altruistic Hedonic Games. AAMAS 2016: 251-259 - 2015
- [j4]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. 29(6): 1091-1124 (2015) - [j3]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: A theoretical analysis. J. Comput. Syst. Sci. 81(4): 632-660 (2015) - [j2]Gábor Erdélyi, Michael R. Fellows, Jörg Rothe, Lena Schend:
Control complexity in Bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. 81(4): 661-670 (2015) - [c8]Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds. AAMAS 2015: 1229-1237 - 2014
- [c7]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS 2014: 1357-1358 - [c6]Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games. ISAIM 2014 - [c5]Yannick Reisch, Jörg Rothe, Lena Schend:
The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants. STAIRS 2014: 250-259 - 2013
- [j1]Jörg Rothe, Lena Schend:
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey. Ann. Math. Artif. Intell. 68(1-3): 161-193 (2013) - [i5]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. CoRR abs/1307.7322 (2013) - 2012
- [c4]Dorothea Baumeister, Magnus Roos, Jörg Rothe, Lena Schend, Lirong Xia:
The Possible Winner Problem with Uncertain Weights. ECAI 2012: 133-138 - [c3]Jörg Rothe, Lena Schend:
Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. ISAIM 2012 - [c2]Jörg Rothe, Lena Schend:
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. SEA 2012: 356-368 - [i4]Jörg Rothe, Lena Schend:
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach. CoRR abs/1203.3967 (2012) - 2011
- [c1]Gábor Erdélyi, Lena Piras, Jörg Rothe:
The complexity of voter partition in Bucklin and fallback voting: solving three open problems. AAMAS 2011: 837-844 - [i3]Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe:
Control Complexity in Bucklin and Fallback Voting. CoRR abs/1103.2230 (2011) - 2010
- [i2]Gábor Erdélyi, Lena Piras, Jörg Rothe:
Control Complexity in Fallback Voting. CoRR abs/1004.3398 (2010) - [i1]Gábor Erdélyi, Lena Piras, Jörg Rothe:
Bucklin Voting is Broadly Resistant to Control. CoRR abs/1005.4115 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
