Publications and preprints
International journals
Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete
With Claire Hanen and Alix Munier-Kordon.
Theoretical Computer Science (2026, preprint from October 2025).
Single machine scheduling with precedence constraints and bounded maximum delay value
With Claire Hanen and Alix Munier-Kordon.
Journal of Combinatorial Optimization (2026, preprint from August 2025).
International conferences with proceedings
The parameterized complexity of scheduling with precedence delays: Shuffle Product and Directed Bandwidth
With Hans L. Bodlaender.
IWOCA 2026 (preprint from February 2026).
Finding shortest walks in Kuru Kuru Kururin
With Mickaël Laurent.
FUN 2026 (preprint from January 2026).
A new structural parameter on single machine scheduling with release dates and deadlines
With Claire Hanen and Alix Munier-Kordon.
ISCO 2024 (preprint from December 2023).
Parameterized complexity of a parallel machine scheduling problem
With Claire Hanen and Alix Munier-Kordon.
IPEC 2022 (preprint from June 2022).
Other international conferences
Single machine scheduling of low-frequency radio-astronomical observations
With Frédéric Vivien.
PMS 2026 (extended abstract from December 2025).
Parameterized complexity of single-machine scheduling with precedence, release dates and deadlines
With Claire Hanen and Alix Munier-Kordon.
MAPSP 2022 (extended abstract from March 2022).
National conferences
Computational complexity of radio-astronomical observation scheduling
With Frédéric Vivien.
ROADEF 2026 (abstract from November 2025).
Parameterized complexity: a two-dimensional approach to study scheduling problems
With Claire Hanen and Alix Munier-Kordon.
ROADEF 2024 (abstract from November 2023).
Parameterized complexity of a single machine scheduling problem
With Claire Hanen and Alix Munier-Kordon.
ROADEF 2022 (abstract from November 2021).
Forbidden substrings and the connectivity of the Hamming graph of RNA sequences: partial disconnectivity tests
With Alain Denise and Yann Ponty.
SeqBIM 2019 (extended abstract from November 2019).
Submitted papers
Kernelization algorithms on single machine scheduling with time windows
With Claire Hanen and Alix Munier-Kordon.
INFORMS Journal on Computing (
under minor revision
, submitted in November 2024).
Updated preprint
(October 2025).
Working papers
Scheduling with precedence constraints, time windows and bounded proper level
With Claire Hanen and Alix Munier-Kordon.
Preprint from October 2025.
Preparing a submission to Discrete Applied Mathematics.
Parameterized analysis of single machine scheduling with time windows and precedence delays
With Claire Hanen and Alix Munier-Kordon.
Preprint from May 2023.
Hardness result published in Theoretical Computer Science (2026). Algorithm published in Journal of Combinatorial Optimization (2026).
PhD thesis
Parameterized Complexity and New Efficient Enumerative Schemes for RCPSP
[FR] Titre : Complexité Paramétrée et Nouveaux Schémas Enumeratifs Efficaces pour le RCPSP
Advisor: Claire Hanen.
Preprint from July 2024.
Final version
.
Internship reports
Super-Reconciliation with segmental duplication, transfer and loss events
Under the supervision of Nadia El-Mabrouk.
ARPE report from August 2020.
`ARPE' stands for `Année de Recherche Pré-doctorale à l'Etranger'. It was a full year of doing research abroad.
The impact of forbidden substrings on the connectivity of the Hamming graph of RNA sequences
Under the supervision of Alain Denise and Yann Ponty.
Master 2 report from August 2019.
Algorithmic and enumerative combinatorics of lattice paths and permutations: sorting permutations with the DI-machine
Under the supervision of Luca Ferrari.
Master 1 report from August 2018.
[FR] Etude des motifs et répétitions : recherche de mots infinis denses en facteurs carrés distincts
Sous la direction de Srečko Brlek.
Rapport de stage de Licence 3, août 2017.