Salim Bouamama

19 papers A 2Journal 12Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Randomized Iterated Greedy Algorithm for the Minimum Partial Vertex Cover Problem. Int. J. Perform. Eng. Ahlam Bouzaroura, Salim Bouamama
2025	A	`conf`	Application of PBIG to the Minimum Global Domination Problem. GECCO Salim Bouamama, Christian Blum
2025	J	`jnl`	Complex network community discovery using fast local move iterated greedy algorithm. J. Supercomput. Salaheddine Taibi, Lyazid Toumi, Salim Bouamama
2024	J	`jnl`	Complex network community discovery using fast local move iterated greedy algorithm. CoRR Salaheddine Taibi, Lyazid Toumi, Salim Bouamama
2024	J	`jnl`	Multi-constructor CMSA for the maximum disjoint dominating sets problem. Comput. Oper. Res. Roberto Maria Rosati, Salim Bouamama, Christian Blum
2023	J	`jnl`	A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem. CoRR Hayet Dahmri, Salim Bouamama
2023	J	`jnl`	Square grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks. Comput. Sci. Nawel Boukhari, Salim Bouamama
2022	J	`jnl`	A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime. Sensors Salim Bouamama, Christian Blum, Pedro Pinacho Davidson
2022	—	`conf`	Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. MIC Roberto Maria Rosati, Salim Bouamama, Christian Blum
2021	J	`jnl`	A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets. Algorithms Samir Balbal, Salim Bouamama, Christian Blum
2021	J	`jnl`	An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks. Algorithms Salim Bouamama, Christian Blum
2021	—	`conf`	Negative learning ant colony optimization for the minimum positive influence dominating set problem. GECCO Companion Albert López Serrano, Teddy Nurcahyadi, Salim Bouamama, Christian Blum
2020	—	`conf`	Improved NSGA-II for Minimum Weight Minimum Connected Dominating Set Problem. MISC Hayet Dahmri, Salim Bouamama
2019	J	`jnl`	An algorithm based on ant colony optimization for the minimum connected dominating set problem. Appl. Soft Comput. Salim Bouamama, Christian Blum, Jean-Guillaume Fages
2019	A	`conf`	Application of CMSA to the minimum capacitated dominating set problem. GECCO Pedro Pinacho Davidson, Salim Bouamama, Christian Blum
2017	—	`conf`	On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm. ICSC Salim Bouamama, Christian Blum
2016	J	`jnl`	A hybrid algorithmic model for the minimum weight dominating set problem. Simul. Model. Pract. Theory Salim Bouamama, Christian Blum
2012	J	`jnl`	A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. Salim Bouamama, Christian Blum, Abdellah Boukerram
2010	—	`conf`	Motif Finding Using Ant Colony Optimization. ANTS Conference Salim Bouamama, Abdellah Boukerram, Amer F. Al-Badarneh

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.