N. V. Vinodchandran
-
- Complexity and Algorithms in Graphs 24
- Computability, Logic, AI Algorithms 14
- Advanced Graph Theory Research 13
- semigroups and automata theory 6
- Artificial Intelligence top 10%
- Machine Learning and Algorithms 10
- Bayesian Modeling and Causal Inference 5
- Cryptography and Data Security 5
-
- Optimization and Search Problems 5
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
- Computational Mathematics 2
- Computer Networks and Communications 69
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
The 25 scholars most cited alongside N. V. Vinodchandran, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2023 | 3 | |
| 3 | 2021 | 1 | |
| 4 | New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. | 2014 | 1 |
| 5 | 2012 | 7 | |
| 6 | 2011 | 7 | |
| 7 | Green's Theorem and Isolation in Planar Graphs. | 2010 | 1 |
| 8 | Kolmogorov Complexity in Randomness Extraction. | 2009 | 2 |
| 9 | 2009 | 23 | |
| 10 | 2008 | 9 | |
| 11 | 2007 | 3 | |
| 12 | 2005 | 26 | |
| 13 | 2005 | 4 | |
| 14 | 2005 | 25 | |
| 15 | 2005 | 14 | |
| 16 | 2005 | 6 | |
| 17 | 2004 | 2 | |
| 18 | 2000 | 2 | |
| 19 | 2000 | 2 | |
| 20 | 1997 | 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), Advanced Graph Theory Research (13 papers), Machine Learning and Algorithms (10 papers), semigroups and automata theory (6 papers), Bayesian Modeling and Causal Inference (5 papers), Optimization and Search Problems (5 papers) and Cryptography and Data Security (5 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.
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.