Palash Dey

402 total citations
41 papers, 171 citations indexed

About

Palash Dey is a scholar working on Economics and Econometrics, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Palash Dey has authored 41 papers receiving a total of 171 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Economics and Econometrics, 17 papers in Artificial Intelligence and 13 papers in Computational Theory and Mathematics. Recurrent topics in Palash Dey's work include Game Theory and Voting Systems (21 papers), Complexity and Algorithms in Graphs (13 papers) and Auction Theory and Applications (10 papers). Palash Dey is often cited by papers focused on Game Theory and Voting Systems (21 papers), Complexity and Algorithms in Graphs (13 papers) and Auction Theory and Applications (10 papers). Palash Dey collaborates with scholars based in India, United States and Israel. Palash Dey's co-authors include Y. Narahari, Neeldhara Misra, Sudip Talukdar, Arnab Bhattacharyya, Aminul Islam Laskar, D. J. Bordoloi, R.K. Gupta, Mohammad Asaduzzaman Chowdhury, Dewan Muhammad Nuruzzaman and Mohammad Mostafa and has published in prestigious journals such as Artificial Intelligence, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Palash Dey

31 papers receiving 167 citations

Peers

Palash Dey

EE

AI

MSOR

CSE

CTM

Jinyuan Zhang China

Zbigniew Telec Poland

Rizwan Ullah China

Martha Pulido Mexico

F. Rivas-Dávalos Mexico

Jaber Valinejad United States

Xu He China

M. Durairaj India

Baolei Wei China

Jinyuan Zhang China

Palash Dey

20 ×0.3

EE

46 ×0.8

AI

18 ×0.4

MSOR

24 ×0.6

CSE

37 ×1.1

CTM

Citations per year, relative to Palash Dey Palash Dey (= 1×) peers Jinyuan Zhang

Countries citing papers authored by Palash Dey

Since Specialization

Citations

This map shows the geographic impact of Palash Dey's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Palash Dey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Palash Dey more than expected).

Fields of papers citing papers by Palash Dey

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Palash Dey. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Palash Dey. The network helps show where Palash Dey may publish in the future.

Co-authorship network of co-authors of Palash Dey

This figure shows the co-authorship network connecting the top 25 collaborators of Palash Dey. A scholar is included among the top collaborators of Palash Dey based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Palash Dey. Palash Dey is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Dey, Palash, et al.. (2024). Query complexity of tournament solutions. Theoretical Computer Science. 991. 114422–114422.

2.

Dey, Palash, et al.. (2024). Evaluating District-based Election Surveys with Synthetic Dirichlet Likelihood. 1400–1408.

3.

Dey, Palash, et al.. (2024). Parameterized aspects of distinct Kemeny rank aggregation. Acta Informatica. 61(4). 401–414.

4.

Dey, Palash & Neeldhara Misra. (2023). On the exact amount of missing information that makes finding possible winners hard. Journal of Computer and System Sciences. 135. 32–54.

5.

Dey, Palash. (2023). Priced Gerrymandering. Theoretical Computer Science. 972. 114080–114080.

6.

Dey, Palash, et al.. (2023). Sampling-Based Winner Prediction in District-Based Elections. 2661–2663.

7.

Dey, Palash & Sourav Medya. (2020). Manipulating Node Similarity Measures in Networks. Adaptive Agents and Multi-Agents Systems. 321–329. 2 indexed citations

8.

Dey, Palash, Neeldhara Misra, & Y. Narahari. (2018). Complexity of manipulation with partial information in voting. Theoretical Computer Science. 726. 78–99. 6 indexed citations

9.

Dey, Palash, et al.. (2017). Proportional Representation in Vote Streams. Adaptive Agents and Multi-Agents Systems. 15–23. 3 indexed citations

10.

Dey, Palash, Neeldhara Misra, & Y. Narahari. (2017). Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. Adaptive Agents and Multi-Agents Systems. 783. 42–50. 4 indexed citations

11.

Dey, Palash, Neeldhara Misra, & Y. Narahari. (2017). Frugal bribery in voting. Theoretical Computer Science. 676. 15–32. 13 indexed citations

12.

Dey, Palash & Neeldhara Misra. (2016). Elicitation for preferences single peaked on trees. arXiv (Cornell University). 215–221. 7 indexed citations

13.

Dey, Palash & Sudip Talukdar. (2016). Influence of Warping on Modal Parameters of Thin-walled Channel Section Steel Beam. Procedia Engineering. 144. 52–59. 6 indexed citations

14.

Dey, Palash, et al.. (2015). Sample Complexity for Winner Prediction in Elections. 1421–1430.

15.

Dey, Palash, Neeldhara Misra, & Y. Narahari. (2015). Detecting Possible Manipulators in Elections. arXiv (Cornell University). 1441–1450. 7 indexed citations

16.

Dey, Palash & Arnab Bhattacharyya. (2015). Sample Complexity for Winner Prediction in Elections. arXiv (Cornell University). 1421–1430. 9 indexed citations

17.

Dey, Palash. (2015). Computational Complexity of Fundamental Problems in Social Choice Theory. Adaptive Agents and Multi-Agents Systems. 1973–1974. 1 indexed citations

18.

Dey, Palash, Neeldhara Misra, & Y. Narahari. (2015). Kernelization complexity of possible winner and coalitional manipulation problems in voting. Theoretical Computer Science. 616. 111–125. 13 indexed citations

19.

Dey, Palash & Y. Narahari. (2014). Asymptotic collusion-proofness of voting rules: the case of large number of candidates. Adaptive Agents and Multi-Agents Systems. 1419–1420. 3 indexed citations

20.

Chowdhury, Mohammad Asaduzzaman, et al.. (2013). Experimental Investigation on Friction and Wear of Stainless Steel 304 Sliding Against Different Pin Materials. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact