Performance Evaluation of Attribute-Based Tree Organization. - V. Gopalakrishna; C. E. Veni Madhavan (ACM Trans. Database Syst., 1980)

Comments on "Optimal Design of Distributed Information Systems". - C. E. Veni Madhavan; S. Krishna (IEEE Trans. Computers, 1983)

Recognition and Top-Down Generation of beta-Acyclic Database Schemes. - V. S. Lakshmanan 001; N. Chandrasekharan; C. E. Veni Madhavan (FSTTCS, 1984)

Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. - C. E. Veni Madhavan (FSTTCS, 1984)

Secondary Attribute Retrieval Using Tree Data Structures. - C. E. Veni Madhavan (Theor. Comput. Sci., 1984)

The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach. - V. S. Lakshmanan 001; C. E. Veni Madhavan (FSTTCS, 1985)

A comparative study of multiple attribute tree and inverted file structures for large bibliographic files. - Nageswara S. V. Rao; S. Sitharama Iyengar; C. E. Veni Madhavan (Inf. Process. Manag., 1985)

Binary Decompositions and Acyclic Schemes. - V. S. Lakshmanan 001; C. E. Veni Madhavan (FSTTCS, 1986)

Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs. - P. Shanti Sastry; N. Jayakumar; C. E. Veni Madhavan (FSTTCS, 1987)

An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases. - V. S. Lakshmanan 001; C. E. Veni Madhavan (Theor. Comput. Sci., 1987)

A New Class of Separators and Planarity of Chordal Graphs. - P. Sreenivasa Kumar; C. E. Veni Madhavan (FSTTCS, 1989)

An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. - Bhaskar DasGupta; C. E. Veni Madhavan (Inf. Process. Lett., 1989)

Circuits, Pebbling and Expressibility. - V. Vinay; H. Venkateswaran; C. E. Veni Madhavan (SCT, 1990)

Computing the Shortest Path Tree in a Weak Visibility Polygon. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (FSTTCS, 1991)

A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs. - N. Ch. Veeraraghavulu; P. Sreenivasa Kumar; C. E. Veni Madhavan (Inf. Process. Lett., 1992)

Shortest Watchman Tours in Weak Visibility Polygons. - P. Pradeep Kumar; C. E. Veni Madhavan (CCCG, 1993)

Coloring Random Graphs in Polynomial Expected Time. - Martin Fürer; C. R. Subramanian 001; C. E. Veni Madhavan (ISAAC, 1993)

Characterizing and Recognizing Weak Visibility Polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (Comput. Geom., 1993)

Coloring Semi-Random Graphs in Polynomial Expected Time. - C. R. Subramanian 001; C. E. Veni Madhavan (FSTTCS, 1994)

An algorithm for recognizing palm polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; C. E. Veni Madhavan (Vis. Comput., 1994)

Stack and Queue Number of 2-Trees. - S. Rengarajan; C. E. Veni Madhavan (COCOON, 1995)

Minimal Vertex Separators of Chordal Graphs. - P. Sreenivasa Kumar 001; C. E. Veni Madhavan (Discret. Appl. Math., 1998)

Algorithms for coloring semi-random graphs. - C. R. Subramanian 001; Martin Fürer; C. E. Veni Madhavan (Random Struct. Algorithms, 1998)

Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. - Abhijit Das; C. E. Veni Madhavan (ISAAC, 1999)

An Online, Transferable E-Cash Payment System. - R. Sai Anand; C. E. Veni Madhavan (INDOCRYPT, 2000)

On Assigning Prefix Free Codes to the Vertices of a Graph. - N. S. Narayanaswamy; C. E. Veni Madhavan (COCOON, 2001)

Lower Bounds for OBDDs and Nisan's pseudorandom generator. - N. S. Narayanaswamy; C. E. Veni Madhavan (Electron. Colloquium Comput. Complex., 2001)

Clique tree generalization and new subclasses of chordal graphs. - P. Sreenivasa Kumar 001; C. E. Veni Madhavan (Discret. Appl. Math., 2002)

General Partitioning on Random Graphs. - C. R. Subramanian 001; C. E. Veni Madhavan (J. Algorithms, 2002)

Cryptological Applications of Permutation Polynomials. - Indivar Gupta; Laxmi Narain; C. E. Veni Madhavan (Electron. Notes Discret. Math., 2003)

On the cubic sieve method for computing discrete logarithms over prime fields. - Abhijit Das; C. E. Veni Madhavan (Int. J. Comput. Math., 2005)

Resampling Operations as Features for Detecting LSB Replacement and LSB Matching in Color Images. - V. Suresh; S. Maria Sophia; C. E. Veni Madhavan (MRCS, 2006)

