Dynamic Multipath Bandwidth Provisioning with Jitter, Throughput, SLA Constraints in MPLS over WDM Network. - Palash Dey; Arkadeep Kundu; Mrinal K. Naskar; Amitava Mukherjee 001; Mita Nasipuri (ICDCN, 2010)

Asymptotic Collusion-proofness of Voting Rules when the Number of Candidates is Large - Palash Dey; Y. Narahari (CoRR, 2013)

Asymptotic collusion-proofness of voting rules: the case of large number of candidates. - Palash Dey; Y. Narahari (AAMAS, 2014)

UNO Gets Easier for a Single Player. - Palash Dey; Prachi Goyal; Neeldhara Misra (FUN, 2014)

Complexity of Kernelization in the Possible Winner Problem. - Palash Dey; Neeldhara Misra; Y. Narahari (CoRR, 2014)

Computational Complexity of Fundamental Problems in Social Choice Theory. - Palash Dey (AAMAS, 2015)

Detecting Possible Manipulators in Elections. - Palash Dey; Neeldhara Misra; Y. Narahari (AAMAS, 2015)

Estimating the Margin of Victory of an Election Using Sampling. - Palash Dey; Y. Narahari (IJCAI, 2015)

Manipulation is Harder with Incomplete Votes. - Palash Dey; Neeldhara Misra; Y. Narahari (CoRR, 2015)

On Choosing Committees Based on Approval Votes in the Presence of Outliers. - Palash Dey; Neeldhara Misra; Y. Narahari (CoRR, 2015)

Sample Complexity for Winner Prediction in Elections. - Arnab Bhattacharyya 001; Palash Dey (Electron. Colloquium Comput. Complex., 2015)

Fishing out Winners from Vote Streams. - Arnab Bhattacharyya 001; Palash Dey (Electron. Colloquium Comput. Complex., 2015)

Elicitation for Preferences Single Peaked on Trees. - Palash Dey; Neeldhara Misra (IJCAI, 2016)

Preference Elicitation for Single Crossing Domain. - Palash Dey; Neeldhara Misra (IJCAI, 2016)

An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. - Arnab Bhattacharyya 001; Palash Dey; David P. Woodruff (PODS, 2016)

Kernelization complexity of possible winner and coalitional manipulation problems in voting. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2016)

Query Complexity of Tournament Solutions. - Palash Dey (AAAI, 2017)

Proportional Representation in Vote Streams. - Palash Dey; Nimrod Talmon; Otniel van Handel (AAMAS, 2017)

Resolving the Complexity of Some Fundamental Problems in Computational Social Choice. - Palash Dey (CoRR, 2017)

Frugal bribery in voting. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2017)

Surprise in Elections. - Palash Dey; Pravesh K. Kothari; Swaprava Nath (CoRR, 2018)

Manipulative elicitation - A new attack on elections with incomplete preferences. - Palash Dey (Theor. Comput. Sci., 2018)

Complexity of manipulation with partial information in voting. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2018)

Local Distance Restricted Bribery in Voting. - Palash Dey (AAMAS, 2019)

Covert Networks: How Hard is It to Hide? - Palash Dey; Sourav Medya (AAMAS, 2019)

Testing Preferential Domains Using Sampling. - Palash Dey; Swaprava Nath; Garima Shakya (AAMAS, 2019)

The Social Network Effect on Surprise in Elections. - Palash Dey; Pravesh K. Kothari; Swaprava Nath (COMAD/CODS, 2019)

Optimal Bribery in Voting. - Palash Dey (CoRR, 2019)

Gerrymandering: A Briber's Perspective. - Palash Dey (CoRR, 2019)

Stable Manipulation in Voting. - Aditya Anand 001; Palash Dey (CoRR, 2019)

Manipulating Node Similarity Measures in Network. - Palash Dey; Sourav Medya (CoRR, 2019)

An Optimal Algorithm for ℓ1-Heavy Hitters in Insertion Streams and Related Problems. - Arnab Bhattacharyya 001; Palash Dey; David P. Woodruff (ACM Trans. Algorithms, 2019)

Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. - Palash Dey; Neeldhara Misra; Y. Narahari (Theor. Comput. Sci., 2019)

Manipulating Node Similarity Measures in Networks. - Palash Dey; Sourav Medya (AAMAS, 2020)

Minimizing Margin of Victory for Fair Political and Educational Districting. - Ana-Andreea Stoica; Abhijnan Chakraborty; Palash Dey; Krishna P. Gummadi (AAMAS, 2020)

