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: 8.

Conference Proceedings

Lahiri, Abhiruk and Mukherjee, Joydeep and Subramanian, CR (2015) Maximum Independent Set on B-1-VPG Graphs. In: 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA), DEC 18-20, 2015, Houston, TX, pp. 633-646.

Conference Paper

Subramanian, CR (1995) Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. In: 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings, 23-25 October 1995, Milwaukee, WI, USA, pp. 463-472.

Subramanian, CR and Veni, Madhavan CE (1994) Coloring semi-random graphs in polynomial expected time. In: 14th Conference. Proceedings Foundations of Software Technology and Theoretical Computer Science, 15-17 Dec. 1994, Madras, India, pp. 137-148.

Subramanian, CR (1994) Improved algorithms for coloring random graphs. In: 5th International Symposium, ISAAC '94. Algorithms and Computation, 25-27 Aug. 1994, Beijing, China, pp. 460-468.

Journal Article

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

Subramanian, CR (2000) Algorithms for Colouring Random k-colourable Graphs. In: Combinatorics, Probability & Computing, 9 (1). pp. 45-77.

Subramanian, CR and Furer, Martin and Madhavan, Veni CE (1998) Algorithms for Coloring Semi-random Graphs. In: Random Structures and Algorithms, 13 (2). pp. 125-158.

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

This list was generated on Fri Oct 23 00:04:26 2020 IST.