G. Ramakrishna

27 papers A 1B 5C 1Misc 1Journal 16Unranked 3

Year	Rank	Type	Title / 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

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.