C. R. Subramanian

	2009
31		N. R. Aravind, C. R. Subramanian: Forbidden Subgraph Colorings and the Oriented Chromatic Number. IWOCA 2009: 60-71
	2008
30		Joel Spencer, C. R. Subramanian: On the Size of Induced Acyclic Subgraphs in Random Digraphs. Discrete Mathematics & Theoretical Computer Science 10(2): (2008)
	2007
29		Rahul Muthu, N. Narayanan, C. R. Subramanian: Acyclic Edge Colouring of Outerplanar Graphs. AAIM 2007: 144-152
28		Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. ISAAC 2007: 268-279
27		C. R. Subramanian: List Set Colouring: Bounds and Algorithms. Combinatorics, Probability & Computing 16(1): 145-158 (2007)
26		Rahul Muthu, N. Narayanan, C. R. Subramanian: Improved bounds on acyclic edge colouring. Discrete Mathematics 307(23): 3063-3069 (2007)
	2006
25		Rahul Muthu, N. Narayanan, C. R. Subramanian: Optimal Acyclic Edge Colouring of Grid Like Graphs. COCOON 2006: 360-367
24		Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Transactions on Algorithms 2(3): 403-415 (2006)
23		R. Balasubramanian, C. R. Subramanian: On Sampling Colorings of Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science 8(1): 17-30 (2006)
22		C. R. Subramanian: Analysis of a heuristic for acyclic edge colouring. Inf. Process. Lett. 99(6): 227-229 (2006)
	2005
21		L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)
20		Rahul Muthu, N. Narayanan, C. R. Subramanian: Improved bounds on acyclic edge colouring. Electronic Notes in Discrete Mathematics 19: 171-177 (2005)
19		Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster algorithms for feedback vertex set. Electronic Notes in Discrete Mathematics 19: 273-279 (2005)
18		L. Sunil Chandran, C. R. Subramanian: Girth and treewidth. J. Comb. Theory, Ser. B 93(1): 23-32 (2005)
	2003
17		L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian: Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393
16		C. R. Subramanian: Finding Induced Acyclic Subgraphs in Random Digraphs. Electr. J. Comb. 10: (2003)
15		L. Sunil Chandran, C. R. Subramanian: A spectral lower bound for the treewidth of a graph and its consequences. Inf. Process. Lett. 87(4): 195-200 (2003)
	2002
14		Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248
13		C. R. Subramanian, C. E. Veni Madhavan: General Partitioning on Random Graphs. J. Algorithms 42(1): 153-172 (2002)
	2001
12		C. R. Subramanian: Paths of specified length in random k-partite graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 133-138 (2001)
	2000
11		C. R. Subramanian: Coloring Sparse Random Graphs in Polynominal Average Time. ESA 2000: 415-426
10		C. R. Subramanian: Algorithms For Colouring Random K-Colourable Graphs. Combinatorics, Probability & Computing 9(1): (2000)
	1999
9		C. R. Subramanian: A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. SODA 1999: 795-804
8		C. R. Subramanian: Minimum Coloring k-Colorable Graphs in Polynomial Average Time. J. Algorithms 33(1): 112-123 (1999)
	1998
7		Claus-Peter Schnorr, C. R. Subramanian: Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). RANDOM 1998: 218-231
6		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
5		C. R. Subramanian: Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. FOCS 1995: 463-472
	1994
4		C. R. Subramanian, C. E. Veni Madhavan: Coloring Semi-Random Graphs in Polynomial Expected Time. FSTTCS 1994: 137-148
3		C. R. Subramanian: Improved Algorithms for Coloring Random Graphs. ISAAC 1994: 460-468
	1993
2		Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan: Coloring Random Graphs in Polynomial Expected Time. ISAAC 1993: 31-37
	1992
1		Martin Fürer, C. R. Subramanian: Coloring Random Graphs. SWAT 1992: 284-291

Coauthor Index

1	N. R. Aravind	[31]
2	R. Balasubramanian	[23]
3	L. Sunil Chandran	[15] [17] [18] [21]
4	Martin Fürer	[1] [2] [6]
5	Telikepalli Kavitha	[17]
6	Vadim V. Lozin	[21]
7	C. E. Veni Madhavan	[2] [4] [6] [13]
8	Sounaka Mishra	[28]
9	Rahul Muthu	[20] [25] [26] [29]
10	N. Narayanan	[20] [25] [26] [29]
11	Venkatesh Raman	[14] [19] [24] [28]
12	Saket Saurabh	[14] [19] [24] [28]
13	Claus-Peter Schnorr	[7]
14	Somnath Sikdar	[28]
15	Joel H. Spencer (Joel Spencer)	[30]

Colors in the list of coauthors