Discovering Mentorship Information from Author Collaboration Networks. - V. Suresh; Narayanan Raghupathy; B. Shekar; C. E. Veni Madhavan (Discovery Science, 2007)

Bit Plane Encoding and Encryption. - Anil Yekkala; C. E. Veni Madhavan (PReMI, 2007)

Bit Domain Encryption. - Anil Yekkala; C. E. Veni Madhavan (ACIVS, 2008)

Low correlation interleaved QAM sequences. - Gagan Garg; P. Vijay Kumar; C. E. Veni Madhavan (ISIT, 2008)

Two New Families of Low-Correlation Interleaved QAM Sequences. - Gagan Garg; P. Vijay Kumar; C. E. Veni Madhavan (SETA, 2008)

A perturbative resampling approach to image steganalysis. - V. Suresh; H. V. Shashidhara; C. E. Veni Madhavan (ICUMT, 2009)

Clustering in Concept Association Networks. - R. Arun; V. Suresh; C. E. Veni Madhavan (PReMI, 2009)

Stopword Graphs and Authorship Attribution in Text Corpora. - R. Arun; V. Suresh; C. E. Veni Madhavan (ICSC, 2009)

Measures for classification and detection in steganalysis - Sujit Gujar; C. E. Veni Madhavan (CoRR, 2009)

Image Classification for More Reliable Steganalysis. - R. Shreelekshmi; M. Wilscy; C. E. Veni Madhavan (CNSA, 2010)

Cover Image Preprocessing for More Reliable LSB Replacement Steganography. - R. Shreelekshmi; M. Wilscy; C. E. Veni Madhavan (ICSAP, 2010)

On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations. - R. Arun; V. Suresh; C. E. Veni Madhavan; M. Narasimha Murty (PAKDD (1), 2010)

A Network Analysis Approach to Understand Human-wayfinding Problem. - Sudarshan Iyengar; Nina Zweig; Abhiram Natarajan; Veni Madhavan (CogSci, 2011)

Improving Query Focused Summarization Using Look-Ahead Strategy. - Rama Badrinath; Suresh Venkatasubramaniyan; C. E. Veni Madhavan (ECIR, 2011)

A Stylometric Study and Assessment of Machine Translators. - V. Suresh; Avanthi Krishnamurthy; Rama Badrinath; C. E. Veni Madhavan (IDA, 2011)

A non-syntactic approach for text sentiment classification with stopwords. - V. Suresh; Ashok Veilumuthu; Avanthi Krishnamurthy; C. E. Veni Madhavan; Kaushik Nath 002; Sunil Arvindam (WWW (Companion Volume), 2011)

A Navigation Algorithm Inspired by Human Navigation - M. Vijesh; Sudarshan Iyengar; S. M. Vijay Mahantesh; Amitash Ramesh; Veni Madhavan (CoRR, 2011)

A Navigation Algorithm Inspired by Human Navigation. - M. Vijesh; Sudarshan Iyengar; S. M. Vijay Mahantesh; Amitash Ramesh; C. Pandu Rangan; Veni Madhavan (ASONAM, 2012)

Diversity in Ranking using Negative Reinforcement - Rama Badrinath; C. E. Veni Madhavan (CoRR, 2012)

Understanding Human Navigation Using Network Analysis. - Sudarshan Iyengar; C. E. Veni Madhavan; Katharina Anna Zweig; Abhiram Natarajan (Top. Cogn. Sci., 2012)

Text Simplification for Enhanced Readability. - Siddhartha Banerjee; Nitin Kumar 003; C. E. Veni Madhavan (KDIR/KMIS, 2013)

Improved LSB stegananalysis based on analysis of adjacent pixel pairs. - R. Shreelekshmi; M. Wilscy; C. E. Veni Madhavan (Signal Image Video Process., 2013)

Sarcasm Detection using Sentiment and Semantic Features. - Prateek Nagwanshi; C. E. Veni Madhavan (KDIR, 2014)

Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences. - Srinivas Vivek 001; C. E. Veni Madhavan (J. Symb. Comput., 2014)

Keynote address: Quo Vadis PKI? - C. E. Veni Madhavan (PKIA, 2017)

Family of PRGs based on Collections of Arithmetic Progressions. - Srikanth Ch; C. E. Veni Madhavan; Kumar Swamy H. V. (IACR Cryptol. ePrint Arch., 2017)

Undetectable least significant bit replacement steganography. - R. Shreelekshmi; M. Wilscy; C. E. Veni Madhavan (Multim. Tools Appl., 2019)