We stand with Ukraine  

G. Ramakrishna

Orcid: 0000-0002-7554-0349

According to our database1, G. Ramakrishna authored at least 16 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks.
[BibTeX]
[DOI]
Mithinti Srikanth
,
G. Ramakrishna
CoRR, 2024

GPU Algorithms for Fastest Path Problem in Temporal Graphs.
[BibTeX]
[DOI]
Mithinti Srikanth
,
Prashant Singh
,
G. Ramakrishna
Proceedings of the 53rd International Conference on Parallel Processing, 2024

2022
Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components.
[BibTeX]
[DOI]
Chirayu Anant Haryan
,
G. Ramakrishna
,
Kishore Kothapalli
,
Dip Sankar Banerjee
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021
On Short Fastest Paths in Temporal Graphs.
[BibTeX]
[DOI]
Umesh Sandeep Danda
,
G. Ramakrishna
,
Jens M. Schmidt
,
Mithinti Srikanth
Proceedings of the WALCOM: Algorithms and Computation, 2021

2020
A GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks.
[BibTeX]
[DOI]
Chirayu Anant Haryan
,
G. Ramakrishna
,
Rupesh Nasre
,
Allam Dinesh Reddy
Proceedings of the 27th IEEE International Conference on High Performance Computing, 2020

2016
On Minimum Average Stretch Spanning Trees in Grid Graphs.
[BibTeX]
[DOI]
Pankaj Pundir
,
G. Ramakrishna
Electron. Notes Discret. Math., 2016

2015
On minimum average stretch spanning trees in polygonal 2-trees.
[BibTeX]
[DOI]
N. S. Narayanaswamy
,
G. Ramakrishna
Theor. Comput. Sci., 2015

Tree t-spanners in outerplanar graphs via supply demand partition.
[BibTeX]
[DOI]
N. S. Narayanaswamy
,
G. Ramakrishna
Discret. Appl. Math., 2015

Characterization of minimum cycle basis in weighted partial 2-trees.
[BibTeX]
[DOI]
N. S. Narayanaswamy
,
G. Ramakrishna
Discret. Appl. Math., 2015

Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs.
[BibTeX]
[DOI]
Gaurav Singh
,
N. S. Narayanaswamy
,
G. Ramakrishna
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.
[BibTeX]
[DOI]
Carola Doerr
,
G. Ramakrishna
,
Jens M. Schmidt
J. Graph Algorithms Appl., 2014

Representation of a Sentence using a Polar Fuzzy Neutrosophic Semantic Net.
[BibTeX]
[DOI]
Sachin Lakra
,
T. V. Prasad
,
G. Ramakrishna
CoRR, 2014

2012
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees
[BibTeX]
[DOI]
N. S. Narayanaswamy
,
G. Ramakrishna
CoRR, 2012

The Future of Neural Networks
[BibTeX]
[DOI]
Sachin Lakra
,
T. V. Prasad
,
G. Ramakrishna
CoRR, 2012

Applicability of Crisp and Fuzzy Logic in Intelligent Response Generation
[BibTeX]
[DOI]
T. V. Prasad
,
Sachin Lakra
,
G. Ramakrishna
CoRR, 2012

Speech Signal Filters based on Soft Computing Techniques: A Comparison
[BibTeX]
[DOI]
Sachin Lakra
,
T. V. Prasad
,
G. Ramakrishna
CoRR, 2012


  Loading...