default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien de Montgolfier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. 923: 56-73 (2022)- 2020
- [j13]Etienne Birmelé, Fabien de Montgolfier
, Léo Planche, Laurent Viennot:
Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. 284: 353-374 (2020)
2010 – 2019
- 2019
- [c20]Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA 2019: 251-264 - [c19]Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
On the Minimum Eccentricity Isometric Cycle Problem. LAGOS 2019: 159-169 - 2017
- [c18]Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a Graph into Shortest Paths with Bounded Eccentricity. ISAAC 2017: 15:1-15:13 - 2016
- [j12]Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
A tie-break model for graph search. Discret. Appl. Math. 199: 89-100 (2016) - [j11]Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier:
Algorithmic aspects of switch cographs. Discret. Appl. Math. 200: 23-42 (2016) - [c17]Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. COCOA 2016: 216-229 - [i14]Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem. CoRR abs/1609.04593 (2016) - 2015
- [i13]Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier:
A tie-break model for graph search. CoRR abs/1501.06148 (2015) - 2014
- [j10]Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica 70(2): 245-266 (2014) - [j9]Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu:
Easy Identification of Generalized Common and Conserved Nested Intervals. J. Comput. Biol. 21(7): 520-533 (2014) - 2013
- [i12]Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu:
Easy identification of generalized common nested intervals. CoRR abs/1305.4747 (2013) - [i11]Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier:
Algorithmic Aspects of Switch Cographs. CoRR abs/1310.1012 (2013) - 2012
- [j8]Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot:
Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. 26(2): 499-514 (2012) - [c16]Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
Algorithms for Some H-Join Decompositions. LATIN 2012: 446-457 - 2011
- [c15]Fabien de Montgolfier, Mauricio Soto, Laurent Viennot:
Asymptotic Modularity of Some Graph Classes. ISAAC 2011: 435-444 - [c14]Fabien de Montgolfier, Mauricio Soto, Laurent Viennot:
Treewidth and Hyperbolicity of the Internet. NCA 2011: 25-32
2000 – 2009
- 2009
- [j7]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157(9): 1993-2009 (2009) - [c13]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Fine Tuning of a Distributed VoD System. ICCCN 2009: 1-7 - [c12]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. IPDPS 2009: 1-10 - [i10]Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot:
A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs. CoRR abs/0902.1700 (2009) - 2008
- [j6]Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A note on computing set overlap classes. Inf. Process. Lett. 108(4): 186-191 (2008) - [j5]Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discret. Math. 22(3): 1022-1039 (2008) - [c11]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Achievable catalog size in peer-to-peer video-on-demand systems. IPTPS 2008: 4 - [i9]Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino:
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms. CoRR abs/0804.0743 (2008) - 2007
- [c10]Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot:
Acyclic Preference Systems in P2P Networks. Euro-Par 2007: 825-834 - [c9]Anh-Tuan Gai, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier:
Stratification in P2P Networks: Application to BitTorrent. ICDCS 2007: 30 - [c8]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC 2007: 52-64 - [c7]Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 Graph Recognition and Isomorphism. WG 2007: 86-98 - [c6]Toufik Bennouas, Fabien de Montgolfier:
Random web crawls. WWW 2007: 451-460 - [i8]Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot:
Acyclic Preference Systems in P2P Networks. CoRR abs/0704.3904 (2007) - [i7]Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A Note On Computing Set Overlap Classes. CoRR abs/0711.4573 (2007) - [i6]Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 graph recognition and isomorphism. CoRR abs/cs/0703013 (2007) - 2006
- [j4]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. 27: 13-14 (2006) - [c5]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG 2006: 278-288 - [i5]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms. CoRR abs/cs/0603048 (2006) - [i4]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Unifying two Graph Decompositions with Modular Decomposition. CoRR abs/cs/0604065 (2006) - [i3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic Aspects of a Novel Modular Decomposition Theory. CoRR abs/cs/0611019 (2006) - [i2]Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, Anh-Tuan Gai, Julien Reynier, Fabien de Montgolfier:
On Using Matching Theory to Understand P2P Network Design. CoRR abs/cs/0612108 (2006) - [i1]Anh-Tuan Gai, Fabien Mathieu, Julien Reynier, Fabien de Montgolfier:
Stratification in P2P Networks - Application to BitTorrent. CoRR abs/cs/0612130 (2006) - 2005
- [j3]Ross M. McConnell, Fabien de Montgolfier:
Linear-time modular decomposition of directed graphs. Discret. Appl. Math. 145(2): 198-209 (2005) - [j2]Fabien de Montgolfier, Michaël Rao:
The bi-join decomposition. Electron. Notes Discret. Math. 22: 173-177 (2005) - [c4]Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. ESA 2005: 779-790 - [c3]Ross M. McConnell, Fabien de Montgolfier:
Algebraic Operations on PQ Trees and Modular Decomposition Trees. WG 2005: 421-432 - 2004
- [c2]Michel Habib, Fabien de Montgolfier, Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198 - [c1]Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe:
Bimodular Decomposition of Bipartite Graphs. WG 2004: 117-128 - 2003
- [b1]Fabien de Montgolfier:
Décomposition modulaire des graphes. Théorie, extension et algorithmes. (Graph Modular Decomposition. Theory, extension and algorithms). Montpellier 2 University, France, 2003 - 2002
- [j1]Christian Capelle, Michel Habib, Fabien de Montgolfier:
Graph Decompositions andFactorizing Permutations. Discret. Math. Theor. Comput. Sci. 5(1): 55-70 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
