default search action
G. Ramakrishna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Mithinti Srikanth, Prashant Singh, G. Ramakrishna:
GPU Algorithms for Fastest Path Problem in Temporal Graphs. ICPP 2024: 587-596 - [i10]Mithinti Srikanth, G. Ramakrishna:
Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks. CoRR abs/2404.19422 (2024) - 2022
- [c7]Chirayu Anant Haryan, G. Ramakrishna, Kishore Kothapalli, Dip Sankar Banerjee:
Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components. IPDPS 2022: 1195-1205 - 2021
- [c6]Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth:
On Short Fastest Paths in Temporal Graphs. WALCOM 2021: 40-51 - 2020
- [c5]Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre, Allam Dinesh Reddy:
A GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks. HiPC 2020: 171-180
2010 – 2019
- 2019
- [i9]Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre, Allam Dinesh Reddy:
GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks. CoRR abs/1912.00966 (2019) - 2016
- [j5]Pankaj Pundir, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Grid Graphs. Electron. Notes Discret. Math. 55: 131-134 (2016) - 2015
- [j4]N. S. Narayanaswamy, G. Ramakrishna:
Characterization of minimum cycle basis in weighted partial 2-trees. Discret. Appl. Math. 192: 77-81 (2015) - [j3]N. S. Narayanaswamy, G. Ramakrishna:
Tree t-spanners in outerplanar graphs via supply demand partition. Discret. Appl. Math. 195: 104-109 (2015) - [j2]N. S. Narayanaswamy, G. Ramakrishna:
On minimum average stretch spanning trees in polygonal 2-trees. Theor. Comput. Sci. 575: 56-70 (2015) - [c4]Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna:
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. WALCOM 2015: 89-100 - 2014
- [j1]Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. J. Graph Algorithms Appl. 18(3): 325-346 (2014) - [c3]N. S. Narayanaswamy, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. WALCOM 2014: 310-321 - [i8]N. S. Narayanaswamy, G. Ramakrishna:
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees. CoRR abs/1401.0432 (2014) - [i7]Sachin Lakra, T. V. Prasad, G. Ramakrishna:
Representation of a Sentence using a Polar Fuzzy Neutrosophic Semantic Net. CoRR abs/1405.0423 (2014) - 2013
- [c2]Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. WG 2013: 225-236 - [i6]N. S. Narayanaswamy, G. Ramakrishna:
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CoRR abs/1302.5889 (2013) - [i5]Carola Doerr, G. Ramakrishna, Jens M. Schmidt:
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. CoRR abs/1303.0728 (2013) - 2012
- [c1]N. S. Narayanaswamy, G. Ramakrishna:
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CTW 2012: 193-196 - [i4]Sachin Lakra, T. V. Prasad, G. Ramakrishna:
Speech Signal Filters based on Soft Computing Techniques: A Comparison. CoRR abs/1209.4445 (2012) - [i3]T. V. Prasad, Sachin Lakra, G. Ramakrishna:
Applicability of Crisp and Fuzzy Logic in Intelligent Response Generation. CoRR abs/1209.4532 (2012) - [i2]Sachin Lakra, T. V. Prasad, G. Ramakrishna:
The Future of Neural Networks. CoRR abs/1209.4855 (2012) - [i1]N. S. Narayanaswamy, G. Ramakrishna:
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees. CoRR abs/1210.7919 (2012)
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-08-23 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint