Back to Concern Department

Computer Science and Engineering

Faculty

Abhijit Das

Abhijnan Chakraborty

Abir Das

Animesh Mukherjee

Aritra Hazra

Arobinda Gupta

Ayan Chaudhury

Bivas Mitra

Chittaranjan Mandal

Debaditya Roy

Debasis Samanta

Debdeep Mukhopadhyay

Dipanwita Roy Chowdhury

Indranil Sengupta

Jayanta Mukhopadhyay

Jibesh Patra

Krothapalli Sreenivasa Rao

Mainack Mondal

Monosij Maitra

Niloy Ganguly

Pabitra Mitra

Palash Dey

Partha Bhowmick

Partha Pratim Chakrabarti

Pawan Goyal

Pralay Mitra

Rajat Subhra Chakraborty

Sandip Chakraborty

Saptarshi Ghosh

Sarani Bhattacharya

Satrajit Ghosh

Shamik Sural

Somak Aditya

Somindu Chaya Ramanna

Soumya Kanti Ghosh

Soumyajit Dey

Sourangshu Bhattacharya

Sudebkumar Prasant Pal

Sudeshna Kolay

Sudeshna Sarkar

Sudip Misra

Palash Dey

Ph.D., Indian Institute of Science Bangalore

Assistant Professor Grade-I

Computer Science and Engineering

+91-3222-2283464

palash.dey@cse.iitkgp.ac.in

Awards and Accolades

Personal Webpage Bio Sketch

Research Areas

Algorithms and Theory
Design and analysis of algorithms
Algorithmic Game Theory
Computational Social Choice
Parameterized Complexity

I am broadly interested in Theoretical Computer Science. My current research focuses on Algorithmic Game Theory and Parameterized Complexity.

All Publications

No Record Found.

Completed Projects

Principal Investigator

Computational Social Choice with Focus on Networks and Fairness Science and Engineering Research Board (SERB)

Ph. D. Students

Ashlesha Hota

Area of Research: Algorithms

Koustav De

Area of Research:

Narayan Sharma

Area of Research: Algorithms

Sipra Singh

Area of Research: Algorithm Design

Conferences

Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood by Dey P., Mitra A. AAMAS - (2024)
Knapsack with Vertex Cover, Set Cover, and Hitting Set by Dey P., Kolay S. , Hota A. , Singh S. ISAAC - (2024)
Optimal Referral Auction Design by Dey P., Bhattacharyya R. , Dave P. , Nath S. AAMAS - (2024)
Parameterized Aspects of Distinct Kemeny Rank Aggregation by Dey P., De K. , Mittal H. , Misra N. CALDAM - (2024)
Parameterized Aspects of Distinct Kemeny Rank Aggregation by De K., Mittal H. , Misra N. , Dey P. Algorithms and Discrete Applied Mathematics - 10th International Conference 14-28 (2024)
Sampling-Based Winner Prediction in District-Based Elections by Sanyal S., Dey P. , Kar D. International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 2023 - (2023)
Feature-based Individual Fairness in k-clustering by Kar D., Kosan M. , Mandal D. , Medya S. , Silva A. , Dey P. , Sanyal S. International Conference on Autonomous Agents and Multiagent Systems - (2023)
On Parameterized Complexity of Binary Networked Public Goods Game by Maiti A., Dey P. International Conference on Autonomous Agents and Multi-Agent Systems 871-879 (2022)
On Parameterized Complexity of Binary Networked Public Goods Game by Maiti A., Dey P. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2 871-879 (2022)
How Hard is Safe Bribery? by Karia N., Mallick F., Dey P. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2 714-722 (2022)
How Hard is Safe Bribery? by Karia N., Mallick F. , Dey P. International Conference on Autonomous Agents and Multi-Agent Systems 714-722 (2022)
Parameterized Algorithms for Kidney Exchange by Maiti A., Dey P. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 3 1693-1695 (2022)
Parameterized Algorithms for Kidney Exchange by Maiti A., Dey P. IJCAI International Joint Conference on Artificial Intelligence 405-411 (2022)
Parameterized Algorithms for Kidney Exchange by Maiti A., Dey P. International Joint Conference on Artificial Intelligence 405-411 (2022)
Priced Gerrymandering by Dey P. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 3 1575-1577 (2022)
Priced Gerrymandering by Dey P. International Conference on Autonomous Agents and Multi-Agent Systems 1575-1577 (2022)
Network robustness via global k-cores by Dey P., Maity S.K., Medya S., Silva A. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 1 438-446 (2021)
Network Robustness via Global k-cores by Dey P., Maity S. K., Medya S. , Silva A. 20th International Conference on Autonomous Agents and Multiagent Systems 438-446 (2021)
On Parameterized Complexity of Liquid Democracy by Dey P., Maiti A. , Sharma A. 7th International Conference Algorithms and Discrete Applied Mathematics 83-94 (2021)
On Parameterized Complexity of Liquid Democracy by Dey P., Maiti A., Sharma A. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12601 LNCS 83-94 (2021)
Fair partitioning of public resources: Redrawing district boundary to minimize spatial inequality in school funding by Mota N., Mohammadi N., Dey P., Gummadi K.P., Chakraborty A. The Web Conference 2021 - Proceedings of the World Wide Web Conference, WWW 2021 646-657 (2021)
Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding by Mota N., Mohammadi N. , Dey P. , Gummadi K. P., Chakraborty A. The Web Conference 2021 646-657 (2021)
Improved explicit data structures in the bit-probe model using error-correcting codes by Dey P., Radhakrishnan J., Velusamy S. Leibniz International Proceedings in Informatics, LIPIcs 170 - (2020)
Improved Explicit Data Structures in the Bit-probe Model using Error Correcting Codes by Dey P., Radhakrishnan J. , Velusamy S. Prodeesings of the 45th International Symposium on Mathematical Foundations of Computer Science - (2020)
Manipulating node similarity measures in networks by Dey P., Medya S. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020-May 321-329 (2020)
Manipulating Node Similarity Measures in Networks by Dey P., Medya S. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems - (2020)
Minimizing margin of victory for fair political and educational districting by Stoica A.-A., Chakraborty A., Dey P., Gummadi K.P. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020-May 1305-1313 (2020)
Minimizing Margin of Victory for Fair Political and Educational Districting by Stoica A. A., Chakraborty A. , Dey P. , Gummadi K. P. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems - (2020)
On the complexity of winner verification and candidate winner for multiwinner voting rules by Sonar C., Dey P., Misra N. IJCAI International Joint Conference on Artificial Intelligence 2021-January 89-95 (2020)
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules by Sonar C., Dey P. , Misra N. Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence - (2020)
Testing preferential domains using sampling by Dey P., Nath S., Shakya G. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2 855-863 (2019)
Testing Preferential Domains using Sampling by Dey P., Nath S. , Shakya G. Autonomous Agents and MultiAgent Systems 855-863 (2019)
Local distance restricted bribery in voting by Dey P. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 4 1925-1927 (2019)
Local Distance Restricted Bribery in Voting by Dey P. International Conference on Autonomous Agents and Multiagent Systems 1925-1927 (2019)
Covert networks: How hard is it to hide? by Dey P., Medya S. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2 628-637 (2019)
Covert Networks: How Hard is It to Hide? by Dey P., Medya S. Autonomous Agents and MultiAgent Systems 628-637 (2019)
The social network effect on surprise in elections by Dey P., Kothari P.K., Nath S. ACM International Conference Proceeding Series 1-9 (2019)
The Social Network Effect on Surprise in Elections by Dey P., Kothari P. , Nath S. ACM India Joint International Conference on Data Science & Management of Data 1-9 (2019)
A parameterized perspective on protecting elections by Dey P., Misra N., Nath S., Shakya G. IJCAI International Joint Conference on Artificial Intelligence 2019-August 238-244 (2019)
A Parameterized Perspective on Protecting Elections by Dey P., Misra N. , Nath S. , Shakya G. Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI) 238-244 (2019)
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences by Dey P. AAAI conference on Artificial Intelligence 4670-4677 (2018)
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard by Dey P., Misra N. International Symposium on Mathematical Foundations of Computer Science 1-14 (2017)
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers by Dey P., Misra N. , Narahari Y. Conference on Autonomous Agents and MultiAgent Systems (AAMAS) 42-50 (2017)
Proportional Representation in Vote Streams by Dey P., Talmon N. , Van Handel O. International Conference on Autonomous Systems and Multiagent Systems (AAMAS-17) 15-23 (2017)
Query Complexity of Tournament Solutions by Dey P. AAAI conference on Artificial Intelligence 2992-2998 (2017)
Elicitation for Preferences Single Peaked on Trees by Dey P., Misra N. International Joint Conference on Artificial Intelligence 215-221 (2016)
Frugal Bribery in Voting by Dey P., Misra N. , Narahari Y. AAAI Conference on Artificial Intelligence 2466-2473 (2016)
Complexity of Manipulation with Partial Information in Voting by Dey P., Misra N. , Narahari Y. International Joint Conference on Artificial Intelligence 229-235 (2016)
Preference Elicitation for Single Crossing Domain by Dey P., Misra N. International Joint Conference on Artificial Intelligence 222-228 (2016)
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems by Dey P., Bhattacharyya A. , Woodruff D. ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 385-400 (2016)
Sample Complexity for Winner Prediction in Elections by Dey P., Bhattacharyya A. International Conference on Autonomous Agents and Multiagent Systems 1421-1430 (2015)
Computational Complexity of Fundamental Problems in Social Choice Theory by Dey P. International Conference on Autonomous Agents and Multiagent Systems 1973-1974 (2015)
Detecting Possible Manipulators in Elections by Dey P., Misra N. , Narahari Y. International Conference on Autonomous Agents and Multiagent Systems 1441-1450 (2015)
Estimating the Margin of Victory of an Election Using Sampling by Dey P., Narahari Y. International Joint Conference on Artificial Intelligence 1120-1126 (2015)
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting by Dey P., Misra N. , Narahari Y. International Conference on Autonomous Agents and Multiagent Systems 87-96 (2015)
Asymptotic collusion-proofness of voting rules: the case of large number of candidates by Dey P., Narahari Y. International Conference on Autonomous Agents and Multiagent Systems 1419-1420 (2014)
UNO Gets Easier for a Single Player by Dey P., Goyal P. , Misra N. Fun with Algorithms 147-157 (2014)
Dynamic Multipath Bandwidth Provisioning with Jitter, Throughput, SLA Constraints in MPLS over WDM Network by Dey P., Kundu A. , Naskar M. K., Mukherjee A. , Nasipuri M. Internation Conference on Distributed Computing and Networking 376-391 (2010)

Journal

On the exact amount of missing information that makes finding possible winners hard by Dey P., Misra N. Journal of Computer and System Sciences 135 32-54 (2023)
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard by Dey P., Misra N. Journal of Computer and System Sciences - (2023)
Local distance constrained bribery in voting by Dey P. Theoretical Computer Science 849 1-21 (2021)
Local Distance Constrained Bribery in Voting by Dey P. Theoretical Computer Science 849 1-21 (2021)
Predicting winner and estimating margin of victory in elections using sampling by Bhattacharyya A., Dey P. Artificial Intelligence 296 - (2021)
Predicting winner and estimating margin of victory in elections using sampling by Bhattacharyya A., Dey P. Artificial Intelligence 296 103476- (2021)
A parameterized perspective on protecting elections by Dey P., Misra N. , Nath S. , Shakya G. Theoretical Computer Science 874 15-31 (2021)
A parameterized perspective on protecting elections by Dey P., Misra N., Nath S., Shakya G. Theoretical Computer Science - (2021)
Distance restricted manipulation in voting by Anand A., Dey P. Theoretical Computer Science 891 149-165 (2021)
Distance Restricted Manipulation in Voting by Dey P., Anand A. Theoretical Computer Science 849 149-165 (2021)
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers by Dey P., Misra N. , Narahari Y. Theoretical Computer Science 783 53-70 (2019)
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems by Dey P., Bhattacharyya A. , Woodruff D. ACM Transactions on Algorithms 15 1-27 (2019)
An optimal algorithm for1-heavy hitters in insertion streams and related problems by Dey P., Bhattacharyya A., Woodruff D.P. ACM Transactions on Algorithms 15 - (2018)
Complexity of Manipulation with Partial Information in Voting by Dey P., Misra N. , Narahari Y. Theoretical Computer Science 726 78-99 (2018)
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences by Dey P. Theoretical Computer Science 731 36-49 (2018)
Frugal Bribery in Voting by Dey P., Misra N. , Narahari Y. Theoretical Computer Science 676 15-32 (2017)
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting by Dey P., Misra N. , Narahari Y. Theoretical Computer Science 616 111-125 (2016)
Asymptotic collusion-proofness of voting rules: the case of large number of candidates by Dey P., Narahari Y. Studies in Microeconomics 120-139 (2015)