C. R. Subramanian

h-index: 17
Citations: 1,122
Publications: 13

About

C. R. Subramanian is a researcher at San Francisco General Hospital. With over three decades of active research spanning from 1993 to 2023, he has contributed 13 publications on graph theory and its applications. His work focuses on developing algorithms for coloring and partitioning random graphs, as well as exploring induced subgraphs in digraphs. Subramanian's research aims to provide efficient solutions for complex graph-related problems.

Research areas

Mathematics
Combinatorics
Computer science
Graph
Discrete mathematics

Publications (13)

Sorted by most cited.

Sort:

On Induced Paths, Holes and Trees in Random Graphs
2018
View DOI
11 cites
Algorithms for coloring semi-random graphs
1998
View DOI
9 cites
Finding Induced Acyclic Subgraphs in Random Digraphs
2003
View DOI
8 cites
Coloring random graphs in polynomial expected time
1993
View DOI
8 cites
General Partitioning on Random Graphs
2002
View DOI
6 cites
Improved algorithms for coloring random graphs
1994
View DOI
6 cites
Minimum coloring random and semi-random graphs in polynomial expected time
2002
View DOI
5 cites
On the size of induced acyclic subgraphs in random digraphs
2008
3 cites
Coloring semi-random graphs in polynomial expected time
1994
View DOI
2 cites
On Induced Paths, Holes, and Trees in Random Graphs
2023
View DOI
1 cites
On induced acyclic subgraphs in sparse random digraphs
2011
View DOI
1 cites
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration
2010
View DOI
1 cites
Paths of specified length in random k-partite graphs
2001
View DOI
0 cites