( en | de | ru )

 

Disambiguation of "Birmelé, Etienne"

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.

Wilhelm Birmele

Maria Birmele

Etienne Brosse

Etienne Herzog

Etienne Kaboré

 

Other publications of authors with the same name

Overlapping Clustering Methods for Networks., , and . Handbook of Mixed Membership Models and Their Applications, Chapman and Hall/CRC, (2014)Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord.. J. Graph Theory, 58 (4): 293-298 (2008)Optimal Listing of Cycles and st-Paths in Undirected Graphs., , , , , , and . SODA, page 1884-1896. SIAM, (2013)The Erdös-Pósa Property For Long Circuits., , and . Combinatorica, 27 (2): 135-145 (2007)Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem., , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 216-229. Springer, (2016)Etude structurelle des réseaux : modèles aléatoires, motifs et cycles.. (2011)Bayesian Methods for Graph Clustering., , and . GfKl, page 229-239. Springer, (2008)Decomposing a graph into shortest paths with bounded eccentricity., , , and . Discret. Appl. Math., (2020)On the Minimum Eccentricity Isometric Cycle Problem., , and . LAGOS, volume 346 of Electronic Notes in Theoretical Computer Science, page 159-169. Elsevier, (2019)Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree., , and . J. Graph Theory, 53 (4): 315-332 (2006)