Léo Planche

According to our database, Léo Planche authored at least 4 papers between 2016 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

Decomposing a graph into shortest paths with bounded eccentricity.

Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot

Discret. Appl. Math., 2020

2019

On the Minimum Eccentricity Isometric Cycle Problem.

Etienne Birmelé, Fabien de Montgolfier, Léo Planche

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

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

PhD thesis, 2018

2016

Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem.

Etienne Birmelé, Fabien de Montgolfier, Léo Planche

Proceedings of the Combinatorial Optimization and Applications, 2016