G. Ramakrishna

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 7

Top Topics

Public Transport

Minimum Total Cost

Minimum Spanning Trees

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Mithinti Srikanth, Prashant Singh, G. Ramakrishna
GPU Algorithms for Fastest Path Problem in Temporal Graphs. ICPP (2024)
Mithinti Srikanth, G. Ramakrishna
Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks. CoRR (2024)
Chirayu Anant Haryan, G. Ramakrishna, Kishore Kothapalli, Dip Sankar Banerjee
Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components. IPDPS (2022)
Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, M. Srikanth
On Short Fastest Paths in Temporal Graphs. WALCOM (2021)
Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre, Allam Dinesh Reddy
A GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks. HiPC (2020)
Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre, Allam Dinesh Reddy
GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks. CoRR (2019)
Pankaj Pundir, G. Ramakrishna
On Minimum Average Stretch Spanning Trees in Grid Graphs. Electron. Notes Discret. Math. 55 (2016)
N. S. Narayanaswamy, G. Ramakrishna
Tree t-spanners in outerplanar graphs via supply demand partition. Discret. Appl. Math. 195 (2015)
N. S. Narayanaswamy, G. Ramakrishna
Characterization of minimum cycle basis in weighted partial 2-trees. Discret. Appl. Math. 192 (2015)
Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs. WALCOM (2015)
N. S. Narayanaswamy, G. Ramakrishna
On minimum average stretch spanning trees in polygonal 2-trees. Theor. Comput. Sci. 575 (2015)
Sachin Lakra, T. V. Prasad, G. Ramakrishna
Representation of a Sentence using a Polar Fuzzy Neutrosophic Semantic Net. CoRR (2014)
N. S. Narayanaswamy, G. Ramakrishna
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees. CoRR (2014)
N. S. Narayanaswamy, G. Ramakrishna
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees. WALCOM (2014)
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) (2014)
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time CoRR (2013)
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. WG (2013)
N. S. Narayanaswamy, G. Ramakrishna
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees CoRR (2013)
T. V. Prasad, Sachin Lakra, G. Ramakrishna
Applicability of Crisp and Fuzzy Logic in Intelligent Response Generation CoRR (2012)
Sachin Lakra, T. V. Prasad, G. Ramakrishna
The Future of Neural Networks CoRR (2012)
N. S. Narayanaswamy, G. Ramakrishna
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees CoRR (2012)
Sachin Lakra, T. V. Prasad, G. Ramakrishna
Speech Signal Filters based on Soft Computing Techniques: A Comparison CoRR (2012)
N. S. Narayanaswamy, G. Ramakrishna
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees. CTW (2012)