C. Pandu Rangan

3.5k total citations
102 papers, 901 citations indexed

About

C. Pandu Rangan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, C. Pandu Rangan has authored 102 papers receiving a total of 901 indexed citations (citations by other indexed papers that have themselves been cited), including 59 papers in Computational Theory and Mathematics, 50 papers in Artificial Intelligence and 33 papers in Computer Networks and Communications. Recurrent topics in C. Pandu Rangan's work include Complexity and Algorithms in Graphs (40 papers), Cryptography and Data Security (40 papers) and Advanced Graph Theory Research (33 papers). C. Pandu Rangan is often cited by papers focused on Complexity and Algorithms in Graphs (40 papers), Cryptography and Data Security (40 papers) and Advanced Graph Theory Research (33 papers). C. Pandu Rangan collaborates with scholars based in India, United States and United Kingdom. C. Pandu Rangan's co-authors include Venkatesan Guruswami, Arpita Patra, Kannan Srinathan, Anup Rao, Ashish Choudhury, Ravi Sundaram, Swarun Kumar, S. Sharmila Deva Selvi, S. Coorg and S. Sree Vivek and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Journal of Parallel and Distributed Computing.

In The Last Decade

C. Pandu Rangan

93 papers receiving 823 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
C. Pandu Rangan India	17	608	344	306	99	98	102	901
Martin Fürer United States	13	473 0.8×	201 0.6×	294 1.0×	93 0.9×	108 1.1×	38	744
Henning Fernau Germany	18	1.0k 1.6×	354 1.0×	394 1.3×	32 0.3×	85 0.9×	190	1.3k
Ross M. McConnell United States	19	928 1.5×	269 0.8×	345 1.1×	29 0.3×	132 1.3×	43	1.2k
Stefan Szeider Austria	19	879 1.4×	431 1.3×	618 2.0×	55 0.6×	60 0.6×	139	1.3k
Ryan Hayward Canada	13	357 0.6×	120 0.3×	264 0.9×	26 0.3×	59 0.6×	57	681
Francis Zane United States	12	741 1.2×	536 1.6×	349 1.1×	16 0.2×	132 1.3×	21	1.2k
Jörg Flum Germany	12	1.5k 2.5×	545 1.6×	739 2.4×	28 0.3×	73 0.7×	46	1.9k
Feodor F. Dragan United States	20	781 1.3×	275 0.8×	86 0.3×	43 0.4×	115 1.2×	82	1.0k
Vladimir Gurvich United States	15	431 0.7×	107 0.3×	196 0.6×	30 0.3×	71 0.7×	63	730
Marcin Pilipczuk Poland	15	1.2k 2.0×	464 1.3×	196 0.6×	22 0.2×	118 1.2×	102	1.5k

Countries citing papers authored by C. Pandu Rangan

Since Specialization

Citations

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

Fields of papers citing papers by C. Pandu Rangan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of C. Pandu Rangan

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

Selvi, S. Sharmila Deva, et al.. (2012). Efficient Certificateless Online/Offline Signature.. 2. 77–92. 1 indexed citations

Selvi, S. Sharmila Deva, et al.. (2012). Efficient Certificateless Online/Offline Signature with tight security. 3. 115–137. 1 indexed citations

Vivek, S. Sree, S. Sharmila Deva Selvi, Ramarathnam Venkatesan, & C. Pandu Rangan. (2012). A Special Purpose Signature Scheme for Secure Computation of Traffic in a Distributed Network.. 3. 46–60. 1 indexed citations

Vivek, S. Sree, et al.. (2012). A special purpose proxy re-signature scheme. 5 indexed citations

Choudhury, Ashish, et al.. (2011). Secure message transmission in asynchronous networks. Journal of Parallel and Distributed Computing. 71(8). 1067–1074. 2 indexed citations

Narasimhan, Harikrishna, Venkatanathan Varadarajan, & C. Pandu Rangan. (2010). Towards a Cooperative Defense Model Against Network Security Attacks.. 8 indexed citations

Shankar, Bhavani, et al.. (2008). Unconditionally reliable message transmission in directed networks. Symposium on Discrete Algorithms. 1048–1055. 4 indexed citations

Srinathan, Kannan, et al.. (2002). On perfectly secure communication over arbitrary networks. 193–202. 27 indexed citations

Rangan, C. Pandu & Cunsheng Ding. (2001). Progress in Cryptology — INDOCRYPT 2001. Lecture notes in computer science. 18 indexed citations

10.

Rangan, C. Pandu, Venkatesh Raman, & R. Ramanujam. (1999). Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science. 10 indexed citations

11.

Rotics, Udi, et al.. (1997). Restrictions of Minimum Spanner Problems. Information and Computation. 136(2). 143–164. 29 indexed citations

12.

Rangan, C. Pandu, et al.. (1996). All-pairs-shortest-length on strongly chordal graphs. Discrete Applied Mathematics. 69(1-2). 169–182. 6 indexed citations

13.

Murthy, C. Siva Ram, et al.. (1995). Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems. IEICE Transactions on Information and Systems. 78(1). 3–12. 1 indexed citations

14.

Chang, Gerard J., C. Pandu Rangan, & S. Coorg. (1995). Weighted independent perfect domination on cocomparability graphs. Discrete Applied Mathematics. 63(3). 215–222. 23 indexed citations

15.

Srikant, R., et al.. (1993). Optimal path cover problem on block graphs and bipartite permutation graphs. Theoretical Computer Science. 115(2). 351–357. 29 indexed citations

16.

Marathe, Madhav, R. Ravi, & C. Pandu Rangan. (1992). Generalized vertex covering in interval graphs. Discrete Applied Mathematics. 39(1). 87–93. 8 indexed citations

17.

Srinivasan, Aravind & C. Pandu Rangan. (1991). Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1). 1–21. 3 indexed citations

18.

Rangan, C. Pandu, et al.. (1991). On finding the minimum bandwidth of interval graphs. Information and Computation. 95(2). 218–224. 17 indexed citations

19.

Rangan, C. Pandu, et al.. (1991). An efficient algorithm for finding a two-pair, and its applications. Discrete Applied Mathematics. 31(1). 71–74. 12 indexed citations

20.

Rangan, C. Pandu, et al.. (1988). A unified approach to domination problems on interval graphs. Information Processing Letters. 27(5). 271–274. 74 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