Publications
Putting a Compass on the Map of Elections.
.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 59–65, ijcai.org, 2021.
.
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI '21), pages 59–65, ijcai.org, 2021.
Parameterized Algorithms for Finding a Collective Set of Items.
.
In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), , AAAI Press, 2020.
.
In Proceedings of the 34st AAAI Conference on Artificial Intelligence (AAAI '20), , AAAI Press, 2020.
Accepted for publication.
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.
.
Algorithmica 81:1584--1614.
.
Algorithmica 81:1584--1614.
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters.
.
In Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC '19), , 2019.
.
In Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC '19), , 2019.
Accepted for publication.
Parameterized complexity of team formation in social networks.
.
Theoretical Computer Science 717:26-36.
.
Theoretical Computer Science 717:26-36.
Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
.
Journal of Artificial Intelligence Research 59:133–173.
.
Journal of Artificial Intelligence Research 59:133–173.
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.
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.
Prices Matter for the Parameterized Complexity of Shift Bribery.
.
Information and Computation 251:140–164.
.
Information and Computation 251:140–164.
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.
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.
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.
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.
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.