N. V. Vinodchandran
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Computer Vision and Pattern Recognition top 10%
- Computer Networks and Communications top 10%
- Statistics and Probability top 10%
- Co-authors
- Peter Bro MiltersenStephen ScottQingping TaoJohn M. HitchcockByrav RamamurthyXukai ZouA. PavanDieter van Melkebeek
- Topics
- Complexity and Algorithms in Graphs (24 papers)Computability, Logic, AI Algorithms (14 papers)Advanced Graph Theory Research (13 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceComputer Vision and Pattern Recognition
- Journals
- IEEE Transactions on Pattern Analysis and Machine IntelligenceCommunications of the ACMIEEE Transactions on Software Engineering
- Partner nations
- United StatesIndiaSingapore
In The Last Decade
N. V. Vinodchandran
49 papers receiving 343 citations
Peers
Comparison fields: 5 of 54
- Computational Theory and Mathematics 201
- Artificial Intelligence 197
- Computer Vision and Pattern Recognition 83
- Computer Networks and Communications 69
- Statistics and Probability 23
Countries citing papers authored by N. V. Vinodchandran
This map shows the geographic impact of N. V. Vinodchandran'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 N. V. Vinodchandran with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites N. V. Vinodchandran more than expected).
Fields of papers citing papers by N. V. Vinodchandran
This network shows the impact of papers produced by N. V. Vinodchandran. 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 N. V. Vinodchandran. The network helps show where N. V. Vinodchandran may publish in the future.
Co-authorship network of co-authors of N. V. Vinodchandran
This figure shows the co-authorship network connecting the top 25 collaborators of N. V. Vinodchandran. A scholar is included among the top collaborators of N. V. Vinodchandran 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 N. V. Vinodchandran. N. V. Vinodchandran is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 3 | |
| 3 | 1 | |
| 4 | New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. | 1 |
| 5 | 7 | |
| 6 | 7 | |
| 7 | Green's Theorem and Isolation in Planar Graphs. | 1 |
| 8 | Kolmogorov Complexity in Randomness Extraction. | 2 |
| 9 | 23 | |
| 10 | 9 | |
| 11 | 3 | |
| 12 | 26 | |
| 13 | 4 | |
| 14 | 25 | |
| 15 | 14 | |
| 16 | 6 | |
| 17 | 2 | |
| 18 | 2 | |
| 19 | 2 | |
| 20 | 7 |
About N. V. Vinodchandran
N. V. Vinodchandran is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistics and Probability, having authored 54 papers that have together received 371 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (24 papers), Computability, Logic, AI Algorithms (14 papers) and Advanced Graph Theory Research (13 papers). The work is most often cited by research in Computational Theory and Mathematics (201 citations), Artificial Intelligence (197 citations) and Computer Vision and Pattern Recognition (83 citations). N. V. Vinodchandran has collaborated with scholars based in United States, India and Singapore. Frequent co-authors include Peter Bro Miltersen, Stephen Scott, Qingping Tao, John M. Hitchcock, Byrav Ramamurthy, Xukai Zou, A. Pavan, Dieter van Melkebeek, Lance Fortnow and Luís Antunes. Their work appears in journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, Communications of the ACM and IEEE Transactions on Software Engineering.
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.