| Publication | Date of Publication | Type |
|---|
Rank aggregation using scoring rules
Theory and Decision | 2026-04-28 | Paper |
Adapting stable matchings to evolving preferences
Games and Economic Behavior | 2026-03-24 | Paper |
How to tamper with a parliament: strategic campaigns in apportionment elections
Journal of Computer and System Sciences | 2025-09-29 | Paper |
Drawing a map of elections
Artificial Intelligence | 2025-05-30 | Paper |
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas
Information and Computation | 2024-01-18 | Paper |
A multivariate complexity analysis of the material consumption scheduling problem
Journal of Scheduling | 2023-08-28 | Paper |
Multidimensional stable roommates with master list
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2022-12-21 | Paper |
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Information and Computation | 2022-12-08 | Paper |
Complexity of shift bribery in committee elections
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Envy-free allocations respecting social networks
Artificial Intelligence | 2022-04-11 | Paper |
Bribery and control in stable marriage
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Robustness among multiwinner voting rules
Artificial Intelligence | 2021-08-16 | Paper |
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Theoretical Computer Science | 2020-03-12 | Paper |
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
Algorithmica | 2019-04-25 | Paper |
Pattern-guided k-anonymity
Algorithms | 2019-03-26 | Paper |
Stable roommate with narcissistic, single-peaked, and single-crossing preferences
(available as arXiv preprint) | 2018-10-25 | Paper |
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
(available as arXiv preprint) | 2018-04-10 | Paper |
Parameterized complexity of team formation in social networks
Theoretical Computer Science | 2018-03-13 | Paper |
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Robustness among multiwinner voting rules
Algorithmic Game Theory | 2018-02-13 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Parliamentary voting procedures: agenda control, manipulation, and uncertainty
Journal of Artificial Intelligence Research | 2017-07-13 | Paper |
Partitioning perfect graphs into stars
Journal of Graph Theory | 2017-07-05 | Paper |
On the computational complexity of variants of combinatorial voter control in elections
Lecture Notes in Computer Science | 2017-05-19 | Paper |
On making a distinguished vertex of minimum degree by vertex deletion
Algorithmica | 2017-05-17 | Paper |
Fixed-parameter algorithms for DAG partitioning
Discrete Applied Mathematics | 2017-02-06 | Paper |
Prices matter for the parameterized complexity of shift bribery
Information and Computation | 2016-11-18 | Paper |
Parameterized complexity of team formation in social networks
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Large-scale election campaigns: combinatorial shift bribery
The Journal of Artificial Intelligence Research (JAIR) | 2016-04-19 | Paper |
Finding large degree-anonymous subgraphs is hard
Theoretical Computer Science | 2016-02-26 | Paper |
Are there any nicely structured preference profiles nearby?
Mathematical Social Sciences | 2016-02-09 | Paper |
The complexity of degree anonymization by vertex addition
Theoretical Computer Science | 2015-12-08 | Paper |
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
Information Processing Letters | 2015-12-01 | Paper |
Elections with few candidates: prices, weights, and covering problems
Algorithmic Decision Theory | 2015-11-04 | Paper |
Network-based vertex dissolution
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
Using patterns to form homogeneous teams
Algorithmica | 2015-05-26 | Paper |
The complexity of degree anonymization by vertex addition
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
On explaining integer vectors by few homogeneous segments
Journal of Computer and System Sciences | 2015-02-20 | Paper |
Network-based dissolution
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
Star partitions of perfect graphs
Lecture Notes in Computer Science | 2014-07-01 | Paper |
A characterization of the single-crossing domain
Social Choice and Welfare | 2014-06-06 | Paper |
Pattern-guided \(k\)-anonymity
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery | 2014-02-19 | Paper |
The Complexity of Finding a Large Subgraph under Anonymity Constraints
Algorithms and Computation | 2014-01-14 | Paper |
How to Put through Your Agenda in Collective Binary Decisions
Algorithmic Decision Theory | 2013-12-17 | Paper |
On explaining integer vectors by few homogenous segments
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Parameterized complexity of DAG partitioning
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Studies in Computational Aspects of Voting
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
On bounded-degree vertex deletion parameterized by treewidth
Discrete Applied Mathematics | 2012-03-19 | Paper |
The effect of homogeneity on the complexity of \(k\)-anonymity
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Pattern-Guided Data Anonymization and Clustering
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Partial kernelization for rank aggregation: theory and experiments
Parameterized and Exact Computation | 2010-12-07 | Paper |
