
Search the dblp DataBase
R. Balakrishnan:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 R. Balakrishnan, Richard F. Hobson
A Greedy Router with Technology Targetable Output. [Citation Graph (0, 0)][DBLP] Great Lakes Symposium on VLSI, 1999, pp:252255 [Conf]
 R. Balakrishnan, Ramendra K. Sahoo
Lossless compression for large scale cluster logs. [Citation Graph (0, 0)][DBLP] IPDPS, 2006, pp: [Conf]
 T. Srinivasan, R. Balakrishnan, S. A. Gangadharan, V. Hayawardh
Supervised GridofTries: A Novel Framework for Classifier Management. [Citation Graph (0, 0)][DBLP] ICDCN, 2006, pp:373378 [Conf]
 R. Balakrishnan, JeanClaude Bermond, P. Paulraja, MinLi Yu
On Hamilton cycle decompositions of the tensor product of complete graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:268, n:13, pp:4958 [Journal]
 V. Yegnanarayanan, R. Balakrishnan, R. Sampathkumar
On the existence of graphs with prescribed coloring parameters. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:216, n:13, pp:293297 [Journal]
 R. Balakrishnan, R. Sampathkumar, V. Yegnanarayanan
Extremal graphs in some coloring problems. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:186, n:13, pp:1524 [Journal]
 R. Balakrishnan, P. Paulraja
Hamilton cycles in tensor product of graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:186, n:13, pp:113 [Journal]
 R. Balakrishnan, R. Sampathkumar
Decompositions of regular graphs into K_{n}^{c} v 2K_{2}. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:156, n:13, pp:1928 [Journal]
A scalable parallelization of allpairs shortest path algorithm for a high performance cluster environment. [Citation Graph (, )][DBLP]
Wiener index of graphs with more than one cutvertex. [Citation Graph (, )][DBLP]
A sharp lower bound for the Wiener index of a graph [Citation Graph (, )][DBLP]
Connectivity of the Mycielskian of a graph. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
