C. R. Subramanian Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
T. Karthick, C. R. Subramanian: Star coloring subcubic graphs. Discussiones Mathematicae Graph Theory 33(2): 373-385 (2013)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, C. R. Subramanian: Forbidden subgraph colorings and the oriented chromatic number. Eur. J. Comb. 34(3): 620-631 (2013)
2012
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kunal Dutta, Dhruv Mubayi, C. R. Subramanian: New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs. SIAM J. Discrete Math. 26(3): 1134-1147 (2012)
2011
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian: The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. Algorithmica 61(4): 857-881 (2011)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, T. Karthick, C. R. Subramanian: Bounding χ in terms of ω and Δ for some classes of graphs. Discrete Mathematics 311(12): 911-920 (2011)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, N. Narayanan, C. R. Subramanian: Oriented colouring of some graph products. Discussiones Mathematicae Graph Theory 31(4): 675-686 (2011)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kunal Dutta, C. R. Subramanian: On induced acyclic subgraphs in sparse random digraphs. Electronic Notes in Discrete Mathematics 38: 319-324 (2011)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. S. Narayanaswamy, C. R. Subramanian: Dominating set based exact algorithms for 3-coloring. Inf. Process. Lett. 111(6): 251-255 (2011)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, C. R. Subramanian: Bounds on vertex colorings with restrictions on the union of color classes. Journal of Graph Theory 66(3): 213-234 (2011)
2010
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rahul Muthu, N. Narayanan, C. R. Subramanian: Optimal acyclic edge colouring of grid like graphs. Discrete Mathematics 310(21): 2769-2775 (2010)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, C. R. Subramanian: Bounds on Edge Colorings with Restrictions on the Union of Color Classes. SIAM J. Discrete Math. 24(3): 841-852 (2010)
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kunal Dutta, C. R. Subramanian: Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. LATIN 2010: 627-637
2009
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rahul Muthu, N. Narayanan, C. R. Subramanian: On k-intersection edge colourings. Discussiones Mathematicae Graph Theory 29(2): 411-418 (2009)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, C. R. Subramanian: Intersection Dimension and Maximum Degree. Electronic Notes in Discrete Mathematics 35: 353-358 (2009)
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
N. R. Aravind, C. R. Subramanian: Forbidden Subgraph Colorings and the Oriented Chromatic Number. IWOCA 2009: 60-71
2008
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Joel Spencer, C. R. Subramanian: On the Size of Induced Acyclic Subgraphs in Random Digraphs. Discrete Mathematics & Theoretical Computer Science 10(2) (2008)
2007
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: List Set Colouring: Bounds and Algorithms. Combinatorics, Probability & Computing 16(1): 145-158 (2007)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rahul Muthu, N. Narayanan, C. R. Subramanian: Improved bounds on acyclic edge colouring. Discrete Mathematics 307(23): 3063-3069 (2007)
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rahul Muthu, N. Narayanan, C. R. Subramanian: Acyclic Edge Colouring of Outerplanar Graphs. AAIM 2007: 144-152
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
2006
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
R. Balasubramanian, C. R. Subramanian: On Sampling Colorings of Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science 8(1): 17-30 (2006)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Analysis of a heuristic for acyclic edge colouring. Inf. Process. Lett. 99(6): 227-229 (2006)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rahul Muthu, N. Narayanan, C. R. Subramanian: Optimal Acyclic Edge Colouring of Grid Like Graphs. COCOON 2006: 360-367
2005
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Rahul Muthu, N. Narayanan, C. R. Subramanian: Improved bounds on acyclic edge colouring. Electronic Notes in Discrete Mathematics 19: 171-177 (2005)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster algorithms for feedback vertex set. Electronic Notes in Discrete Mathematics 19: 273-279 (2005)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
L. Sunil Chandran, C. R. Subramanian: Girth and treewidth. J. Comb. Theory, Ser. B 93(1): 23-32 (2005)
2003
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Finding Induced Acyclic Subgraphs in Random Digraphs. Electr. J. Comb. 10 (2003)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian: Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393
2002
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian, C. E. Veni Madhavan: General Partitioning on Random Graphs. J. Algorithms 42(1): 153-172 (2002)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248
2001
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Paths of specified length in random k-partite graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 133-138 (2001)
2000
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Algorithms For Colouring Random K-Colourable Graphs. Combinatorics, Probability & Computing 9(1): 45-77 (2000)
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Coloring Sparse Random Graphs in Polynominal Average Time. ESA 2000: 415-426
1999
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Minimum Coloring k-Colorable Graphs in Polynomial Average Time. J. Algorithms 33(1): 112-123 (1999)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. SODA 1999: 795-804
1998
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan: Algorithms for coloring semi-random graphs. Random Struct. Algorithms 13(2): 125-158 (1998)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
1995
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. FOCS 1995: 463-472
1994
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian, C. E. Veni Madhavan: Coloring Semi-Random Graphs in Polynomial Expected Time. FSTTCS 1994: 137-148
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
C. R. Subramanian: Improved Algorithms for Coloring Random Graphs. ISAAC 1994: 460-468
1993
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan: Coloring Random Graphs in Polynomial Expected Time. ISAAC 1993: 31-37
1992
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Martin Fürer, C. R. Subramanian: Coloring Random Graphs. SWAT 1992: 284-291

Coauthor Index

1N. R. Aravind
[j29] [j26] [j25] [j22] [j20] [j18] [c14]
2R. Balasubramanian
[j14]
3L. Sunil Chandran
[j11] [j8] [j6] [c10]
4Kunal Dutta
[j28] [j24] [c15]
5Martin Fürer
[j1] [c2] [c1]
6T. Karthick
[j30] [j26]
7Telikepalli Kavitha
[c10]
8Vadim V. Lozin
[j11]
9C. E. Veni Madhavan
[j5] [j1] [c4] [c2]
10Sounaka Mishra
[j27] [c12]
11Dhruv Mubayi
[j28]
12Rahul Muthu
[j21] [j19] [j15] [c13] [c11] [j10]
13N. Narayanan (Narayanan Narayanan)
[j25] [j21] [j19] [j15] [c13] [c11] [j10]
14N. S. Narayanaswamy
[j23]
15Venkatesh Raman
[j27] [c12] [j12] [j9] [c9]
16Saket Saurabh
[j27] [c12] [j12] [j9] [c9]
17Claus-Peter Schnorr
[c6]
18Somnath Sikdar
[j27] [c12]
19Joel H. Spencer (Joel Spencer)
[j17]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Mon May 20 03:59:46 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page