Niranjan Balachandran
- Discrete Mathematics and Combinatorics
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Computational Theory and Mathematics
- Artificial Intelligence
- Topics
- graph theory and CDMA systems (4 papers)Coding theory and cryptography (3 papers)Stability and Control of Uncertain Systems (3 papers)
- Cited by
- Discrete Mathematics and CombinatoricsAlgebra and Number TheoryComputational Theory and Mathematics
- Partner nations
- IndiaUnited StatesItaly
In The Last Decade
Niranjan Balachandran
12 papers receiving 30 citations
Peers
Comparison fields: 5 of 16
- Discrete Mathematics and Combinatorics 12
- Electrical and Electronic Engineering 11
- Computer Networks and Communications 10
- Computational Theory and Mathematics 10
- Artificial Intelligence 9
Countries citing papers authored by Niranjan Balachandran
This map shows the geographic impact of Niranjan Balachandran'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 Niranjan Balachandran with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Niranjan Balachandran more than expected).
Fields of papers citing papers by Niranjan Balachandran
This network shows the impact of papers produced by Niranjan Balachandran. 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 Niranjan Balachandran. The network helps show where Niranjan Balachandran may publish in the future.
Co-authorship network of co-authors of Niranjan Balachandran
This figure shows the co-authorship network connecting the top 25 collaborators of Niranjan Balachandran. A scholar is included among the top collaborators of Niranjan Balachandran 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 Niranjan Balachandran. Niranjan Balachandran is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | 6 | |
| 6 | 2 | |
| 7 | 0 | |
| 8 | 1 | |
| 9 | 1 | |
| 10 | 0 | |
| 11 | 1 | |
| 12 | Algorithmic synthesis of stabilizing switching signals for discrete-time switched linear systems. | 1 |
| 13 | 12 | |
| 14 | 2 | |
| 15 | 3 |
About Niranjan Balachandran
Niranjan Balachandran is a scholar working on Computational Mathematics, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 15 papers that have together received 33 indexed citations. Recurring topics across this work include graph theory and CDMA systems (4 papers), Coding theory and cryptography (3 papers) and Stability and Control of Uncertain Systems (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (12 citations), Algebra and Number Theory (3 citations) and Computational Theory and Mathematics (10 citations). Niranjan Balachandran has collaborated with scholars based in India, United States and Italy. Frequent co-authors include D.K. Ray-Chaudhuri, Atreyee Kundu, Debasish Chatterjee, Pablo Spiga and Rogers Mathew. Their work appears in journals such as IEEE Transactions on Automatic Control, Automatica and Linear Algebra and its Applications.
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.