Neeldhara Misra

1.4k total citations
38 papers, 268 citations indexed

About

Neeldhara Misra is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Neeldhara Misra has authored 38 papers receiving a total of 268 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 11 papers in Artificial Intelligence and 10 papers in Computer Networks and Communications. Recurrent topics in Neeldhara Misra's work include Advanced Graph Theory Research (24 papers), Complexity and Algorithms in Graphs (21 papers) and Game Theory and Voting Systems (10 papers). Neeldhara Misra is often cited by papers focused on Advanced Graph Theory Research (24 papers), Complexity and Algorithms in Graphs (21 papers) and Game Theory and Voting Systems (10 papers). Neeldhara Misra collaborates with scholars based in India, Norway and Germany. Neeldhara Misra's co-authors include Saket Saurabh, Daniel Lokshtanov, Palash Dey, Fedor V. Fomin, Venkatesh Raman, Y. Narahari, Geevarghese Philip, Frances Rosamond, Michael R. Fellows and Matthias Mnich and has published in prestigious journals such as Macromolecules, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Neeldhara Misra

31 papers receiving 262 citations

Peers

Neeldhara Misra

CTM

CNC

MSOR

Garth Isaak United States

Omri Weinstein United States

Pierre Charbit France

Pim van ’t Hof Norway

Ami Paz Israel

Mao-cheng Cai China

Gerd Wechsung Germany

Rajiv Raman United States

Csilla Bujtás Hungary

Miloš Stojaković Serbia

Garth Isaak United States

Neeldhara Misra

216 ×1.0

CTM

43 ×0.6

CNC

18 ×0.3

38 ×0.7

37 ×0.9

MSOR

Citations per year, relative to Neeldhara Misra Neeldhara Misra (= 1×) peers Garth Isaak

Countries citing papers authored by Neeldhara Misra

Since Specialization

Citations

This map shows the geographic impact of Neeldhara Misra'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 Neeldhara Misra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Neeldhara Misra more than expected).

Fields of papers citing papers by Neeldhara Misra

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Neeldhara Misra. 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 Neeldhara Misra. The network helps show where Neeldhara Misra may publish in the future.

Co-authorship network of co-authors of Neeldhara Misra

This figure shows the co-authorship network connecting the top 25 collaborators of Neeldhara Misra. A scholar is included among the top collaborators of Neeldhara Misra 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 Neeldhara Misra. Neeldhara Misra 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

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

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.

Misra, Neeldhara, et al.. (2020). Parameterized complexity of happy coloring problems. Theoretical Computer Science. 835. 58–81. 2 indexed citations

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

Misra, Neeldhara, et al.. (2018). Color spanning objects: Algorithms and hardness results. Discrete Applied Mathematics. 280. 14–22.

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

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

Misra, Neeldhara, et al.. (2016). On the Computational Hardness of Manipulating Pairwise Voting Rules. Adaptive Agents and Multi-Agents Systems. 358–367. 2 indexed citations

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

10.

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

11.

Misra, Neeldhara, et al.. (2015). On the Parameterized Complexity of Minimax Approval Voting. Adaptive Agents and Multi-Agents Systems. 97–105. 18 indexed citations

12.

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

13.

Misra, Neeldhara, et al.. (2015). Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM Journal on Discrete Mathematics. 29(4). 1815–1836. 3 indexed citations

14.

Misra, Neeldhara, et al.. (2013). Solving min ones 2 -sat as fast as vertex cover. Theoretical Computer Science. 506. 115–121. 2 indexed citations

15.

Misra, Neeldhara, et al.. (2013). Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 24. 237–248. 1 indexed citations

16.

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, & Saket Saurabh. (2012). On Parameterized Independent Feedback Vertex Set. Theoretical Computer Science. 461. 65–75. 13 indexed citations

17.

Fomin, Fedor V., Daniel Lokshtanov, Neeldhara Misra, & Saket Saurabh. (2012). Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. 470–479. 48 indexed citations

18.

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, & Saket Saurabh. (2012). The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica. 68(2). 504–530. 5 indexed citations

19.

Misra, Neeldhara, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, & Somnath Sikdar. (2011). FPT algorithms for Connected Feedback Vertex Set. Journal of Combinatorial Optimization. 24(2). 131–146. 16 indexed citations

20.

Misra, Neeldhara, Venkatesh Raman, & Saket Saurabh. (2010). Lower bounds on kernelization. Discrete Optimization. 8(1). 110–128. 12 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