2025
The Complexity of Minimum-Envy House Allocation Over Graphs.
CoRR, May, 2025
Knapsack on Graphs with Relaxed Neighborhood Constraints.
CoRR, April, 2025
Maximizing Value in Challenge the Champ Tournaments.
CoRR, February, 2025
Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints.
CoRR, January, 2025
2024
Parameterized aspects of distinct Kemeny rank aggregation.
Acta Informatica, December, 2024
On Parameterized Complexity of Binary Networked Public Goods Game.
Algorithmica, January, 2024
Query complexity of tournament solutions.
Theor. Comput. Sci., 2024
Voter Participation Control in Online Polls.
CoRR, 2024
On Binary Networked Public Goods Game with Altruism.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
Knapsack: Connectedness, Path, and Shortest-Path.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
Knapsack with Vertex Cover, Set Cover, and Hitting Set.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
Optimal Referral Auction Design.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
2023
How hard is safe bribery?
Theor. Comput. Sci., November, 2023
Theor. Comput. Sci., September, 2023
On the exact amount of missing information that makes finding possible winners hard.
J. Comput. Syst. Sci., August, 2023
Feature-based Individual Fairness in k-clustering.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
Sampling-Based Winner Prediction in District-Based Elections.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023
2022
Parameterized Algorithms for Kidney Exchange.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
2021
A parameterized perspective on protecting elections.
Theor. Comput. Sci., 2021
Local distance constrained bribery in voting.
Theor. Comput. Sci., 2021
Distance restricted manipulation in voting.
Theor. Comput. Sci., 2021
Feature-based Individual Fairness in k-Clustering.
CoRR, 2021
Predicting winner and estimating margin of victory in elections using sampling.
Artif. Intell., 2021
Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding.
Proceedings of the WWW '21: The Web Conference 2021, 2021
On Parameterized Complexity of Liquid Democracy.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021
Network Robustness via Global k-cores.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021
2020
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
Minimizing Margin of Victory for Fair Political and Educational Districting.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
Manipulating Node Similarity Measures in Networks.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020
2019
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers.
Theor. Comput. Sci., 2019
An Optimal Algorithm for ℓ<sub>1</sub>-Heavy Hitters in Insertion Streams and Related Problems.
ACM Trans. Algorithms, 2019
Manipulating Node Similarity Measures in Network.
CoRR, 2019
Stable Manipulation in Voting.
CoRR, 2019
Gerrymandering: A Briber's Perspective.
CoRR, 2019
Optimal Bribery in Voting.
CoRR, 2019
The Social Network Effect on Surprise in Elections.
Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2019
Testing Preferential Domains Using Sampling.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
Covert Networks: How Hard is It to Hide?
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
Local Distance Restricted Bribery in Voting.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
Complexity of manipulation with partial information in voting.
Theor. Comput. Sci., 2018
Manipulative elicitation - A new attack on elections with incomplete preferences.
Theor. Comput. Sci., 2018
2017
Frugal bribery in voting.
Theor. Comput. Sci., 2017
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice.
CoRR, 2017
Proportional Representation in Vote Streams.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
Query Complexity of Tournament Solutions.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2016
Kernelization complexity of possible winner and coalitional manipulation problems in voting.
Theor. Comput. Sci., 2016
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees.
CoRR, 2016
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016
Preference Elicitation for Single Crossing Domain.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Elicitation for Preferences Single Peaked on Trees.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
2015
Fishing out Winners from Vote Streams.
Electron. Colloquium Comput. Complex., 2015
Sample Complexity for Winner Prediction in Elections.
Electron. Colloquium Comput. Complex., 2015
On Choosing Committees Based on Approval Votes in the Presence of Outliers.
CoRR, 2015
Manipulation is Harder with Incomplete Votes.
CoRR, 2015
Estimating the Margin of Victory of an Election Using Sampling.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
Detecting Possible Manipulators in Elections.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
Computational Complexity of Fundamental Problems in Social Choice Theory.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015
2014
Complexity of Kernelization in the Possible Winner Problem.
CoRR, 2014
UNO Gets Easier for a Single Player.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
Asymptotic collusion-proofness of voting rules: the case of large number of candidates.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
2013
Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large
CoRR, 2013
2010
Dynamic Multipath Bandwidth Provisioning with Jitter, Throughput, SLA Constraints in MPLS over WDM Network.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010