2009 |
40 | EE | Sujit Gujar,
C. E. Veni Madhavan:
Measures for classification and detection in steganalysis
CoRR abs/0901.0529: (2009) |
2008 |
39 | EE | Anil Yekkala,
C. E. Veni Madhavan:
Bit Domain Encryption.
ACIVS 2008: 45-56 |
38 | EE | Gagan Garg,
P. Vijay Kumar,
C. E. Veni Madhavan:
Two New Families of Low-Correlation Interleaved QAM Sequences.
SETA 2008: 130-141 |
2007 |
37 | EE | V. Suresh,
Narayanan Raghupathy,
B. Shekar,
C. E. Veni Madhavan:
Discovering Mentorship Information from Author Collaboration Networks.
Discovery Science 2007: 197-208 |
36 | EE | Anil Yekkala,
C. E. Veni Madhavan:
Bit Plane Encoding and Encryption.
PReMI 2007: 103-110 |
2006 |
35 | EE | V. Suresh,
S. Maria Sophia,
C. E. Veni Madhavan:
Resampling Operations as Features for Detecting LSB Replacement and LSB Matching in Color Images.
MRCS 2006: 249-256 |
2005 |
34 | | Subhamoy Maitra,
C. E. Veni Madhavan,
Ramarathnam Venkatesan:
Progress in Cryptology - INDOCRYPT 2005, 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings
Springer 2005 |
33 | EE | Abhijit Das,
C. E. Veni Madhavan:
On the cubic sieve method for computing discrete logarithms over prime fields.
Int. J. Comput. Math. 82(12): 1481-1495 (2005) |
2003 |
32 | EE | Indivar Gupta,
Laxmi Narain,
C. E. Veni Madhavan:
Cryptological Applications of Permutation Polynomials.
Electronic Notes in Discrete Mathematics 15: 91 (2003) |
2002 |
31 | | P. Sreenivasa Kumar,
C. E. Veni Madhavan:
Clique tree generalization and new subclasses of chordal graphs.
Discrete Applied Mathematics 117(1-3): 109-131 (2002) |
30 | EE | C. R. Subramanian,
C. E. Veni Madhavan:
General Partitioning on Random Graphs.
J. Algorithms 42(1): 153-172 (2002) |
2001 |
29 | EE | N. S. Narayanaswamy,
C. E. Veni Madhavan:
On Assigning Prefix Free Codes to the Vertices of a Graph.
COCOON 2001: 328-337 |
28 | EE | N. S. Narayanaswamy,
C. E. Veni Madhavan:
Lower Bounds for OBDDs and Nisan's pseudorandom generator
Electronic Colloquium on Computational Complexity (ECCC) 8(20): (2001) |
2000 |
27 | EE | R. Sai Anand,
C. E. Veni Madhavan:
An Online, Transferable E-Cash Payment System.
INDOCRYPT 2000: 93-103 |
1999 |
26 | EE | Abhijit Das,
C. E. Veni Madhavan:
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields.
ISAAC 1999: 295-306 |
1998 |
25 | EE | P. Sreenivasa Kumar,
C. E. Veni Madhavan:
Minimal Vertex Separators of Chordal Graphs.
Discrete Applied Mathematics 89(1-3): 155-168 (1998) |
24 | | C. R. Subramanian,
Martin Fürer,
C. E. Veni Madhavan:
Algorithms for coloring semi-random graphs.
Random Struct. Algorithms 13(2): 125-158 (1998) |
1995 |
23 | | S. Rengarajan,
C. E. Veni Madhavan:
Stack and Queue Number of 2-Trees.
COCOON 1995: 203-212 |
1994 |
22 | | C. R. Subramanian,
C. E. Veni Madhavan:
Coloring Semi-Random Graphs in Polynomial Expected Time.
FSTTCS 1994: 137-148 |
21 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
C. E. Veni Madhavan:
An algorithm for recognizing palm polygons.
The Visual Computer 10(8): 443-451 (1994) |
1993 |
20 | | P. Pradeep Kumar,
C. E. Veni Madhavan:
Shortest Watchman Tours in Weak Visibility Polygons.
CCCG 1993: 91-96 |
19 | | Martin Fürer,
C. R. Subramanian,
C. E. Veni Madhavan:
Coloring Random Graphs in Polynomial Expected Time.
ISAAC 1993: 31-37 |
18 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
Sanjeev Saluja,
C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons.
Comput. Geom. 3: 213-233 (1993) |
1992 |
17 | | N. Ch. Veeraraghavulu,
P. Sreenivasa Kumar,
C. E. Veni Madhavan:
A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs.
Inf. Process. Lett. 44(1): 45-49 (1992) |
1991 |
16 | | Subir Kumar Ghosh,
Anil Maheshwari,
Sudebkumar Prasant Pal,
Sanjeev Saluja,
C. E. Veni Madhavan:
Computing the Shortest Path Tree in a Weak Visibility Polygon.
FSTTCS 1991: 369-389 |
1990 |
15 | | Kesav V. Nori,
C. E. Veni Madhavan:
Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings
Springer 1990 |
14 | | V. Vinay,
H. Venkateswaran,
C. E. Veni Madhavan:
Circuits, Pebbling and Expressibility.
Structure in Complexity Theory Conference 1990: 223-230 |
1989 |
13 | | C. E. Veni Madhavan:
Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings
Springer 1989 |
12 | | P. Sreenivasa Kumar,
C. E. Veni Madhavan:
A New Class of Separators and Planarity of Chordal Graphs.
FSTTCS 1989: 30-43 |
11 | | Bhaskar DasGupta,
C. E. Veni Madhavan:
An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem.
Inf. Process. Lett. 33(1): 35-44 (1989) |
1987 |
10 | | P. Shanti Sastry,
N. Jayakumar,
C. E. Veni Madhavan:
Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs.
FSTTCS 1987: 65-78 |
9 | | V. S. Lakshmanan,
C. E. Veni Madhavan:
An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases.
Theor. Comput. Sci. 54: 103-128 (1987) |
1986 |
8 | | V. S. Lakshmanan,
C. E. Veni Madhavan:
Binary Decompositions and Acyclic Schemes.
FSTTCS 1986: 214-238 |
1985 |
7 | | V. S. Lakshmanan,
C. E. Veni Madhavan:
The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach.
FSTTCS 1985: 303-328 |
6 | EE | Nageswara S. V. Rao,
S. Sitharama Iyengar,
C. E. Veni Madhavan:
A comparative study of multiple attribute tree and inverted file structures for large bibliographic files.
Inf. Process. Manage. 21(5): 433-442 (1985) |
1984 |
5 | | V. S. Lakshmanan,
N. Chandrasekaran,
C. E. Veni Madhavan:
Recognition and Top-Down Generation of beta-Acyclic Database Schemes.
FSTTCS 1984: 344-366 |
4 | | C. E. Veni Madhavan:
Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs.
FSTTCS 1984: 381-392 |
3 | | C. E. Veni Madhavan:
Secondary Attribute Retrieval Using Tree Data Structures.
Theor. Comput. Sci. 33: 107-116 (1984) |
1983 |
2 | | C. E. Veni Madhavan,
S. Krishna:
Comments on "Optimal Design of Distributed Information Systems".
IEEE Trans. Computers 32(12): 1200-1201 (1983) |
1980 |
1 | EE | V. Gopalakrishna,
C. E. Veni Madhavan:
Performance Evaluation of Attribute-Based Tree Organization.
ACM Trans. Database Syst. 5(1): 69-87 (1980) |