Graph Decompositions andFactorizing Permutations. - Christian Capelle; Michel Habib; Fabien de Montgolfier (Discret. Math. Theor. Comput. Sci., 2002)

Décomposition modulaire des graphes. Théorie, extension et algorithmes. (Graph Modular Decomposition. Theory, extension and algorithms). - Fabien de Montgolfier (2003)

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. - Michel Habib; Fabien de Montgolfier; Christophe Paul (SWAT, 2004)

Bimodular Decomposition of Bipartite Graphs. - Jean-Luc Fouquet; Michel Habib; Fabien de Montgolfier; Jean-Marie Vanherpe (WG, 2004)

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. - Anne Bergeron; Cédric Chauve; Fabien de Montgolfier; Mathieu Raffinot (ESA, 2005)

Algebraic Operations on PQ Trees and Modular Decomposition Trees. - Ross M. McConnell; Fabien de Montgolfier (WG, 2005)

Linear-time modular decomposition of directed graphs. - Ross M. McConnell; Fabien de Montgolfier (Discret. Appl. Math., 2005)

The bi-join decomposition. - Fabien de Montgolfier; Michaël Rao (Electron. Notes Discret. Math., 2005)

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (WG, 2006)

Algorithmic Aspects of a Novel Modular Decomposition Theory - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (CoRR, 2006)

On Using Matching Theory to Understand P2P Network Design - Dmitry Lebedev; Fabien Mathieu; Laurent Viennot; Anh-Tuan Gai; Julien Reynier; Fabien de Montgolfier (CoRR, 2006)

On Modular Decomposition Concepts: the case for Homogeneous Relations. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (Electron. Notes Discret. Math., 2006)

Acyclic Preference Systems in P2P Networks. - Anh-Tuan Gai; Dmitry Lebedev; Fabien Mathieu; Fabien de Montgolfier; Julien Reynier; Laurent Viennot (Euro-Par, 2007)

Stratification in P2P Networks: Application to BitTorrent. - Anh-Tuan Gai; Fabien Mathieu; Fabien de Montgolfier; Julien Reynier (ICDCS, 2007)

Unifying Two Graph Decompositions with Modular Decomposition. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (ISAAC, 2007)

NLC-2 Graph Recognition and Isomorphism. - Vincent Limouzy; Fabien de Montgolfier; Michaël Rao (WG, 2007)

Random web crawls. - Toufik Bennouas; Fabien de Montgolfier (WWW, 2007)

Achievable catalog size in peer-to-peer video-on-demand systems. - Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino; Laurent Viennot (IPTPS, 2008)

Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms - Laurent Viennot; Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino (CoRR, 2008)

A note on computing set overlap classes. - Pierre Charbit; Michel Habib; Vincent Limouzy; Fabien de Montgolfier; Mathieu Raffinot; Michaël Rao (Inf. Process. Lett., 2008)

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. - Anne Bergeron; Cédric Chauve; Fabien de Montgolfier; Mathieu Raffinot (SIAM J. Discret. Math., 2008)

Fine Tuning of a Distributed VoD System. - Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino; Laurent Viennot (ICCCN, 2009)

An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. - Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino; Laurent Viennot (IPDPS, 2009)

A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs - Pierre Charbit; Fabien de Montgolfier; Mathieu Raffinot (CoRR, 2009)

Algorithmic aspects of a general modular decomposition theory. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (Discret. Appl. Math., 2009)

Asymptotic Modularity of Some Graph Classes. - Fabien de Montgolfier; Mauricio Soto; Laurent Viennot (ISAAC, 2011)

Treewidth and Hyperbolicity of the Internet. - Fabien de Montgolfier; Mauricio Soto; Laurent Viennot (NCA, 2011)

Algorithms for Some H-Join Decompositions. - Michel Habib; Antoine Mamcarz; Fabien de Montgolfier (LATIN, 2012)

Linear Time Split Decomposition Revisited. - Pierre Charbit; Fabien de Montgolfier; Mathieu Raffinot (SIAM J. Discret. Math., 2012)

Easy identification of generalized common nested intervals - Fabien de Montgolfier; Mathieu Raffinot; Irena Rusu (CoRR, 2013)

Computing H-Joins with Application to 2-Modular Decomposition. - Michel Habib; Antoine Mamcarz; Fabien de Montgolfier (Algorithmica, 2014)

Easy Identification of Generalized Common and Conserved Nested Intervals. - Fabien de Montgolfier; Mathieu Raffinot; Irena Rusu (J. Comput. Biol., 2014)

A tie-break model for graph search. - Derek G. Corneil; Jérémie Dusart; Michel Habib; Fabien de Montgolfier (CoRR, 2015)

Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche (COCOA, 2016)

Algorithmic aspects of switch cographs. - Vincent Cohen-Addad; Michel Habib; Fabien de Montgolfier (Discret. Appl. Math., 2016)

A tie-break model for graph search. - Derek G. Corneil; Jérémie Dusart; Michel Habib; Antoine Mamcarz; Fabien de Montgolfier (Discret. Appl. Math., 2016)

A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. - Michel Habib; Fabien de Montgolfier; Lalla Mouatadid; Mengchuan Zou (IWOCA, 2019)

On the Minimum Eccentricity Isometric Cycle Problem. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche (LAGOS, 2019)

Decomposing a graph into shortest paths with bounded eccentricity. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche; Laurent Viennot (Discret. Appl. Math., 2020)

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. - Michel Habib; Fabien de Montgolfier; Lalla Mouatadid; Mengchuan Zou (Theor. Comput. Sci., 2022)