| Publication | Date of Publication | Type |
|---|
| Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas | 2024-01-18 | Paper |
| A multivariate complexity analysis of the material consumption scheduling problem | 2023-08-28 | Paper |
| Multidimensional stable roommates with master list | 2023-03-21 | Paper |
| Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters | 2023-02-03 | Paper |
| Bribery and control in stable marriage | 2022-12-21 | Paper |
| Line-up elections: parallel voting with shared candidate pool | 2022-12-21 | Paper |
| Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters | 2022-12-08 | Paper |
| Complexity of Shift Bribery in Committee Elections | 2022-09-24 | Paper |
| Envy-free allocations respecting social networks | 2022-04-11 | Paper |
| Bribery and Control in Stable Marriage | 2021-10-05 | Paper |
| Robustness among multiwinner voting rules | 2021-08-16 | Paper |
| Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting | 2020-03-12 | Paper |
| A parameterized algorithmics framework for degree sequence completion problems in directed graphs | 2019-04-25 | Paper |
| Pattern-guided \(k\)-anonymity | 2019-03-26 | Paper |
| Stable roommate with narcissistic, single-peaked, and single-crossing preferences | 2018-10-25 | Paper |
| A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs | 2018-04-10 | Paper |
| Parameterized complexity of team formation in social networks | 2018-03-13 | Paper |
| Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width | 2018-02-13 | Paper |
| Robustness among multiwinner voting rules | 2018-02-13 | Paper |
| Assessing the Computational Complexity of Multi-layer Subgraph Detection | 2017-07-21 | Paper |
| Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty | 2017-07-13 | Paper |
| Star Partitions of Perfect Graphs | 2017-07-05 | Paper |
| On the Computational Complexity of Variants of Combinatorial Voter Control in Elections | 2017-05-19 | Paper |
| On making a distinguished vertex of minimum degree by vertex deletion | 2017-05-17 | Paper |
| Fixed-parameter algorithms for DAG partitioning | 2017-02-06 | Paper |
| Prices matter for the parameterized complexity of shift bribery | 2016-11-18 | Paper |
| Parameterized Complexity of Team Formation in Social Networks | 2016-11-09 | Paper |
| Large-scale election campaigns: combinatorial shift bribery | 2016-04-19 | Paper |
| Finding large degree-anonymous subgraphs is hard | 2016-02-26 | Paper |
| Are there any nicely structured preference profiles nearby? | 2016-02-09 | Paper |
| The complexity of degree anonymization by vertex addition | 2015-12-08 | Paper |
| NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting | 2015-12-01 | Paper |
| Elections with Few Candidates: Prices, Weights, and Covering Problems | 2015-11-04 | Paper |
| Network-Based Vertex Dissolution | 2015-06-08 | Paper |
| Using patterns to form homogeneous teams | 2015-05-26 | Paper |
| The Complexity of Degree Anonymization by Vertex Addition | 2015-05-20 | Paper |
| On explaining integer vectors by few homogeneous segments | 2015-02-20 | Paper |
| Network-Based Dissolution | 2014-10-14 | Paper |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda | 2014-07-30 | Paper |
| Star Partitions of Perfect Graphs | 2014-07-01 | Paper |
| A characterization of the single-crossing domain | 2014-06-06 | Paper |
| Pattern-Guided k-Anonymity | 2014-04-03 | Paper |
| The effect of homogeneity on the computational complexity of combinatorial data anonymization | 2014-02-19 | Paper |
| The Complexity of Finding a Large Subgraph under Anonymity Constraints | 2014-01-14 | Paper |
| How to Put through Your Agenda in Collective Binary Decisions | 2013-12-17 | Paper |
| On Explaining Integer Vectors by Few Homogenous Segments | 2013-08-12 | Paper |
| Parameterized Complexity of DAG Partitioning | 2013-06-07 | Paper |
| Studies in Computational Aspects of Voting | 2012-09-05 | Paper |
| On bounded-degree vertex deletion parameterized by treewidth | 2012-03-19 | Paper |
| The Effect of Homogeneity on the Complexity of k-Anonymity | 2011-08-19 | Paper |
| Pattern-Guided Data Anonymization and Clustering | 2011-08-17 | Paper |
| On Making a Distinguished Vertex Minimum Degree by Vertex Deletion | 2011-02-15 | Paper |
| Partial Kernelization for Rank Aggregation: Theory and Experiments | 2010-12-07 | Paper |
