G. Ramakrishna

27 papers A 1B 5C 1Misc 1Journal 16Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks.
IEEE Access
Mithinti Srikanth, G. Ramakrishna
2025 — conf
Compact Biconnected Components on GPUs.
HiPCW
Abhijeet Sahu, Tejasva Motsara, G. Ramakrishna
2025 — conf
External GPU Biconnected Components.
Euro-Par (3)
Abhijeet Sahu, Andaluri S. P. V. M. Aditya, G. Ramakrishna, Malleti Sai Nikhil, Kishore Kothapalli, Dip Sankar Banerjee
2025 — conf
PHEM: A Computational Model for Designing Parallel Algorithms for Very Large Graphs.
ICPP Workshops
Lokesh Venkatachalam, Kishore Kothapalli, Abhijit Sahu, G. Ramakrishna, Dip Sankar Banerjee, Balavarun Pedapudi, Aditya Harikrish, Aditya S. P. V. M. Andaluri
2024 J jnl
Efficient Algorithms for Earliest and Fastest Paths in Public Transport Networks.
CoRR
Mithinti Srikanth, G. Ramakrishna
2024 B conf
GPU Algorithms for Fastest Path Problem in Temporal Graphs.
ICPP
Mithinti Srikanth, Prashant Singh, G. Ramakrishna
2022 A conf
Shared-Memory Parallel Algorithms for Fully Dynamic Maintenance of 2-Connected Components.
IPDPS
Chirayu Anant Haryan, G. Ramakrishna, Kishore Kothapalli, Dip Sankar Banerjee
2021 B conf
On Short Fastest Paths in Temporal Graphs.
WALCOM
Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, Mithinti Srikanth
2020 Misc conf
A GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks.
HiPC
Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre, Allam Dinesh Reddy
2019 J jnl
GPU Algorithm for Earliest Arrival Time Problem in Public Transport Networks.
CoRR
Chirayu Anant Haryan, G. Ramakrishna, Rupesh Nasre, Allam Dinesh Reddy
2016 J jnl
On Minimum Average Stretch Spanning Trees in Grid Graphs.
Electron. Notes Discret. Math.
Pankaj Pundir, G. Ramakrishna
2015 B conf
Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal Graphs.
WALCOM
Gaurav Singh, N. S. Narayanaswamy, G. Ramakrishna
2015 J jnl
Characterization of minimum cycle basis in weighted partial 2-trees.
Discret. Appl. Math.
N. S. Narayanaswamy, G. Ramakrishna
2015 J jnl
On minimum average stretch spanning trees in polygonal 2-trees.
Theor. Comput. Sci.
N. S. Narayanaswamy, G. Ramakrishna
2015 J jnl
Tree t-spanners in outerplanar graphs via supply demand partition.
Discret. Appl. Math.
N. S. Narayanaswamy, G. Ramakrishna
2014 J jnl
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.
J. Graph Algorithms Appl.
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
2014 B conf
On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees.
WALCOM
N. S. Narayanaswamy, G. Ramakrishna
2014 J jnl
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees.
CoRR
N. S. Narayanaswamy, G. Ramakrishna
2014 J jnl
Representation of a Sentence using a Polar Fuzzy Neutrosophic Semantic Net.
CoRR
Sachin Lakra, T. V. Prasad, G. Ramakrishna
2013 J jnl
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees
CoRR
N. S. Narayanaswamy, G. Ramakrishna
2013 J jnl
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
CoRR
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
2013 B conf
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.
WG
Carola Doerr, G. Ramakrishna, Jens M. Schmidt
2012 J jnl
Applicability of Crisp and Fuzzy Logic in Intelligent Response Generation
CoRR
T. V. Prasad, Sachin Lakra, G. Ramakrishna
2012 C conf
Characterization of Minimum Cycle Basis in Weighted Partial 2-trees.
CTW
N. S. Narayanaswamy, G. Ramakrishna
2012 J jnl
Linear Time Algorithm for Tree t-spanner in Outerplanar Graphs via Supply-Demand Partition in Trees
CoRR
N. S. Narayanaswamy, G. Ramakrishna
2012 J jnl
Speech Signal Filters based on Soft Computing Techniques: A Comparison
CoRR
Sachin Lakra, T. V. Prasad, G. Ramakrishna
2012 J jnl
The Future of Neural Networks
CoRR
Sachin Lakra, T. V. Prasad, G. Ramakrishna