Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche (COCOA, 2016)

Décomposition de graphes en plus courts chemins et en cycles de faible excentricité. (Decomposing a graph with shortest paths of bounded eccentricity). - Léo Planche (2018)

On the Minimum Eccentricity Isometric Cycle Problem. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche (LAGOS, 2019)

Decomposing a graph into shortest paths with bounded eccentricity. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche; Laurent Viennot (Discret. Appl. Math., 2020)