Palash Dey

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 82

Top Venues

Publications

Rangeet Bhattacharyya, Parvik Dave, Palash Dey, Swaprava Nath
Optimal Referral Auction Design. AAMAS (2024)
Adway Mitra, Palash Dey
Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood. AAMAS (2024)
Palash Dey, Sudeshna Kolay, Sipra Singh
Knapsack: Connectedness, Path, and Shortest-Path. LATIN (2) (2024)
Arnab Maiti, Palash Dey
On Parameterized Complexity of Binary Networked Public Goods Game. Algorithmica 86 (1) (2024)
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CALDAM (2024)
Arnab Maiti, Palash Dey
Query complexity of tournament solutions. Theor. Comput. Sci. 991 (2024)
Arnab Maiti, Palash Dey
On Binary Networked Public Goods Game with Altruism. LATIN (2) (2024)
Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh
Knapsack with Vertex Cover, Set Cover, and Hitting Set. CoRR (2024)
Neel Karia, Faraaz Mallick, Palash Dey
How hard is safe bribery? Theor. Comput. Sci. 979 (2023)
Adway Mitra, Palash Dey
Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood. CoRR (2023)
Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya, Arlei Silva, Palash Dey, Swagato Sanyal
Feature-based Individual Fairness in k-clustering. AAMAS (2023)
Palash Dey, Sudeshna Kolay, Sipra Singh
Knapsack: Connectedness, Path, and Shortest-Path. CoRR (2023)
Palash Dey
Priced Gerrymandering. Theor. Comput. Sci. 972 (2023)
Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra
Parameterized Aspects of Distinct Kemeny Rank Aggregation. CoRR (2023)
Palash Dey, Neeldhara Misra
On the exact amount of missing information that makes finding possible winners hard. J. Comput. Syst. Sci. 135 (2023)
Debajyoti Kar, Palash Dey, Swagato Sanyal
Sampling-Based Winner Prediction in District-Based Elections. AAMAS (2023)
Palash Dey, Debajyoti Kar, Swagato Sanyal
Sampling-Based Winner Prediction in District-Based Elections. CoRR (2022)
Palash Dey
Priced Gerrymandering. AAMAS (2022)
Neel Karia, Faraaz Mallick, Palash Dey
How Hard is Safe Bribery? CoRR (2022)
Arnab Maiti, Palash Dey
On Binary Networked Public Goods Game with Altruism. CoRR (2022)
Arnab Maiti, Palash Dey
Parameterized Algorithms for Kidney Exchange. IJCAI (2022)
Arnab Maiti, Palash Dey
Parameterized Algorithms for Kidney Exchange. AAMAS (2022)
Neel Karia, Faraaz Mallick, Palash Dey
How Hard is Safe Bribery? AAMAS (2022)
Arnab Maiti, Palash Dey
On Parameterized Complexity of Binary Networked Public Goods Game. AAMAS (2022)
Rangeet Bhattacharyya, Palash Dey, Swaprava Nath
Myerson on a Network. CoRR (2022)
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
A parameterized perspective on protecting elections. Theor. Comput. Sci. 874 (2021)
Arnab Bhattacharyya, Palash Dey
Predicting winner and estimating margin of victory in elections using sampling. Artif. Intell. 296 (2021)
Palash Dey, Suman Kalyan Maity, Sourav Medya, Arlei Silva
Network Robustness via Global k-cores. AAMAS (2021)
Nuno Mota, Negar Mohammadi, Palash Dey, Krishna P. Gummadi, Abhijnan Chakraborty
Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding. WWW (2021)
Palash Dey, Arnab Maiti, Amatya Sharma
On Parameterized Complexity of Liquid Democracy. CALDAM (2021)
Debajyoti Kar, Sourav Medya, Debmalya Mandal, Arlei Silva, Palash Dey, Swagato Sanyal
Feature-based Individual Fairness in k-Clustering. CoRR (2021)
Aditya Anand, Palash Dey
Distance restricted manipulation in voting. Theor. Comput. Sci. 891 (2021)
Arnab Maiti, Palash Dey
Parameterized Algorithms for Kidney Exchange. CoRR (2021)
Palash Dey
Local distance constrained bribery in voting. Theor. Comput. Sci. 849 (2021)
Palash Dey, Arnab Maiti, Amatya Sharma
On Parameterized Complexity of Liquid Democracy. CoRR (2020)
Palash Dey, Suman Kalyan Maity, Sourav Medya, Arlei Silva
Network Robustness via Global k-cores. CoRR (2020)
Chinmay Sonar, Palash Dey, Neeldhara Misra
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. IJCAI (2020)
Palash Dey, Jaikumar Radhakrishnan, Santhoshini Velusamy
Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. MFCS (2020)
Chinmay Sonar, Palash Dey, Neeldhara Misra
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. CoRR (2020)
Arnab Maiti, Palash Dey
On Parameterized Complexity of Binary Networked Public Goods Game. CoRR (2020)
Palash Dey, Sourav Medya
Manipulating Node Similarity Measures in Networks. AAMAS (2020)
Ana-Andreea Stoica, Abhijnan Chakraborty, Palash Dey, Krishna P. Gummadi
Minimizing Margin of Victory for Fair Political and Educational Districting. AAMAS (2020)
Arnab Bhattacharyya, Palash Dey, David P. Woodruff
-Heavy Hitters in Insertion Streams and Related Problems. ACM Trans. Algorithms 15 (1) (2019)
Palash Dey, Sourav Medya
Covert Networks: How Hard is It to Hide? AAMAS (2019)
Palash Dey, Swaprava Nath, Garima Shakya
Testing Preferential Domains Using Sampling. CoRR (2019)
Palash Dey, Swaprava Nath, Garima Shakya
Testing Preferential Domains Using Sampling. AAMAS (2019)
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
A Parameterized Perspective on Protecting Elections. IJCAI (2019)
Palash Dey, Sourav Medya
Manipulating Node Similarity Measures in Network. CoRR (2019)
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya
A Parameterized Perspective on Protecting Elections. CoRR (2019)
Palash Dey
Local Distance Restricted Bribery in Voting. AAMAS (2019)
Palash Dey, Sourav Medya
Covert Networks: How Hard is It to Hide? CoRR (2019)
Aditya Anand, Palash Dey
Stable Manipulation in Voting. CoRR (2019)
Palash Dey
Optimal Bribery in Voting. CoRR (2019)
Ana-Andreea Stoica, Abhijnan Chakraborty, Palash Dey, Krishna P. Gummadi
Minimizing Margin of Victory for Fair Political and Educational Districting. CoRR (2019)
Palash Dey, Neeldhara Misra, Y. Narahari
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Theor. Comput. Sci. 783 (2019)
Palash Dey, Pravesh K. Kothari, Swaprava Nath
The Social Network Effect on Surprise in Elections. COMAD/CODS (2019)
Palash Dey
Gerrymandering: A Briber's Perspective. CoRR (2019)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of manipulation with partial information in voting. Theor. Comput. Sci. 726 (2018)
Palash Dey
Manipulative elicitation - A new attack on elections with incomplete preferences. Theor. Comput. Sci. 731 (2018)
Palash Dey
Manipulative Elicitation - A New Attack on Elections with Incomplete Preferences. AAAI (2018)
Palash Dey, Pravesh K. Kothari, Swaprava Nath
Surprise in Elections. CoRR (2018)
Palash Dey
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. CoRR (2017)
Palash Dey, Neeldhara Misra, Y. Narahari
Frugal bribery in voting. Theor. Comput. Sci. 676 (2017)
Palash Dey
Manipulative Elicitation - A New Attack on Elections with Incomplete Preferences. CoRR (2017)
Palash Dey, Nimrod Talmon, Otniel van Handel
Proportional Representation in Vote Streams. CoRR (2017)
Palash Dey, Nimrod Talmon, Otniel van Handel
Proportional Representation in Vote Streams. AAMAS (2017)
Palash Dey
Query Complexity of Tournament Solutions. AAAI (2017)
Palash Dey, Neeldhara Misra
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. MFCS (2017)
Palash Dey, Neeldhara Misra, Y. Narahari
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. AAMAS (2017)
Palash Dey, Neeldhara Misra
Preference Elicitation For Single Crossing Domain. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of Manipulation with Partial Information in Voting. CoRR (2016)
Palash Dey, Neeldhara Misra
Preference Elicitation for Single Crossing Domain. IJCAI (2016)
Arnab Bhattacharyya, Palash Dey, David P. Woodruff
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. CoRR (2016)
Palash Dey, Neeldhara Misra
Elicitation for Preferences Single Peaked on Trees. IJCAI (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Frugal Bribery in Voting. AAAI (2016)
Palash Dey, Neeldhara Misra
Elicitation for Preferences Single Peaked on Trees. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Theor. Comput. Sci. 616 (2016)
Palash Dey
Recognizing and Eliciting Weakly Single Crossing Profiles on Trees. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of Manipulation with Partial Information in Voting. IJCAI (2016)
Arnab Bhattacharyya, Palash Dey, David P. Woodruff
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. PODS (2016)
Palash Dey
Query Complexity of Tournament Solutions. CoRR (2016)
Palash Dey, Neeldhara Misra
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. CoRR (2016)
Palash Dey, Neeldhara Misra, Y. Narahari
Frugal Bribery in Voting. CoRR (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Detecting Possible Manipulators in Elections. AAMAS (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Manipulation is Harder with Incomplete Votes. CoRR (2015)
Arnab Bhattacharyya, Palash Dey
Sample Complexity for Winner Prediction in Elections. CoRR (2015)
Arnab Bhattacharyya, Palash Dey
Fishing out Winners from Vote Streams. CoRR (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
On Choosing Committees Based on Approval Votes in the Presence of Outliers. CoRR (2015)
Arnab Bhattacharyya, Palash Dey
Fishing out Winners from Vote Streams. Electron. Colloquium Comput. Complex. 22 (2015)
Palash Dey
Computational Complexity of Fundamental Problems in Social Choice Theory. AAMAS (2015)
Palash Dey, Arnab Bhattacharyya
Sample Complexity for Winner Prediction in Elections. AAMAS (2015)
Palash Dey, Y. Narahari
Estimating the Margin of Victory of an Election Using Sampling. IJCAI (2015)
Palash Dey, Y. Narahari
Estimating the Margin of Victory of an Election using Sampling. CoRR (2015)
Palash Dey, Neeldhara Misra, Y. Narahari
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting. AAMAS (2015)
Arnab Bhattacharyya, Palash Dey
Sample Complexity for Winner Prediction in Elections. Electron. Colloquium Comput. Complex. 22 (2015)
Palash Dey, Y. Narahari
Asymptotic collusion-proofness of voting rules: the case of large number of candidates. AAMAS (2014)
Palash Dey, Neeldhara Misra, Y. Narahari
Detecting Possible Manipulators in Elections. CoRR (2014)
Palash Dey, Prachi Goyal, Neeldhara Misra
UNO Gets Easier for a Single Player. FUN (2014)
Palash Dey, Neeldhara Misra, Y. Narahari
Complexity of Kernelization in the Possible Winner Problem. CoRR (2014)
Palash Dey, Y. Narahari
Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large CoRR (2013)

Palash Dey.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Palash Dey