Olivier Baudon

25 papers B 1Journal 23

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The strong ( 2 , 2 ) -Conjecture for more classes of graphs. Discret. Appl. Math. Olivier Baudon, Julien Bensmail, Morgan Boivin, Igor Grzelec, Clara Marcille
2025	J	`jnl`	Partitioning vertices and edges of graphs into connected subgraphs. Appl. Math. Comput. Olivier Baudon, Julien Bensmail, Lyn Vayssieres
2024	J	`jnl`	Interplays between variations of arbitrarily partitionable graphs under minimality constraints. Appl. Math. Comput. Olivier Baudon, Julien Bensmail, Morgan Boivin
2020	J	`jnl`	On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak
2019	J	`jnl`	A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2019	J	`jnl`	Edge weights and vertex colours: Minimizing sum count. Discret. Appl. Math. Olivier Baudon, Julien Bensmail, Hervé Hocquard, Mohammed Senhaji, Éric Sopena
2018	J	`jnl`	Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1-2-3 Conjecture. Discret. Appl. Math. Olivier Baudon, Julien Bensmail, Mohammed Senhaji, Éric Sopena
2018	J	`jnl`	On locally irregular decompositions and the 1-2 Conjecture in digraphs. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2017	J	`jnl`	Equitable neighbour-sum-distinguishing edge and total colourings. CoRR Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2017	J	`jnl`	Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak
2017	J	`jnl`	Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
2017	J	`jnl`	The neighbour-sum-distinguishing edge-colouring game. Discret. Math. Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak
2015	J	`jnl`	An oriented version of the 1-2-3 Conjecture. Discuss. Math. Graph Theory Olivier Baudon, Julien Bensmail, Éric Sopena
2015	J	`jnl`	On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2015	J	`jnl`	On the complexity of determining the irregular chromatic index of a graph. J. Discrete Algorithms Olivier Baudon, Julien Bensmail, Éric Sopena
2014	J	`jnl`	On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak
2014	J	`jnl`	Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discret. Math. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Éric Sopena
2014	J	`jnl`	Partitioning powers of traceable or hamiltonian graphs. Theor. Comput. Sci. Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak
2012	J	`jnl`	On minimal arbitrarily partitionable graphs. Inf. Process. Lett. Olivier Baudon, Jakub Przybylo, Mariusz Wozniak
2005	J	`jnl`	2-1 routing requests in the hypercube. Electron. Notes Discret. Math. Olivier Baudon
2002	J	`jnl`	Decomposable trees: a polynomial algorithm fortripodes. Discret. Appl. Math. Dominique Barth, Olivier Baudon, Joël Puech
2001	J	`jnl`	Routing permutations and 2-1 routing requests in the hypercube. Discret. Appl. Math. Olivier Baudon, Guillaume Fertin, Ivan Havel
1999	B	`conf`	Routing Permutations in the Hypercube. WG Olivier Baudon, Guillaume Fertin, Ivan Havel
1990	—	`—`	Cabri-graphes : un cahier de brouillon interactif pour la théorie des graphes. (Cabri-graphes, an interactive sketchpad for graph theory). Olivier Baudon

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.