P. Venkata Subba Reddy

22 papers C 1Journal 21

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs. Int. J. Found. Comput. Sci. Amit Sharma, P. Venkata Subba Reddy, Subramanian Arumugam, Jakkepalli Pavan Kumar
2025	J	`jnl`	Meta-Heuristic Algorithms for Quasi Total Double Roman Domination Problem. RAIRO Theor. Informatics Appl. Charan Karnati, M. Alfred Raju, P. Venkata Subba Reddy
2024	J	`jnl`	Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs. CoRR P. Venkata Subba Reddy, Guru Pratap Sharma, Ismael González Yero
2024	J	`jnl`	Meta-heuristic Algorithms for Double Roman Domination Problem. Appl. Soft Comput. Himanshu Aggarwal, P. Venkata Subba Reddy
2024	J	`jnl`	Metaheuristic algorithms for solving roman {2}-domination problem. RAIRO Oper. Res. M. Alfred Raju, P. Venkata Subba Reddy
2024	J	`jnl`	On the total version of the covering Italian domination problem. Discret. Appl. Math. M. Alfred Raju, P. Venkata Subba Reddy, Ismael G. Yero
2024	J	`jnl`	Total 2-Rainbow Domination in Graphs: Complexity and Algorithms. Int. J. Found. Comput. Sci. Manjay Kumar, P. Venkata Subba Reddy
2023	J	`jnl`	Integer Linear Programming Formulations for Triple and Quadruple Roman Domination Problems. CoRR Sanath Kumar Vengaldas, Adarsh Reddy Muthyala, Bharath Chaitanya Konkati, P. Venkata Subba Reddy
2022	J	`jnl`	Algorithmic aspects of Roman {3}-domination in graphs. RAIRO Oper. Res. Chakradhar Padamutham, P. Venkata Subba Reddy
2022	J	`jnl`	Algorithmic aspects of outer independent Roman domination in graphs. Discret. Math. Algorithms Appl. Amit Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
2022	J	`jnl`	Algorithmic complexity of weakly connected Roman domination in graphs. Discret. Math. Algorithms Appl. Chakradhar Padamutham, P. Venkata Subba Reddy, Khandelwal Himanshu
2021	J	`jnl`	Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs. Int. J. Found. Comput. Sci. Amit Sharma, P. Venkata Subba Reddy
2021	J	`jnl`	Algorithmic aspects of secure connected domination in graphs. Discuss. Math. Graph Theory Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2021	J	`jnl`	Complexity issues of perfect secure domination in graphs. RAIRO Theor. Informatics Appl. Chakradhar Padamutham, P. Venkata Subba Reddy
2020	J	`jnl`	Algorithmic Aspects of 2-Secure Domination in Graphs. CoRR Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020	J	`jnl`	Algorithmic Aspects of Secure Connected Domination in Graphs. CoRR Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020	J	`jnl`	Algorithmic Aspects of Some Variants of Domination in Graphs. CoRR Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020	J	`jnl`	Algorithmic Complexity of Isolate Secure Domination in Graphs. CoRR Jakkepalli Pavan Kumar, P. Venkata Subba Reddy
2020	J	`jnl`	Algorithmic Complexity of Secure Connected Domination in Graphs. CoRR Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
2020	J	`jnl`	Algorithmic complexity of secure connected domination in graphs. AKCE Int. J. Graphs Comb. Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
2017	J	`jnl`	Complexity Issues of Variants of Secure Domination in Graphs. Electron. Notes Discret. Math. Devendra Lad, P. Venkata Subba Reddy, Jakkepalli Pavan Kumar
2015	C	`conf`	A new method of assessing the students using video assignments. EDUCON U. S. N. Raju, K. V. Kadambari, P. Venkata Subba Reddy

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.