Oxana Yu. Tsidulko

20 papers C 2Misc 3Journal 12Unranked 3

Year	Rank	Type	Title / Venue / Authors
2024	Misc	`conf`	An Asymptotically Optimal Algorithm for the Minimum Weight Spanning Tree with Arbitrarily Bounded Diameter on Random Inputs. AIST Edward Kh. Gimadi, Oxana Yu. Tsidulko
2024	J	`jnl`	Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. J. Comput. Syst. Sci. René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2023	J	`jnl`	On data reduction for dynamic vector bin packing. Oper. Res. Lett. René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2022	J	`jnl`	On data reduction for dynamic vector bin packing. CoRR René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2021	J	`jnl`	Representative families for matroid intersections, with applications to location, packing, and covering problems. Discret. Appl. Math. René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2021	J	`jnl`	Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU. CoRR René van Bevern, Artem M. Kirilin, Daniel A. Skachkov, Pavel V. Smirnov, Oxana Yu. Tsidulko
2021	J	`jnl`	The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable. Oper. Res. Lett. Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
2020	J	`jnl`	On approximate data reduction for the Rural Postman Problem: Theory and experiments. Networks René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2020	J	`jnl`	Parameterized algorithms and data reduction for the short secluded s-t-path problem. Networks René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2020	J	`jnl`	The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable. CoRR Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko
2019	—	`conf`	Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs. LION Edward Kh. Gimadi, Oxana Yu. Tsidulko
2019	C	`conf`	Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints. CIAC René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2019	—	`conf`	On (1+\varepsilon ) -approximate Data Reduction for the Rural Postman Problem. MOTOR René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018	J	`jnl`	Facility location under matroid constraints: fixed-parameter algorithms and applications. CoRR René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche
2018	J	`jnl`	On (1+ε)-approximate problem kernels for the Rural Postman Problem. CoRR René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018	Misc	`conf`	On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem. AIST Edward Kh. Gimadi, Oxana Yu. Tsidulko
2018	C	`conf`	Parameterized Algorithms and Data Reduction for Safe Convoy Routing. ATMOS René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2018	J	`jnl`	Parameterized algorithms and data reduction for safe convoy routing. CoRR René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko
2017	Misc	`conf`	Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem. AIST Edward Kh. Gimadi, Oxana Yu. Tsidulko
2016	—	`conf`	On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. DOOR Edward Kh. Gimadi, Alexey M. Istomin, Oxana Yu. Tsidulko

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.