Current Occupation

I am currently working as a postdoctoral researcher at the LISN Laboratory of the Université Paris Saclay. The current focus is on developing methods for population genetics, especially regarding archaic introgression in ancient and contemporary humans.
Contact : leoplanche[at]gmail.com

PhD

I did my PhD in graph theory under the joint supervision of Etienne Birmelé, professor in Applied Mathematics at Université Paris Descartes, and Fabien de Montgolfier, maître de conférences (assistant professor) at Université Paris Diderot. My thesis (in french) is there.

Research topics

Graph theory and related algorithms
Statistics for networks
Stochastic Processes
Methods for bioinformatics
Population genomics
Archaic introgression and ancient DNA

Publications

Diffusion-based artificial genomes and their usefulness for local ancestry inference

Antoine Szatkownik, Leo Planche, Maiwen Demeulle, Titouan Chambe, Maria Avila Arcos, Emilia Huerta-Sanchez, Cyril Furtlehner, Guillaume Charpiat, Flora Jay, Burak Yelmen.

bioRxiv, preprint (2024) [pdf]
Selfing Promotes Spread and Introgression of Segregation Distorters in Hermaphroditic Plants

Hongru Wang, Léo Planche, Vladimir Shchur, Rasmus Nielsen.

Molecular Biology and Evolution (2024) [pdf]
Highly Accurate Method for Detecting Archaic Segments in the Modern Genomes

Léo Planche, Anna V. Ilina, Vladimir L. Shchur

Lobachevskii Journal of Mathematics (2024)
The Effect of Graph Connectivity on Metastability in a Stochastic System of Spiking Neurons

M. André, L. Planche.
Journal of Stochastic Processes and their Applications (2020) [pdf]
Decomposing a Graph into Shortest Paths with Bounded Eccentricity

E. Birmelé, F. de Montgolfier, L. Planche, L. Viennot.

Journal of Discrete Applied Mathematics (2020) [pdf]
On the Minimum Eccentricity Isometric Cycle Problem

E. Birmelé, F. de Montgolfier, L. Planche.

LAGOS 2019 [pdf]
Decomposing a Graph into Shortest Paths with Bounded Eccentricity

E. Birmelé, F. de Montgolfier, L. Planche, L. Viennot.

ISAAC 2017 [pdf]
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem

E. Birmelé, F. de Montgolfier, L. Planche.

COCOA 2016 [pdf]

Teaching

2018-2019: Temporary teaching and research associate at University Paris Diderot, UFR Informatique
2015-2018: Teaching assistant at Université Paris Diderot, UFR Informatique

Miscellaneous

The code used to handle hub-laminar graphs is available there