| Publication | Date of Publication | Type |
|---|
| Knapsack with vertex cover, set cover, and hitting set | 2026-06-08 | Paper |
Recognizing and eliciting weakly single crossing profiles on trees
Theoretical Computer Science | 2025-11-01 | Paper |
Parameterized aspects of distinct Kemeny rank aggregation
Acta Informatica | 2024-11-07 | Paper |
| Parameterized aspects of distinct Kemeny rank aggregation | 2024-05-31 | Paper |
| Knapsack: connectedness, path, and shortest-path | 2024-05-31 | Paper |
| On binary networked public goods game with altruism | 2024-05-31 | Paper |
Query complexity of tournament solutions
Theoretical Computer Science | 2024-03-01 | Paper |
On parameterized complexity of binary networked public goods game
Algorithmica | 2024-01-09 | Paper |
How hard is safe bribery?
Theoretical Computer Science | 2023-10-26 | Paper |
Priced gerrymandering
Theoretical Computer Science | 2023-09-07 | Paper |
On the exact amount of missing information that makes finding possible winners hard
Journal of Computer and System Sciences | 2023-04-21 | Paper |
| Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes | 2022-07-18 | Paper |
On parameterized complexity of liquid democracy
(available as arXiv preprint) | 2022-03-24 | Paper |
Predicting winner and estimating margin of victory in elections using sampling
Artificial Intelligence | 2021-11-02 | Paper |
Distance restricted manipulation in voting
Theoretical Computer Science | 2021-10-21 | Paper |
A parameterized perspective on protecting elections
Theoretical Computer Science | 2021-06-22 | Paper |
Local distance constrained bribery in voting
Theoretical Computer Science | 2020-12-15 | Paper |
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard
(available as arXiv preprint) | 2020-05-26 | Paper |
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers
Theoretical Computer Science | 2019-08-13 | Paper |
An optimal algorithm for \(\ell_1\)-heavy hitters in insertion streams and related problems
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Manipulative elicitation -- a new attack on elections with incomplete preferences
Theoretical Computer Science | 2018-06-07 | Paper |
Complexity of manipulation with partial information in voting
Theoretical Computer Science | 2018-04-16 | Paper |
Frugal bribery in voting
Theoretical Computer Science | 2017-05-11 | Paper |
Kernelization complexity of possible winner and coalitional manipulation problems in voting
Theoretical Computer Science | 2016-01-21 | Paper |
