R. Balakrishnan

Publication Activity (10 Years)

Years Active: 1984-2023
Publications (10 Years): 3

Top Topics

Bipartite Graph

Maximum Matching

Superlinear Convergence

Top Venues

Australas. J Comb.

Electron. J. Comb.

AKCE Int. J. Graphs Comb.

Publications

R. Balakrishnan, S. Krishnamoorthy, Wasin So
Resistance distance in connected balanced digraphs. Discret. Appl. Math. 337 (2023)
R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay
), k≥4. Australas. J Comb. 74 (2019)
Gopalapillai Indulal, R. Balakrishnan
Distance spectrum of Indu-Bala product of graphs. AKCE Int. J. Graphs Comb. 13 (3) (2016)
S. Easter Selvan, S. Thomas George, R. Balakrishnan
Range-Based ICA Using a Nonsmooth Quasi-Newton Optimizer for Electroencephalographic Source Localization in Focal Epilepsy. Neural Comput. 27 (3) (2015)
A. Anuradha, R. Balakrishnan, Xiaolin Chen, Xueliang Li, Huishu Lian, Wasin So
Skew Spectra of Oriented Bipartite Graphs. Electron. J. Comb. 20 (4) (2013)
R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu
Preface. Discret. Math. 312 (9) (2012)
R. Balakrishnan, T. Kavaskar, Wasin So
The energy of the Mycielskian of a regular graph. Australas. J Comb. 52 (2012)
R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer
A sharp lower bound for the Wiener index of a graph CoRR (2010)
R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer
Wiener index of graphs with more than one cut-vertex. Appl. Math. Lett. 21 (9) (2008)
Thanukrishnan Srinivasan, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar
A scalable parallelization of all-pairs shortest path algorithm for a high performance cluster environment. ICPADS (2007)
R. Balakrishnan, Ramendra K. Sahoo
Lossless compression for large scale cluster logs. IPDPS (2006)
T. Srinivasan, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar
Supervised Grid-of-Tries: A Novel Framework for Classifier Management. ICDCN (2006)
R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
On Hamilton cycle decompositions of the tensor product of complete graphs. Discret. Math. 268 (1-3) (2003)
V. Yegnanarayanan, R. Balakrishnan, R. Sampathkumar
On the existence of graphs with prescribed coloring parameters. Discret. Math. 216 (1-3) (2000)
R. Balakrishnan, Richard F. Hobson
A Greedy Router with Technology Targetable Output. Great Lakes Symposium on VLSI (1999)
R. Balakrishnan, R. Sampathkumar, V. Yegnanarayanan
Extremal graphs in some coloring problems. Discret. Math. 186 (1-3) (1998)
R. Balakrishnan, P. Paulraja
Hamilton cycles in tensor product of graphs. Discret. Math. 186 (1-3) (1998)
R. Balakrishnan, R. Sampathkumar
. Discret. Math. 156 (1-3) (1996)
R. Balakrishnan, R. Sampathkumar
Decompositions of complete graphs into isomorphic bipartite subgraphs. Graphs Comb. 10 (1) (1994)
R. Balakrishnan, P. Paulraja
-partite digraphs. J. Graph Theory 8 (3) (1984)