Lena Schend
Affiliations:- Universität Düsseldorf
  According to our database1,
  Lena Schend
  authored at least 21 papers
  between 2010 and 2023.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
  2023
    J. Comput. Syst. Sci., December, 2023
    
  
  2022
  2020
  2018
    Math. Soc. Sci., 2018
    
  
  2016
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games.
    
  
    PhD thesis, 2016
    
  
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., 2016
    
  
    Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
    
  
  2015
    J. Comput. Syst. Sci., 2015
    
  
    J. Comput. Syst. Sci., 2015
    
  
    Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
    
  
  2014
The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants.
    
  
    Proceedings of the STAIRS 2014, 2014
    
  
Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games.
    
  
    Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014
    
  
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting.
    
  
    Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
    
  
  2013
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey.
    
  
    Ann. Math. Artif. Intell., 2013
    
  
  2012
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach.
    
  
    Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
    
  
Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey.
    
  
    Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012
    
  
    Proceedings of the ECAI 2012, 2012
    
  
  2011
The complexity of voter partition in Bucklin and fallback voting: solving three open problems.
    
  
    Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011
    
  
  2010