Fabien de Montgolfier - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2022

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphsMichel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou. TCS, 923:56-73, 2022. [doi]

2020

Decomposing a graph into shortest paths with bounded eccentricityEtienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot. DAM, 284:353-374, 2020. [doi]

2019

On the Minimum Eccentricity Isometric Cycle ProblemEtienne Birmelé, Fabien de Montgolfier, Léo Planche. ENTCS, 346:159-169, 2019. [doi]

A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and ApplicationsMichel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou. iwoca 2019: 251-264 [doi]

2017

Decomposing a Graph into Shortest Paths with Bounded EccentricityEtienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot. isaac 2017: [doi]

2016

2014

Easy Identification of Generalized Common and Conserved Nested IntervalsFabien de Montgolfier, Mathieu Raffinot, Irena Rusu. jcb, 21(7):520-533, 2014. [doi]

Computing H-Joins with Application to 2-Modular DecompositionMichel Habib, Antoine Mamcarz, Fabien de Montgolfier. algorithmica, 70(2):245-266, 2014. [doi]

2012

Linear Time Split Decomposition RevisitedPierre Charbit, Fabien de Montgolfier, Mathieu Raffinot. siamdm, 26(2):499-514, 2012. [doi]

Algorithms for Some H-Join DecompositionsMichel Habib, Antoine Mamcarz, Fabien de Montgolfier. latin 2012: 446-457 [doi]

2011

Treewidth and Hyperbolicity of the InternetFabien de Montgolfier, Mauricio Soto, Laurent Viennot. nca 2011: 25-32 [doi]

Asymptotic Modularity of Some Graph ClassesFabien de Montgolfier, Mauricio Soto, Laurent Viennot. isaac 2011: 435-444 [doi]

2009

2008

2007

2006

On Modular Decomposition Concepts: the case for Homogeneous RelationsBinh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier. endm, 27:13-14, 2006. [doi]

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition AlgorithmsBinh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier. criwg 2006: 278-288 [doi]

2005

2004

Bimodular Decomposition of Bipartite GraphsJean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe. criwg 2004: 117-128 [doi]

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order ExtensionMichel Habib, Fabien de Montgolfier, Christophe Paul. swat 2004: 187-198 [doi]

2003

Décomposition modulaire des graphes. Théorie, extension et algorithmes. (Graph Modular Decomposition. Theory, extension and algorithms)Fabien de Montgolfier. PhD thesis, Montpellier 2 University, France, 2003. [doi]

2002

Graph Decompositions andFactorizing PermutationsChristian Capelle, Michel Habib, Fabien de Montgolfier. dmtcs, 5(1):55-70, 2002. [doi]

Sign in or sign up to see more results.

runs on WebDSL