# Publications

Multiwinner Elections with Diversity Constraints.

.

In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI '18), , 2018.

.

In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI '18), , 2018.

Accepted for publication.

Assessing the Computational Complexity of Multi-Layer Subgraph Detection.

.

In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC '17), volume 10236 of Lecture Notes in Computer Science, pages 128–139, Springer, 2017.

.

In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC '17), volume 10236 of Lecture Notes in Computer Science, pages 128–139, Springer, 2017.

On Coalitional Manipulation for Multiwinner Elections: Shortlisting.

.

In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 887-893, AAAI Press, 2017.

.

In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 887-893, AAAI Press, 2017.

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.

.

In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC '17), pages 348–361, 2017.

.

In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC '17), pages 348–361, 2017.

Manipulating Opinion Diffusion in Social Networks.

.

In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 894-900, AAAI Press, 2017.

.

In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI '17), pages 894-900, AAAI Press, 2017.

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.

.

In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), volume 63 of LIPIcs, pages 10:1–10:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

.

In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), volume 63 of LIPIcs, pages 10:1–10:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

On Parameterized Complexity of Group Activity Selection Problems on Social Networks.

.

In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '17), pages 2 (extended abstract), 2017.

.

In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '17), pages 2 (extended abstract), 2017.

Accepted for publication.

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.

.

Journal of Artificial Intelligence Research 59:133–173.

.

Journal of Artificial Intelligence Research 59:133–173.

Robustness Among Multiwinner Voting Rules.

.

In Proceedings of the Algorithmic Game Theory: 10th International Symposium (SAGT '17), volume 10504 of LNCS, pages 80–92, Springer, 2017.

.

In Proceedings of the Algorithmic Game Theory: 10th International Symposium (SAGT '17), volume 10504 of LNCS, pages 80–92, Springer, 2017.

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.

.

In Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT '17), volume 10576 of LNCS, pages 315–330, Springer, 2017.

.

In Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT '17), volume 10576 of LNCS, pages 315–330, Springer, 2017.

Teams in Online Scheduling Polls: Game-Theoretic Aspects.

.

In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), pages 390–396, AAAI Press, 2017.

.

In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI '17), pages 390–396, AAAI Press, 2017.

Are there any nicely structured preference profiles nearby?.

.

Mathematical Social Sciences 79:61–73.

.

Mathematical Social Sciences 79:61–73.

Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.

.

In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16), pages 102-108, AAAI Press, 2016.

.

In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI '16), pages 102-108, AAAI Press, 2016.

Complexity of Shift Bribery in Committee Elections.

.

In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI '16), , 2016.

.

In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI '16), , 2016.

Accepted for publication.

Large-Scale Election Campaigns: Combinatorial Shift Bribery.

.

Journal of Artificial Intelligence Research 55:603–652.

.

Journal of Artificial Intelligence Research 55:603–652.

NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting.

.

Information Processing Letters 116:147–152.

.

Information Processing Letters 116:147–152.

Parameterized Complexity of Team Formation in Social Networks.

.

In Proceedings of the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM '16), pages 137-149, Springer, 2016.

.

