ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 9.

Conference Paper

Kumar, PP and Madhavan, CEV (1993) Shortest watchman tours in weak visibility polygons. In: CCCG. Proceedings of the Fifth Canadian Conference on Computational Geometry, 5-9 Aug. 1993, Waterloo, Ont., Canada, pp. 91-96.

Journal Article

Kumar, PS and Madhavan, CEV (2002) Clique tree generalization and new subclasses of chordal graphs. In: Discrete Applied Mathematics, 117 (1-3). pp. 109-131.

Subramanian, CR and Madhavan, CEV (2002) General partitioning on random graphs. In: Journal of Algorithms, 42 (1). pp. 153-172.

Subramanian, CR and Madhavan, CEV (1997) The existence of homeomorphic subgraphs in chordal graphs. In: Applied Mathematics Letters, 10 (3). pp. 17-22.

Pal, SP and Dasgupta, B and Madhavan, CEV (1994) Optimal polygon placement by translation. In: International Journal of Computer Mathematics, 52 (3-4). 139-148 .

Lakshmanan, VS and Madhavan, CEV (1985) The Implication Problem for Functional and Multivalued Dependencies. In: Lecture Notes in Computer Science, 206 . pp. 303-328.

Madhavan, CEV and Iyengar, S Sitharama and Madhavan, Veni CE (1985) A comparative study of multiple attribute tree and inverted file structures for large bibliographic files. In: Information Processing & Management, 21 (5). pp. 433-442.

Madhavan, CEV (1984) Approximation algorithm for maximum independent set in planar traingle-free graphs. In: Lecture Notes in Computer Science, 181 . pp. 381-392.

Lakshmanan, VS and Chandrasekaran, N and Madhavan, CEV (1984) Recognition And Top-Down Generation Of Beta-Acyclic Database Schemes. In: Lecture Notes In Computer Science, 181 . pp. 344-366.

This list was generated on Mon Oct 21 04:13:33 2019 IST.