The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

C. E. Veni Madhavan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. V. Gopalakrishna, C. E. Veni Madhavan
    Performance Evaluation of Attribute-Based Tree Organization. [Citation Graph (2, 9)][DBLP]
    ACM Trans. Database Syst., 1980, v:5, n:1, pp:69-87 [Journal]
  2. P. Pradeep Kumar, C. E. Veni Madhavan
    Shortest Watchman Tours in Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:91-96 [Conf]
  3. V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
    Circuits, Pebbling and Expressibility. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:223-230 [Conf]
  4. S. Rengarajan, C. E. Veni Madhavan
    Stack and Queue Number of 2-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:203-212 [Conf]
  5. N. S. Narayanaswamy, C. E. Veni Madhavan
    On Assigning Prefix Free Codes to the Vertices of a Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:328-337 [Conf]
  6. Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Computing the Shortest Path Tree in a Weak Visibility Polygon. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:369-389 [Conf]
  7. P. Sreenivasa Kumar, C. E. Veni Madhavan
    A New Class of Separators and Planarity of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:30-43 [Conf]
  8. V. S. Lakshmanan, N. Chandrasekaran, C. E. Veni Madhavan
    Recognition and Top-Down Generation of beta-Acyclic Database Schemes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1984, pp:344-366 [Conf]
  9. V. S. Lakshmanan, C. E. Veni Madhavan
    The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1985, pp:303-328 [Conf]
  10. V. S. Lakshmanan, C. E. Veni Madhavan
    Binary Decompositions and Acyclic Schemes. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:214-238 [Conf]
  11. C. E. Veni Madhavan
    Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1984, pp:381-392 [Conf]
  12. P. Shanti Sastry, N. Jayakumar, C. E. Veni Madhavan
    Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:65-78 [Conf]
  13. C. R. Subramanian, C. E. Veni Madhavan
    Coloring Semi-Random Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:137-148 [Conf]
  14. R. Sai Anand, C. E. Veni Madhavan
    An Online, Transferable E-Cash Payment System. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2000, pp:93-103 [Conf]
  15. Abhijit Das, C. E. Veni Madhavan
    Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:295-306 [Conf]
  16. Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan
    Coloring Random Graphs in Polynomial Expected Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:31-37 [Conf]
  17. V. Suresh, S. Maria Sophia, C. E. Veni Madhavan
    Resampling Operations as Features for Detecting LSB Replacement and LSB Matching in Color Images. [Citation Graph (0, 0)][DBLP]
    MRCS, 2006, pp:249-256 [Conf]
  18. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Characterizing and Recognizing Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:213-233 [Journal]
  19. P. Sreenivasa Kumar, C. E. Veni Madhavan
    Clique tree generalization and new subclasses of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:109-131 [Journal]
  20. P. Sreenivasa Kumar, C. E. Veni Madhavan
    Minimal Vertex Separators of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:155-168 [Journal]
  21. N. S. Narayanaswamy, C. E. Veni Madhavan
    Lower Bounds for OBDDs and Nisan's pseudorandom generator [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:20, pp:- [Journal]
  22. Abhijit Das, C. E. Veni Madhavan
    On the cubic sieve method for computing discrete logarithms over prime fields. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2005, v:82, n:12, pp:1481-1495 [Journal]
  23. Bhaskar DasGupta, C. E. Veni Madhavan
    An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:1, pp:35-44 [Journal]
  24. N. Ch. Veeraraghavulu, P. Sreenivasa Kumar, C. E. Veni Madhavan
    A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:1, pp:45-49 [Journal]
  25. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1985, v:21, n:5, pp:433-442 [Journal]
  26. C. R. Subramanian, C. E. Veni Madhavan
    General Partitioning on Random Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:153-172 [Journal]
  27. C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan
    Algorithms for coloring semi-random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:2, pp:125-158 [Journal]
  28. C. E. Veni Madhavan, S. Krishna
    Comments on "Optimal Design of Distributed Information Systems". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:12, pp:1200-1201 [Journal]
  29. V. S. Lakshmanan, C. E. Veni Madhavan
    An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:103-128 [Journal]
  30. C. E. Veni Madhavan
    Secondary Attribute Retrieval Using Tree Data Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:33, n:, pp:107-116 [Journal]
  31. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
    An algorithm for recognizing palm polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1994, v:10, n:8, pp:443-451 [Journal]
  32. V. Suresh, Narayanan Raghupathy, B. Shekar, C. E. Veni Madhavan
    Discovering Mentorship Information from Author Collaboration Networks. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:197-208 [Conf]

  33. Bit Domain Encryption. [Citation Graph (, )][DBLP]


  34. On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations. [Citation Graph (, )][DBLP]


  35. Bit Plane Encoding and Encryption. [Citation Graph (, )][DBLP]


  36. Clustering in Concept Association Networks. [Citation Graph (, )][DBLP]


  37. Two New Families of Low-Correlation Interleaved QAM Sequences. [Citation Graph (, )][DBLP]


  38. Stopword Graphs and Authorship Attribution in Text Corpora. [Citation Graph (, )][DBLP]


  39. A perturbative resampling approach to image steganalysis. [Citation Graph (, )][DBLP]


  40. Cover Image Preprocessing for More Reliable LSB Replacement Steganography. [Citation Graph (, )][DBLP]


  41. Measures for classification and detection in steganalysis [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002