In Proceedings of the 11th International Conference on Algorithmic Aspects of Information and Management (AAIM '16), pages 137-149, Springer, 2016.

Precedence-constrained scheduling problems parameterized by partial order width.

.

In Proceedings of the International Conference on Discrete Optimization and Operations Research (DOOR '16), volume 9869 of LNCS, pages 105-120, Springer, 2016.

.

In Proceedings of the International Conference on Discrete Optimization and Operations Research (DOOR '16), volume 9869 of LNCS, pages 105-120, Springer, 2016.

Prices Matter for the Parameterized Complexity of Shift Bribery.

.

Information and Computation 251:140–164.

.

Information and Computation 251:140–164.

Elections with Few Candidates: Prices, Weights, and Covering Problems.

.

In Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT '15), volume 9346 of LNCS, pages 414-431, Springer, 2015.

.

In Proceedings of the 4th International Conference on Algorithmic Decision Theory (ADT '15), volume 9346 of LNCS, pages 414-431, Springer, 2015.

Accepted for publication.

On Explaining Integer Vectors by Few Homogenous Segments.

.

Journal of Computer and System Sciences 81:766-782.

.

Journal of Computer and System Sciences 81:766-782.

How to Put Through Your Agenda in Collective Binary Decisions.

.

ACM Transactions on Economics and Computation 4:5:1–5:28.

.

ACM Transactions on Economics and Computation 4:5:1–5:28.

Large-Scale Election Campaigns: Combinatorial Shift Bribery.

.

In Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '15), pages 67-75, 2015.

.

In Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS '15), pages 67-75, 2015.

Accepted for publication.

NP-Hardness of Two Edge Cover Generalizations with Applications to Control and Bribery for Approval Voting.

.

Information Processing Letters 116:147–152.

.

Information Processing Letters 116:147–152.

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.

.

In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI '15), pages 164-170, AAAI Press, 2015.

.

In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI '15), pages 164-170, AAAI Press, 2015.

Accepted for publication.

The Complexity of Degree Anonymization by Vertex Addition.

.

In Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM '14), volume 8546 of LNCS, pages 44–55, Springer, 2014.

.

In Proceedings of the International Conference on Algorithmic Aspects of Information and Management (AAIM '14), volume 8546 of LNCS, pages 44–55, Springer, 2014.

The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization.

.

Data Mining and Knowledge Discovery 28:65–91.

.

Data Mining and Knowledge Discovery 28:65–91.

A multivariate complexity analysis of lobbying in multiple referenda.

.

Journal of Artificial Intelligence Research 50:409–446.

.

Journal of Artificial Intelligence Research 50:409–446.

Network-Based Dissolution.

.

In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS '14), volume 8635 of LNCS, pages 69–80, Springer, 2014.

.

In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS '14), volume 8635 of LNCS, pages 69–80, Springer, 2014.

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.

.

Tsinghua Science and Technology 19:358–373.

.

Tsinghua Science and Technology 19:358–373.

Prices Matter for the Parameterized Complexity of Shift Bribery.

.

Proceedings of the 28th Conference on Artificial Intelligence (AAAI '14) 552–558.

.

Proceedings of the 28th Conference on Artificial Intelligence (AAAI '14) 552–558.

Star Partitions of Perfect Graphs.

.

Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14) LNCS 174–185.

.

Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP '14) LNCS 174–185.

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation.

.

Autonomous Agents and Multi-Agent Systems 28:721–748.

.

Autonomous Agents and Multi-Agent Systems 28:721–748.

Are There Any Nicely Structured Preference Profiles Nearby?.

.

In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI '13), pages 62–68, AAAI Press, 2013.

.

In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI '13), pages 62–68, AAAI Press, 2013.

The complexity of finding a large subgraph under anonymity constraints.

.

Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13) LNCS 8283:152–162.

.

Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13) LNCS 8283:152–162.

On Explaining Integer Vectors by Few Homogenous Segments.

.

In Proceedings of the 13th Algorithms and Data Structures Symposium (WADS '13), volume 8037 of {LNCS}, pages 207–218, Springer, 2013.

.

In Proceedings of the 13th Algorithms and Data Structures Symposium (WADS '13), volume 8037 of {LNCS}, pages 207–218, Springer, 2013.

How to Put Through Your Agenda in Collective Binary Decisions.

.

Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT '13) LNCS 8176:30-44.

.

Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT '13) LNCS 8176:30-44.

Parameterized Complexity of DAG Partitioning.

.

Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC '13) LNCS 7878:49-60.

.

Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC '13) LNCS 7878:49-60.

Pattern-Guided k-Anonymity.

.

Proceedings of the Joint Conference of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM '13) LNCS 7924:350–361.

.

Proceedings of the Joint Conference of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM '13) LNCS 7924:350–361.

On Bounded-Degree Vertex Deletion Parameterized by Treewidth.

.

Discrete Applied Mathematics 160:53–60.

.

Discrete Applied Mathematics 160:53–60.

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.

.

In Proceedings of the 26th Conference on Artificial Intelligence (AAAI '12), pages 1292-1298, AAAI Press, 2012.

.

In Proceedings of the 26th Conference on Artificial Intelligence (AAAI '12), pages 1292-1298, AAAI Press, 2012.

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.

.

In The Multivariate Algorithmic Revolution and Beyond, volume 7370 of LNCS, pages 318–363, Springer, 2012.

.

In The Multivariate Algorithmic Revolution and Beyond, volume 7370 of LNCS, pages 318–363, Springer, 2012.

The Effect of Homogeneity on the Complexity of k-Anonymity.

.

In Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT '11), volume 6914 of LNCS, pages 53-64, Springer, 2011.

.

In Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT '11), volume 6914 of LNCS, pages 53-64, Springer, 2011.

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion.

.

In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '11), volume 6543 of LNCS, pages 123–134, Springer, 2011.

.

In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '11), volume 6543 of LNCS, pages 123–134, Springer, 2011.

Pattern-Guided Data Anonymization and Clustering.

.

In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS '11), volume 6907 of LNCS, pages 182-193, Springer, 2011.

.

In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS '11), volume 6907 of LNCS, pages 182-193, Springer, 2011.

Partial Kernelization for Rank Aggregation: Theory and Experiments.

.

In Proceedings of the 5th International Symposium on Parameterized and Exact Computation (IPEC '10), volume 6478 of LNCS, pages 26-37, Springer, 2010.

.

In Proceedings of the 5th International Symposium on Parameterized and Exact Computation (IPEC '10), volume 6478 of LNCS, pages 26-37, Springer, 2010.