( en | de | ru )

 

Disambiguation of "de Montgolfier, Fabien"

Author of the publication

copydeleteadd this publication to your clipboard
Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem.

, , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fabien Guilmineau

Fabien Abeille

Fabien Amarger

Fabien Gandon

Fabien Leurent

 

Other publications of authors with the same name

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs., , , and . Theor. Comput. Sci., (2022)A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs, , and . CoRR, (2009)Computing H-Joins with Application to 2-Modular Decomposition., , and . Algorithmica, 70 (2): 245-266 (2014)Easy Identification of Generalized Common and Conserved Nested Intervals., , and . J. Comput. Biol., 21 (7): 520-533 (2014)Algebraic Operations on PQ Trees and Modular Decomposition Trees., and . WG, volume 3787 of Lecture Notes in Computer Science, page 421-432. Springer, (2005)Algorithms for Some H-Join Decompositions., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 446-457. Springer, (2012)A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 187-198. Springer, (2004)Algorithmic aspects of switch cographs., , and . Discret. Appl. Math., (2016)Decomposing a graph into shortest paths with bounded eccentricity., , , and . Discret. Appl. Math., (2020)Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs., , , and . SIAM J. Discret. Math., 22 (3): 1022-1039 (2008)