default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. R. Subramanian 0001
Person information
- affiliation: Homi Bhabha National Institute (HBNI), Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j37]Kunal Dutta
, C. R. Subramanian:
On Induced Paths, Holes, and Trees in Random Graphs. SIAM J. Discret. Math. 37(1): 279-303 (2023)- 2022
- [j36]C. R. Subramanian:
Inductive graph invariants and approximation algorithms . Discret. Math. Algorithms Appl. 14(6): 2250019:1-2250019:36 (2022) - [j35]Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
On approximating MIS over B1-VPG graphs*. Discret. Math. Algorithms Appl. 14(7): 2250035:1-2250035:13 (2022) - [c20]Aditya Narasimhan, Sridhar Radhakrishnan, Mohammad Atiquzzaman, C. R. Subramanian:
High-Speed Packet Classification: A Case for Approximate Sorting. GLOBECOM 2022: 5765-5770 - 2021
- [j34]N. R. Aravind, C. R. Subramanian:
Intersection dimension and graph invariants. Discuss. Math. Graph Theory 41(1): 153-166 (2021) - [j33]Zuyuan Zhang, Sridhar Radhakrishnan, C. R. Subramanian, Kash Barker, Andrés D. González:
Causal Node Failures and Computation of Giant and Small Components in Networks. IEEE Trans. Netw. Sci. Eng. 8(4): 3048-3060 (2021) - [e1]Apurva Mudgal, C. R. Subramanian:
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings. Lecture Notes in Computer Science 12601, Springer 2021, ISBN 978-3-030-67898-2 [contents] - 2020
- [c19]C. R. Subramanian:
Inductive Graph Invariants and Algorithmic Applications. COCOA 2020: 780-801
2010 – 2019
- 2019
- [i1]Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
Approximating MIS over equilateral B1-VPG graphs. CoRR abs/1912.07957 (2019) - 2018
- [c18]Kunal Dutta, C. R. Subramanian:
On Induced Paths, Holes and Trees in Random Graphs. ANALCO 2018: 168-177 - 2016
- [j32]Kunal Dutta, C. R. Subramanian:
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs. SIAM J. Discret. Math. 30(3): 1848-1865 (2016) - 2015
- [c17]C. R. Subramanian:
Probabilistic Arguments in Graph Coloring (Invited Talk). CALDAM 2015: 1-8 - [c16]Abhiruk Lahiri, Joydeep Mukherjee, C. R. Subramanian:
Maximum Independent Set on B_1 B 1 -VPG Graphs. COCOA 2015: 633-646 - 2014
- [j31]Kunal Dutta, C. R. Subramanian:
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms. Discuss. Math. Graph Theory 34(3): 467-495 (2014) - 2013
- [j30]T. Karthick, C. R. Subramanian:
Star coloring subcubic graphs. Discuss. Math. Graph Theory 33(2): 373-385 (2013) - [j29]N. R. Aravind, C. R. Subramanian:
Forbidden subgraph colorings and the oriented chromatic number. Eur. J. Comb. 34(3): 620-631 (2013) - 2012
- [j28]Kunal Dutta, Dhruv Mubayi, C. R. Subramanian:
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs. SIAM J. Discret. Math. 26(3): 1134-1147 (2012) - 2011
- [j27]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) - [j26]N. R. Aravind, T. Karthick, C. R. Subramanian:
Bounding χ in terms of ω and Δ for some classes of graphs. Discret. Math. 311(12): 911-920 (2011) - [j25]N. R. Aravind, N. Narayanan, C. R. Subramanian:
Oriented colouring of some graph products. Discuss. Math. Graph Theory 31(4): 675-686 (2011) - [j24]Kunal Dutta, C. R. Subramanian:
On induced acyclic subgraphs in sparse random digraphs. Electron. Notes Discret. Math. 38: 319-324 (2011) - [j23]N. S. Narayanaswamy, C. R. Subramanian:
Dominating set based exact algorithms for 3-coloring. Inf. Process. Lett. 111(6): 251-255 (2011) - [j22]N. R. Aravind, C. R. Subramanian:
Bounds on vertex colorings with restrictions on the union of color classes. J. Graph Theory 66(3): 213-234 (2011) - 2010
- [j21]Rahul Muthu, N. Narayanan, C. R. Subramanian:
Optimal acyclic edge colouring of grid like graphs. Discret. Math. 310(21): 2769-2775 (2010) - [j20]N. R. Aravind, C. R. Subramanian:
Bounds on Edge Colorings with Restrictions on the Union of Color Classes. SIAM J. Discret. Math. 24(3): 841-852 (2010) - [c15]Kunal Dutta, C. R. Subramanian:
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. LATIN 2010: 627-637
2000 – 2009
- 2009
- [j19]Rahul Muthu, N. Narayanan, C. R. Subramanian:
On k-intersection edge colourings. Discuss. Math. Graph Theory 29(2): 411-418 (2009) - [j18]N. R. Aravind, C. R. Subramanian:
Intersection Dimension and Maximum Degree. Electron. Notes Discret. Math. 35: 353-358 (2009) - [c14]N. R. Aravind, C. R. Subramanian:
Forbidden Subgraph Colorings and the Oriented Chromatic Number. IWOCA 2009: 60-71 - 2008
- [j17]Joel Spencer, C. R. Subramanian:
On the Size of Induced Acyclic Subgraphs in Random Digraphs. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - 2007
- [j16]C. R. Subramanian:
List Set Colouring: Bounds and Algorithms. Comb. Probab. Comput. 16(1): 145-158 (2007) - [j15]Rahul Muthu, N. Narayanan, C. R. Subramanian:
Improved bounds on acyclic edge colouring. Discret. Math. 307(23): 3063-3069 (2007) - [c13]Rahul Muthu, N. Narayanan, C. R. Subramanian:
Acyclic Edge Colouring of Outerplanar Graphs. AAIM 2007: 144-152 - [c12]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
- [j14]R. Balasubramanian, C. R. Subramanian:
On Sampling Colorings of Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 8(1): 17-30 (2006) - [j13]C. R. Subramanian:
Analysis of a heuristic for acyclic edge colouring. Inf. Process. Lett. 99(6): 227-229 (2006) - [j12]Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. Algorithms 2(3): 403-415 (2006) - [c11]Rahul Muthu, N. Narayanan, C. R. Subramanian:
Optimal Acyclic Edge Colouring of Grid Like Graphs. COCOON 2006: 360-367 - 2005
- [j11]L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian:
Graphs of low chordality. Discret. Math. Theor. Comput. Sci. 7(1): 25-36 (2005) - [j10]Rahul Muthu, N. Narayanan, C. R. Subramanian:
Improved bounds on acyclic edge colouring. Electron. Notes Discret. Math. 19: 171-177 (2005) - [j9]Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster algorithms for feedback vertex set. Electron. Notes Discret. Math. 19: 273-279 (2005) - [j8]L. Sunil Chandran, C. R. Subramanian:
Girth and treewidth. J. Comb. Theory B 93(1): 23-32 (2005) - 2003
- [j7]C. R. Subramanian:
Finding Induced Acyclic Subgraphs in Random Digraphs. Electron. J. Comb. 10 (2003) - [j6]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) - [c10]L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian:
Isoperimetric Inequalities and the Width Parameters of Graphs. COCOON 2003: 385-393 - 2002
- [j5]C. R. Subramanian, C. E. Veni Madhavan:
General Partitioning on Random Graphs. J. Algorithms 42(1): 153-172 (2002) - [c9]Venkatesh Raman, Saket Saurabh, C. R. Subramanian:
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248 - 2001
- [j4]C. R. Subramanian:
Paths of specified length in random k-partite graphs. Discret. Math. Theor. Comput. Sci. 4(2): 133-138 (2001) - 2000
- [j3]C. R. Subramanian:
Algorithms For Colouring Random K-Colourable Graphs. Comb. Probab. Comput. 9(1): 45-77 (2000) - [c8]C. R. Subramanian:
Coloring Sparse Random Graphs in Polynominal Average Time. ESA 2000: 415-426
1990 – 1999
- 1999
- [j2]C. R. Subramanian:
Minimum Coloring k-Colorable Graphs in Polynomial Average Time. J. Algorithms 33(1): 112-123 (1999) - [c7]C. R. Subramanian:
A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. SODA 1999: 795-804 - 1998
- [j1]C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan:
Algorithms for coloring semi-random graphs. Random Struct. Algorithms 13(2): 125-158 (1998) - [c6]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
- [c5]C. R. Subramanian:
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. FOCS 1995: 463-472 - 1994
- [c4]C. R. Subramanian, C. E. Veni Madhavan:
Coloring Semi-Random Graphs in Polynomial Expected Time. FSTTCS 1994: 137-148 - [c3]C. R. Subramanian:
Improved Algorithms for Coloring Random Graphs. ISAAC 1994: 460-468 - 1993
- [c2]Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan:
Coloring Random Graphs in Polynomial Expected Time. ISAAC 1993: 31-37 - 1992
- [c1]Martin Fürer, C. R. Subramanian:
Coloring Random Graphs. SWAT 1992: 284-291
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
