Name Venue Year citations
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS 2022 0
A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS 2022 0
Envy-free allocations respecting social networks. Artificial Intelligence 2022 0
Equitable Scheduling on a Single Machine. AAAI 2021 3
High-Multiplicity Fair Allocation Made More Practical. AAMAS 2021 1
Two Influence Maximization Games on Graphs Made Temporal. IJCAI 2021 1
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI 2021 3
Putting a Compass on the Map of Elections. IJCAI 2021 4
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI 2021 0
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. AAMAS 2021 2
Robustness among multiwinner voting rules. Artificial Intelligence 2021 2
Interference-free Walks in Time: Temporally Disjoint Paths. IJCAI 2021 6
On coalitional manipulation for multiwinner elections: shortlisting. Autonomous Agents and Multi-Agent Systems 2021 0
Bribery and Control in Stable Marriage. JAIR 2021 1
Algorithmic Aspects of Temporal Betweenness. KDD 2020 18
Multidimensional Stable Roommates with Master List. WINE 2020 5
Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Autonomous Agents and Multi-Agent Systems 2020 6
Adapting Stable Matchings to Evolving Preferences. AAAI 2020 5
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020 7
Electing Successive Committees: Complexity and Algorithms. AAAI 2020 4
An Experimental View on Committees Providing Justified Representation. IJCAI 2019 11
Exact mean computation in dynamic time warping spaces. DMKD 2019 0
Envy-Free Allocations Respecting Social Networks. AAMAS 2018 25
Exact Mean Computation in Dynamic Time Warping Spaces. SDM 2018 7
Teams in Online Scheduling Polls: Game-Theoretic Aspects. AAAI 2017 2
Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. ADT 2017 15
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. IJCAI 2017 11
Elections with Few Voters: Candidate Control Can Be Easy. JAIR 2017 0
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. JAIR 2017 0
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI 2016 22
H-index manipulation by merging articles: Models, theory, and experiments. Artificial Intelligence 2016 21
Complexity of Shift Bribery in Committee Elections. AAAI 2016 36
h-Index Manipulation by Undoing Merges. ECAI 2016 4
Large-Scale Election Campaigns: Combinatorial Shift Bribery. JAIR 2016 0
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015 57
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015 34
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. IJCAI 2015 10
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015 41
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI 2015 0
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014 60
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. JAIR 2014 0
The effect of homogeneity on the computational complexity of combinatorial data anonymization. DMKD 2014 0
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Autonomous Agents and Multi-Agent Systems 2014 0
How to Put through Your Agenda in Collective Binary Decisions. ADT 2013 4
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012 39
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011 90
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010 8
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI 2009 70
How similarity helps to efficiently compute Kemeny rankings. AAMAS 2009 21
Copyright ©2019 Universit├Ąt W├╝rzburg

Impressum | Privacy | FAQ