PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "de Montgolfier, Fabien"

Author of the publication

copydeleteadd this publication to your clipboard
On the Minimum Eccentricity Isometric Cycle Problem.

, , and . Electr. Notes Theor. Comput. Sci., (2019)

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.

Jörg Desel

Das ist Informatik (Eds.) Springer, (2001)

Univ. -Prof. Dr. Gerd de Bruyn University of Stuttgart

Anda Degeratu University of Stuttgart

Daniel Del Gaudio University of Stuttgart

Ph. D. Luiz de Oliveira Chamon University of Stuttgart

 

Other publications of authors with the same name

Decomposing a Graph into Shortest Paths with Bounded Eccentricity., , , and . ISAAC, volume 92 of LIPIcs, page 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)A note on computing set overlap classes., , , , , and . Inf. Process. Lett., 108 (4): 186-191 (2008)Achievable catalog size in peer-to-peer video-on-demand systems., , , , and . IPTPS, page 4. USENIX, (2008)Stratification in P2P Networks - Application to BitTorrent, , , and . CoRR, (2006)A tie-break model for graph search., , , and . CoRR, (2015)Algorithmic aspects of switch cographs., , and . Discrete Applied Mathematics, (2016)Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 779-790. Springer, (2005)Algebraic Operations on PQ Trees and Modular Decomposition Trees., and . WG, volume 3787 of Lecture Notes in Computer Science, page 421-432. Springer, (2005)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)Algorithms for Some H-Join Decompositions., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 446-457. Springer, (2012)