default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Balakrishnan
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]R. Balakrishnan, S. Krishnamoorthy, Wasin So:
Resistance distance in connected balanced digraphs. Discret. Appl. Math. 337: 46-53 (2023)
2010 – 2019
- 2019
- [j14]R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay:
Some properties of the Knödel graph W(k, 2k), k≥4. Australas. J Comb. 74: 17-32 (2019) - 2016
- [j13]Gopalapillai Indulal, R. Balakrishnan:
Distance spectrum of Indu-Bala product of graphs. AKCE Int. J. Graphs Comb. 13(3): 230-234 (2016) - 2015
- [j12]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): 628-671 (2015) - 2013
- [j11]A. Anuradha, R. Balakrishnan, Xiaolin Chen, Xueliang Li, Huishu Lian, Wasin So:
Skew Spectra of Oriented Bipartite Graphs. Electron. J. Comb. 20(4): 18 (2013) - 2012
- [j10]R. Balakrishnan, T. Kavaskar, Wasin So:
The energy of the Mycielskian of a regular graph. Australas. J Comb. 52: 163-172 (2012) - [j9]R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu:
Preface. Discret. Math. 312(9): 1493 (2012) - 2010
- [i1]R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer:
A sharp lower bound for the Wiener index of a graph. CoRR abs/1008.4039 (2010)
2000 – 2009
- 2008
- [j8]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) - 2007
- [c3]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: 1-8 - 2006
- [c2]T. Srinivasan, R. Balakrishnan, S. A. Gangadharan, Hayawardh Vijayakumar:
Supervised Grid-of-Tries: A Novel Framework for Classifier Management. ICDCN 2006: 373-378 - 2003
- [j7]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): 49-58 (2003) - 2000
- [j6]V. Yegnanarayanan, R. Balakrishnan, R. Sampathkumar:
On the existence of graphs with prescribed coloring parameters. Discret. Math. 216(1-3): 293-297 (2000)
1990 – 1999
- 1999
- [c1]R. Balakrishnan, Richard F. Hobson:
A Greedy Router with Technology Targetable Output. Great Lakes Symposium on VLSI 1999: 252-255 - 1998
- [j5]R. Balakrishnan, P. Paulraja:
Hamilton cycles in tensor product of graphs. Discret. Math. 186(1-3): 1-13 (1998) - [j4]R. Balakrishnan, R. Sampathkumar, V. Yegnanarayanan:
Extremal graphs in some coloring problems. Discret. Math. 186(1-3): 15-24 (1998) - 1996
- [j3]R. Balakrishnan, R. Sampathkumar:
Decompositions of regular graphs into Knc v 2K2. Discret. Math. 156(1-3): 19-28 (1996) - 1994
- [j2]R. Balakrishnan, R. Sampathkumar:
Decompositions of complete graphs into isomorphic bipartite subgraphs. Graphs Comb. 10(1): 19-25 (1994)
1980 – 1989
- 1984
- [j1]R. Balakrishnan, P. Paulraja:
Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs. J. Graph Theory 8(3): 423-426 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
