Daniel Vaz - RankMe

27 papers A* 3B 5Journal 15Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Broadcasting Under Structural Restrictions. MFCS Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	J	`jnl`	Broadcasting under Structural Restrictions. CoRR Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2025	B	`conf`	Buy-at-Bulk Facility Location on Trees. WAOA Shamisa Nematollahi, Daniel Vaz
2025	B	`conf`	Parameterized Spanning Tree Congestion. MFCS Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2024	J	`jnl`	Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2024	B	`conf`	Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. MFCS Syamantak Das, Nikhil Kumar, Daniel Vaz
2024	J	`jnl`	Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. CoRR Syamantak Das, Nikhil Kumar, Daniel Vaz
2024	J	`jnl`	Parameterized Spanning Tree Congestion. CoRR Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz
2022	J	`jnl`	On Approximating Degree-Bounded Network Design Problems. Algorithmica Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
2022	—	`conf`	On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
2021	J	`jnl`	Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2021	A*	`conf`	Vertex Sparsification for Edge Connectivity. SODA Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2020	—	`—`	Approximation algorithms for network design and cut problems in bounded-treewidth. Daniel Vaz
2020	—	`conf`	On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
2020	J	`jnl`	On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
2020	J	`jnl`	Vertex Sparsification for Edge Connectivity. CoRR Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
2019	J	`jnl`	Mimicking Networks Parameterized by Connectivity. CoRR Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
2018	J	`jnl`	Dynamics in matching and coalition formation games with structural constraints. Artif. Intell. Martin Hoefer, Daniel Vaz, Lisa Wagner
2018	—	`conf`	Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
2018	J	`jnl`	Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
2017	A*	`conf`	Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
2016	J	`jnl`	A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. Electron. Notes Discret. Math. Parinya Chalermsook, Daniel Vaz
2016	B	`conf`	New Integrality Gap Results for the Firefighters Problem on Trees. WAOA Parinya Chalermsook, Daniel Vaz
2016	J	`jnl`	New Integrality Gap Results for the Firefighters Problem on Trees. CoRR Parinya Chalermsook, Daniel Vaz
2015	A*	`conf`	Hedonic Coalition Formation in Networks. AAAI Martin Hoefer, Daniel Vaz, Lisa Wagner
2015	J	`jnl`	Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr
2013	J	`jnl`	A note on the ϵ-indicator subset selection. Theor. Comput. Sci. Daniel Vaz, Luís Paquete, Aníbal Ponte

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.