The SCEAS System
Navigation Menu

Search the dblp DataBase


R. Balakrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. R. Balakrishnan, Richard F. Hobson
    A Greedy Router with Technology Targetable Output. [Citation Graph (0, 0)][DBLP]
    Great Lakes Symposium on VLSI, 1999, pp:252-255 [Conf]
  2. R. Balakrishnan, Ramendra K. Sahoo
    Lossless compression for large scale cluster logs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  3. T. Srinivasan, R. Balakrishnan, S. A. Gangadharan, V. Hayawardh
    Supervised Grid-of-Tries: A Novel Framework for Classifier Management. [Citation Graph (0, 0)][DBLP]
    ICDCN, 2006, pp:373-378 [Conf]
  4. R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
    On Hamilton cycle decompositions of the tensor product of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:49-58 [Journal]
  5. 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:1-3, pp:293-297 [Journal]
  6. R. Balakrishnan, R. Sampathkumar, V. Yegnanarayanan
    Extremal graphs in some coloring problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:186, n:1-3, pp:15-24 [Journal]
  7. R. Balakrishnan, P. Paulraja
    Hamilton cycles in tensor product of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:186, n:1-3, pp:1-13 [Journal]
  8. R. Balakrishnan, R. Sampathkumar
    Decompositions of regular graphs into Knc v 2K2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:19-28 [Journal]

  9. A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment. [Citation Graph (, )][DBLP]

  10. Wiener index of graphs with more than one cut-vertex. [Citation Graph (, )][DBLP]

  11. A sharp lower bound for the Wiener index of a graph [Citation Graph (, )][DBLP]

  12. Connectivity of the Mycielskian of a graph. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002