On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. - Chinmay Sonar; Palash Dey; Neeldhara Misra (IJCAI, 2020)

Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. - Palash Dey; Jaikumar Radhakrishnan; Santhoshini Velusamy (MFCS, 2020)

Network Robustness via Global k-cores. - Palash Dey; Suman Kalyan Maity; Sourav Medya; Arlei Silva (AAMAS, 2021)

On Parameterized Complexity of Liquid Democracy. - Palash Dey; Arnab Maiti; Amatya Sharma (CALDAM, 2021)

Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding. - Nuno Mota; Negar Mohammadi; Palash Dey; Krishna P. Gummadi; Abhijnan Chakraborty (WWW, 2021)

Predicting winner and estimating margin of victory in elections using sampling. - Arnab Bhattacharyya 001; Palash Dey (Artif. Intell., 2021)

Feature-based Individual Fairness in k-Clustering. - Debajyoti Kar; Sourav Medya; Debmalya Mandal; Arlei Silva; Palash Dey; Swagato Sanyal (CoRR, 2021)

Distance restricted manipulation in voting. - Aditya Anand 001; Palash Dey (Theor. Comput. Sci., 2021)

Local distance constrained bribery in voting. - Palash Dey (Theor. Comput. Sci., 2021)

A parameterized perspective on protecting elections. - Palash Dey; Neeldhara Misra; Swaprava Nath; Garima Shakya (Theor. Comput. Sci., 2021)

Parameterized Algorithms for Kidney Exchange. - Arnab Maiti; Palash Dey (IJCAI, 2022)

Myerson on a Network. - Rangeet Bhattacharyya; Palash Dey; Swaprava Nath (CoRR, 2022)

Sampling-Based Winner Prediction in District-Based Elections. - Debajyoti Kar; Palash Dey; Swagato Sanyal (AAMAS, 2023)

Feature-based Individual Fairness in k-clustering. - Debajyoti Kar; Mert Kosan; Debmalya Mandal; Sourav Medya; Arlei Silva; Palash Dey; Swagato Sanyal (AAMAS, 2023)

On the exact amount of missing information that makes finding possible winners hard. - Palash Dey; Neeldhara Misra (J. Comput. Syst. Sci., 2023)

Priced Gerrymandering. - Palash Dey (Theor. Comput. Sci., 2023)

How hard is safe bribery? - Neel Karia; Faraaz Mallick; Palash Dey (Theor. Comput. Sci., 2023)

Optimal Referral Auction Design. - Rangeet Bhattacharyya; Parvik Dave; Palash Dey; Swaprava Nath (AAMAS, 2024)

Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood. - Adway Mitra; Palash Dey (AAMAS, 2024)

Knapsack with Vertex Cover, Set Cover, and Hitting Set. - Palash Dey; Ashlesha Hota; Sudeshna Kolay; Sipra Singh (ISAAC, 2024)

Knapsack: Connectedness, Path, and Shortest-Path. - Palash Dey; Sudeshna Kolay; Sipra Singh (LATIN (2), 2024)

On Binary Networked Public Goods Game with Altruism. - Arnab Maiti; Palash Dey (LATIN (2), 2024)

Query complexity of tournament solutions. - Arnab Maiti; Palash Dey (Theor. Comput. Sci., 2024)

On Parameterized Complexity of Binary Networked Public Goods Game. - Arnab Maiti; Palash Dey (Algorithmica, 2024)

Parameterized aspects of distinct Kemeny rank aggregation. - Koustav De; Harshil Mittal; Palash Dey; Neeldhara Misra (Acta Informatica, 2024)

Maximizing Value in Challenge the Champ Tournaments. - Umang Bhaskar; Juhi Chaudhary; Palash Dey (AAMAS, 2025)

Voter Participation Control in Online Polls. - Koustav De; Palash Dey; Swagato Sanyal (AAMAS, 2025)

Recognizing and eliciting weakly single crossing profiles on trees. - Palash Dey (Theor. Comput. Sci., 2025)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints. - Dhruv Sarkar; Aprameyo Chakrabartty; Subhamon Supantha; Palash Dey; Abhishek Sinha (CoRR, 2025)

Knapsack on Graphs with Relaxed Neighborhood Constraints. - Palash Dey; Ashlesha Hota; Sudeshna Kolay (CoRR, 2025)

The Complexity of Minimum-Envy House Allocation Over Graphs. - Palash Dey; Anubhav Dhar; Ashlesha Hota; Sudeshna Kolay (CoRR, 2025)