| 2008 |
|---|
| 11 | EE | R. Balakrishnan,
N. Sridharan,
K. Viswanathan Iyer:
Wiener index of graphs with more than one cut-vertex.
Appl. Math. Lett. 21(9): 922-927 (2008) |
| 10 | EE | R. Balakrishnan,
S. Francis Raj:
Connectivity of the Mycielskian of a graph.
Discrete Mathematics 308(12): 2607-2610 (2008) |
| 2007 |
|---|
| 9 | EE | Thanukrishnan Srinivasan,
R. Balakrishnan,
S. A. Gangadharan,
V. Hayawardh:
A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment.
ICPADS 2007: 1-8 |
| 2006 |
|---|
| 8 | EE | T. Srinivasan,
R. Balakrishnan,
S. A. Gangadharan,
V. Hayawardh:
Supervised Grid-of-Tries: A Novel Framework for Classifier Management.
ICDCN 2006: 373-378 |
| 7 | EE | R. Balakrishnan,
Ramendra K. Sahoo:
Lossless compression for large scale cluster logs.
IPDPS 2006 |
| 2003 |
|---|
| 6 | EE | R. Balakrishnan,
Jean-Claude Bermond,
P. Paulraja,
Min-Li Yu:
On Hamilton cycle decompositions of the tensor product of complete graphs.
Discrete Mathematics 268(1-3): 49-58 (2003) |
| 2000 |
|---|
| 5 | EE | V. Yegnanarayanan,
R. Balakrishnan,
R. Sampathkumar:
On the existence of graphs with prescribed coloring parameters.
Discrete Mathematics 216(1-3): 293-297 (2000) |
| 1999 |
|---|
| 4 | EE | R. Balakrishnan,
Richard F. Hobson:
A Greedy Router with Technology Targetable Output.
Great Lakes Symposium on VLSI 1999: 252-255 |
| 1998 |
|---|
| 3 | EE | R. Balakrishnan,
P. Paulraja:
Hamilton cycles in tensor product of graphs.
Discrete Mathematics 186(1-3): 1-13 (1998) |
| 2 | EE | R. Balakrishnan,
R. Sampathkumar,
V. Yegnanarayanan:
Extremal graphs in some coloring problems.
Discrete Mathematics 186(1-3): 15-24 (1998) |
| 1996 |
|---|
| 1 | EE | R. Balakrishnan,
R. Sampathkumar:
Decompositions of regular graphs into Knc v 2K2.
Discrete Mathematics 156(1-3): 19-28 (1996) |
