Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="de Montgolfier, Fabien"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing
H
-joins with application to 2-modular decomposition
Michel Habib
,
Antoine Mamcarz
,
Fabien de Montgolfier
Algorithmica
70
(2), 2014, pp. 245-266
Linear time split decomposition revisited
Pierre Charbit
,
Fabien de Montgolfier
,
Mathieu Raffinot
SIAM Journal on Discrete Mathematics
26
(2), 2012, pp. 499-514
Asymptotic modularity of some graph classes
Fabien de Montgolfier
,
Mauricio Soto
,
Laurent Viennot
Lecture Notes in Computer Science
7074
, 2011, pp. 435-444
Computing common intervals of
K
permutations, with applications to modular decomposition of graphs
Anne Bergeron
,
Cedric Chauve
,
Fabien de Montgolfier
,
Mathieu Raffinot
SIAM Journal on Discrete Mathematics
22
(3), 2008, pp. 1022-1039
A note on computing set overlap classes
Pierre Charbit
,
Michel Habib
,
Vincent Limouzy
,
Fabien de Montgolfier
,
Mathieu Raffinot
,
Michaël Rao
Information Processing Letters
108
(4), 2008, pp. 186-191
Unifying two graph decompositions with modular decomposition
Binh-Minh Bui-Xuan
,
Michel Habib
,
Vincent Limouzy
,
Fabien de Montgolfier
Lecture Notes in Computer Science
4835
, 2007, pp. 52-64
NLC-2 graph recognition and isomorphism
Vincent Limouzy
,
Fabien de Montgolfier
,
Michaël Rao
Lecture Notes in Computer Science
4769
, 2007, pp. 86-98
Computing common intervals of
K
permutations, with applications to modular decomposition of graphs
Anne Bergeron
,
Cedric Chauve
,
Fabien de Montgolfier
,
Mathieu Raffinot
Lecture Notes in Computer Science
3669
, 2005, pp. 779-790
Algebraic operations on
PQ
trees and modular decomposition trees
Ross M. McConnell
,
Fabien de Montgolfier
Lecture Notes in Computer Science
3787
, 2005, pp. 421-432
Bimodular decomposition of bipartite graphs
Jean-Luc Fouquet
,
Michel Habib
,
Fabien de Montgolfier
,
Jean-Marie Vanherpe
Lecture Notes in Computer Science
3353
, 2004, pp. 117-128
A simple linear-time modular decomposition algorithm for graphs, using order extension
Michel Habib
,
Fabien de Montgolfier
,
Christophe Paul
Lecture Notes in Computer Science
3111
, 2004, pp. 187-198