C. E. Veni Madhavan

1.3k total citations
38 papers, 234 citations indexed

About

C. E. Veni Madhavan is a scholar working on Computer Vision and Pattern Recognition, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, C. E. Veni Madhavan has authored 38 papers receiving a total of 234 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computer Vision and Pattern Recognition, 16 papers in Artificial Intelligence and 8 papers in Computer Networks and Communications. Recurrent topics in C. E. Veni Madhavan's work include Chaos-based Image/Signal Encryption (11 papers), Coding theory and cryptography (6 papers) and Advanced Graph Theory Research (6 papers). C. E. Veni Madhavan is often cited by papers focused on Chaos-based Image/Signal Encryption (11 papers), Coding theory and cryptography (6 papers) and Advanced Graph Theory Research (6 papers). C. E. Veni Madhavan collaborates with scholars based in India, United States and Germany. C. E. Veni Madhavan's co-authors include Pankaj Kumar, V. Suresh, Abhijit Das, R. Arun, S. R. S. Iyengar, Katharina A. Zweig, C. R. Subramanian, M. Wilscy, P. Vijay Kumar and Subhamoy Maitra and has published in prestigious journals such as Information Processing & Management, Theoretical Computer Science and ACM Transactions on Database Systems.

In The Last Decade

C. E. Veni Madhavan

38 papers receiving 217 citations

Peers

C. E. Veni Madhavan

CNC

CVPR

CTM

Roman Dementiev Germany

Asoke Kumar Datta United States

Mark W. Goudreau United States

Francesco Silvestri Italy

Lorenzo Sarti Italy

Michael F. Ringenburg United States

Theocharis Malamatos Hong Kong

Gerard Allwein United States

Ashkan Aazami Canada

Jop F. Sibeyn Germany

Roman Dementiev Germany

C. E. Veni Madhavan

108 ×1.0

184 ×2.7

CNC

72 ×1.1

CVPR

29 ×0.6

CTM

32 ×0.8

Citations per year, relative to C. E. Veni Madhavan C. E. Veni Madhavan (= 1×) peers Roman Dementiev

Countries citing papers authored by C. E. Veni Madhavan

Since Specialization

Citations

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

Fields of papers citing papers by C. E. Veni Madhavan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of C. E. Veni Madhavan

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

Madhavan, C. E. Veni, et al.. (2014). Efficient dictionary for salted password analysis. 3788. 1–6. 7 indexed citations

Iyengar, S. R. S., et al.. (2012). Understanding Human Navigation Using Network Analysis. Topics in Cognitive Science. 4(1). 121–134. 25 indexed citations

Suresh, V. & C. E. Veni Madhavan. (2012). Image Encryption with Space-filling Curves. Defence Science Journal. 62(1). 46–50. 14 indexed citations

Madhavan, C. E. Veni, et al.. (2007). Lightweight Encryption for Images. 1–2. 7 indexed citations

Maitra, Subhamoy, C. E. Veni Madhavan, & Ramarathnam Venkatesan. (2006). Progress in Cryptology - INDOCRYPT 2005: 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings (Lecture Notes in Computer Science). Springer eBooks. 2 indexed citations

Maitra, Subhamoy, C. E. Veni Madhavan, & Ramarathnam Venkatesan. (2005). Progress in cryptology - INDOCRYPT 2005 : 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005 : proceedings. Springer eBooks. 1 indexed citations

Madhavan, C. E. Veni, et al.. (2005). On the cubic sieve method for computing discrete logarithms over prime fields. International Journal of Computer Mathematics. 82(12). 1481–1495. 2 indexed citations

Madhavan, C. E. Veni, et al.. (2003). Recent Trends in Applied Cryptology. IETE Technical Review. 20(2). 119–128. 1 indexed citations

Kumar, Pankaj & C. E. Veni Madhavan. (2002). Clique tree generalization and new subclasses of chordal graphs. Discrete Applied Mathematics. 117(1-3). 109–131. 10 indexed citations

10.

Subramanian, C. R. & C. E. Veni Madhavan. (2002). General Partitioning on Random Graphs. Journal of Algorithms. 42(1). 153–172. 5 indexed citations

11.

Madhavan, C. E. Veni, et al.. (2002). Steganography based Information Security. IETE Technical Review. 19(4). 213–219. 6 indexed citations

12.

Kumar, Pankaj & C. E. Veni Madhavan. (1998). Minimal vertex separators of chordal graphs. Discrete Applied Mathematics. 89(1-3). 155–168. 21 indexed citations

13.

Subramanian, C. R., et al.. (1998). Algorithms for coloring semi-random graphs. Random Structures and Algorithms. 13(2). 125–158. 4 indexed citations

14.

Subramanian, C. R. & C. E. Veni Madhavan. (1997). The existence of homeomorphic subgraphs in chordal graphs. Applied Mathematics Letters. 10(3). 17–22. 2 indexed citations

15.

Ghosh, Subir Kumar, et al.. (1994). An algorithm for recognizing palm polygons. The Visual Computer. 10(8). 443–451. 1 indexed citations

16.

Ghosh, Subir Kumar, et al.. (1993). Characterizing and recognizing weak visibility polygons. Computational Geometry. 3(4). 213–233. 10 indexed citations

17.

Kumar, Pankaj, et al.. (1992). A linear-time algorithm for isomorphism of a subclass of chordal graphs. Information Processing Letters. 44(1). 45–49. 3 indexed citations

18.

Dasgupta, Bhaskar & C. E. Veni Madhavan. (1989). An approximate algorithm for the minimal vertex nested polygon problem. Information Processing Letters. 33(1). 35–44. 2 indexed citations

19.

Madhavan, C. E. Veni, et al.. (1987). An algebraic theory of functional and multivalued dependencies in relational databases. Theoretical Computer Science. 54(1). 103–128. 5 indexed citations

20.

Madhavan, C. E. Veni. (1984). Secondary attribute retrieval using tree data structures. Theoretical Computer Science. 33(1). 107–116. 2 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