Palash Dey

Algorithmica, January, 2024

On Binary Networked Public Goods Game with Altruism.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Knapsack: Connectedness, Path, and Shortest-Path.

[BibT_eX]

[DOI]

Sudeshna Kolay

Sipra Singh

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Parameterized Aspects of Distinct Kemeny Rank Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood.

[BibT_eX]

[DOI]

Adway Mitra

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Optimal Referral Auction Design.

[BibT_eX]

[DOI]

Rangeet Bhattacharyya

Parvik Dave

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

How hard is safe bribery?

[BibT_eX]

[DOI]

Neel Karia

Faraaz Mallick

Theor. Comput. Sci., November, 2023

Priced Gerrymandering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

On the exact amount of missing information that makes finding possible winners hard.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., August, 2023

Feature-based Individual Fairness in k-clustering.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Sampling-Based Winner Prediction in District-Based Elections.

[BibT_eX]

[DOI]

Debajyoti Kar

Swagato Sanyal

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Myerson on a Network.

[BibT_eX]

[DOI]

Rangeet Bhattacharyya

CoRR, 2022

Parameterized Algorithms for Kidney Exchange.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

A parameterized perspective on protecting elections.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Local distance constrained bribery in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Distance restricted manipulation in voting.

[BibT_eX]

[DOI]

Aditya Anand

Theor. Comput. Sci., 2021

Feature-based Individual Fairness in k-Clustering.

[BibT_eX]

[DOI]

CoRR, 2021

Predicting winner and estimating margin of victory in elections using sampling.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding.

[BibT_eX]

[DOI]

Proceedings of the WWW '21: The Web Conference 2021, 2021

On Parameterized Complexity of Liquid Democracy.

[BibT_eX]

[DOI]

Amatya Sharma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

Network Robustness via Global k-cores.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

Santhoshini Velusamy

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.

[BibT_eX]

[DOI]

Chinmay Sonar

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Minimizing Margin of Victory for Fair Political and Educational Districting.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Manipulating Node Similarity Measures in Networks.

[BibT_eX]

[DOI]

Sourav Medya

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

An Optimal Algorithm for ℓ<sub>1</sub>-Heavy Hitters in Insertion Streams and Related Problems.

[BibT_eX]

[DOI]

David P. Woodruff

ACM Trans. Algorithms, 2019

Manipulating Node Similarity Measures in Network.

[BibT_eX]

[DOI]

Sourav Medya

CoRR, 2019

Stable Manipulation in Voting.

[BibT_eX]

[DOI]

Aditya Anand

CoRR, 2019

Gerrymandering: A Briber's Perspective.

[BibT_eX]

[DOI]

CoRR, 2019

Optimal Bribery in Voting.

[BibT_eX]

[DOI]

CoRR, 2019

The Social Network Effect on Surprise in Elections.

[BibT_eX]

[DOI]

Pravesh K. Kothari

Proceedings of the ACM India Joint International Conference on Data Science and Management of Data, 2019

Testing Preferential Domains Using Sampling.

[BibT_eX]

[DOI]

Garima Shakya

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Covert Networks: How Hard is It to Hide?

[BibT_eX]

[DOI]

Sourav Medya

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Local Distance Restricted Bribery in Voting.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Complexity of manipulation with partial information in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Manipulative elicitation - A new attack on elections with incomplete preferences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Surprise in Elections.

[BibT_eX]

[DOI]

Pravesh K. Kothari

CoRR, 2018

2017

Frugal bribery in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice.

[BibT_eX]

[DOI]

CoRR, 2017

Proportional Representation in Vote Streams.

[BibT_eX]

[DOI]

Nimrod Talmon

Otniel van Handel

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Query Complexity of Tournament Solutions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Kernelization complexity of possible winner and coalitional manipulation problems in voting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Recognizing and Eliciting Weakly Single Crossing Profiles on Trees.

[BibT_eX]

[DOI]

CoRR, 2016

An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems.

[BibT_eX]

[DOI]

David P. Woodruff

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Preference Elicitation for Single Crossing Domain.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Elicitation for Preferences Single Peaked on Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Fishing out Winners from Vote Streams.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Sample Complexity for Winner Prediction in Elections.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

On Choosing Committees Based on Approval Votes in the Presence of Outliers.

[BibT_eX]

[DOI]

CoRR, 2015

Manipulation is Harder with Incomplete Votes.

[BibT_eX]

[DOI]

CoRR, 2015

Estimating the Margin of Victory of an Election Using Sampling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Detecting Possible Manipulators in Elections.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Computational Complexity of Fundamental Problems in Social Choice Theory.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Complexity of Kernelization in the Possible Winner Problem.

[BibT_eX]

[DOI]

CoRR, 2014

UNO Gets Easier for a Single Player.

[BibT_eX]

[DOI]

Prachi Goyal

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Asymptotic collusion-proofness of voting rules: the case of large number of candidates.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]