Fabien de Montgolfier

50 papers A* 1A 3B 10C 3Journal 29Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs ⋆. CoRR Fabien de Montgolfier, Renaud Torfs
2022	J	`jnl`	A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou
2020	J	`jnl`	Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot
2019	C	`conf`	A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou
2019	C	`conf`	On the Minimum Eccentricity Isometric Cycle Problem. LAGOS Etienne Birmelé, Fabien de Montgolfier, Léo Planche
2017	B	`conf`	Decomposing a Graph into Shortest Paths with Bounded Eccentricity. ISAAC Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot
2016	J	`jnl`	A tie-break model for graph search. Discret. Appl. Math. Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2016	J	`jnl`	Algorithmic aspects of switch cographs. Discret. Appl. Math. Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier
2016	C	`conf`	Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. COCOA Etienne Birmelé, Fabien de Montgolfier, Léo Planche
2016	J	`jnl`	Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem. CoRR Etienne Birmelé, Fabien de Montgolfier, Léo Planche
2015	J	`jnl`	A tie-break model for graph search. CoRR Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier
2014	J	`jnl`	Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2014	J	`jnl`	Easy Identification of Generalized Common and Conserved Nested Intervals. J. Comput. Biol. Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
2013	J	`jnl`	Algorithmic Aspects of Switch Cographs. CoRR Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier
2013	J	`jnl`	Easy identification of generalized common nested intervals CoRR Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
2012	B	`conf`	Algorithms for Some H-Join Decompositions. LATIN Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2012	J	`jnl`	Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
2011	B	`conf`	Asymptotic Modularity of Some Graph Classes. ISAAC Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
2011	B	`conf`	Treewidth and Hyperbolicity of the Internet. NCA Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
2009	J	`jnl`	A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs CoRR Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
2009	J	`jnl`	Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2009	A	`conf`	An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. IPDPS Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot
2009	B	`conf`	Fine Tuning of a Distributed VoD System. ICCCN Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot
2008	J	`jnl`	A note on computing set overlap classes. Inf. Process. Lett. Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2008	—	`conf`	Achievable catalog size in peer-to-peer video-on-demand systems. IPTPS Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot
2008	J	`jnl`	Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discret. Math. Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot
2008	J	`jnl`	Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms CoRR Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino
2007	J	`jnl`	A Note On Computing Set Overlap Classes CoRR Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2007	J	`jnl`	Acyclic Preference Systems in P2P Networks CoRR Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot
2007	—	`conf`	Acyclic Preference Systems in P2P Networks. Euro-Par Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot
2007	B	`conf`	NLC-2 Graph Recognition and Isomorphism. WG Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
2007	J	`jnl`	NLC-2 graph recognition and isomorphism CoRR Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
2007	A*	`conf`	Random web crawls. WWW Toufik Bennouas, Fabien de Montgolfier
2007	A	`conf`	Stratification in P2P Networks: Application to BitTorrent. ICDCS Anh-Tuan Gai, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier
2007	B	`conf`	Unifying Two Graph Decompositions with Modular Decomposition. ISAAC Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Algorithmic Aspects of a Novel Modular Decomposition Theory CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	B	`conf`	Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Homogeneity vs. Adjacency: generalising some graph decomposition algorithms CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	On Using Matching Theory to Understand P2P Network Design CoRR Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, Anh-Tuan Gai, Julien Reynier, Fabien de Montgolfier
2006	J	`jnl`	Stratification in P2P Networks - Application to BitTorrent CoRR Anh-Tuan Gai, Fabien Mathieu, Julien Reynier, Fabien de Montgolfier
2006	J	`jnl`	Unifying two Graph Decompositions with Modular Decomposition CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2005	B	`conf`	Algebraic Operations on PQ Trees and Modular Decomposition Trees. WG Ross M. McConnell, Fabien de Montgolfier
2005	A	`conf`	Computing Common Intervals of ESA Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot
2005	J	`jnl`	Linear-time modular decomposition of directed graphs. Discret. Appl. Math. Ross M. McConnell, Fabien de Montgolfier
2005	J	`jnl`	The bi-join decomposition. Electron. Notes Discret. Math. Fabien de Montgolfier, Michaël Rao
2004	—	`conf`	A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT Michel Habib, Fabien de Montgolfier, Christophe Paul
2004	B	`conf`	Bimodular Decomposition of Bipartite Graphs. WG Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
2003	—	`—`	Décomposition modulaire des graphes. Théorie, extension et algorithmes. (Graph Modular Decomposition. Theory, extension and algorithms). Fabien de Montgolfier
2002	J	`jnl`	Graph Decompositions andFactorizing Permutations. Discret. Math. Theor. Comput. Sci. Christian Capelle, Michel Habib, Fabien de Montgolfier

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.