My research centers on discrete algorithms, mainly dedicated to graph-theoretical problems. In particular, I am interested in parameterized complexity, approximation, metric graph theory, and online algorithms.

• Articles accepted in international conferences

1. Quasilinear-time eccentricities computation, and more, on median graphs. With G. Ducoffe, M. Habib, SODA 2025
2. The Canadian Traveller Problem on Outerplanar Graphs. With L. Beaudou, V. Chernyshev, A. Dailly, Y. Gérard, A. Lagoutte, V. Limouzy, L. Pastor, MFCS 2024
3. Approximation algorithms for Job Scheduling with reconfigurable resources. With M. Chaikovskaia, J.-P. Gayon, A. Quilliot, ISCO 2024
4. Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width. With É. Bonnet, H. Déprés, R. Watrigant, STACS 2023
5. Twin-width at most 4 is NP-complete. With É. Bonnet, H. Déprés, ICALP 2022
6. 1-Extendability of independent sets. With A. Busson, C. Feghali, R. Watrigant, IWOCA 2022
7. Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. With G. Ducoffe, M. Habib, STACS 2022
8. Diameter in linear time for constant-dimension median graphs. With M. Habib, LAGOS 2021
9. Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s,t)-Cuts. With L. Salaün, WAOA 2019
10. Fixed-Parameter Tractability of Counting Small Minimum (S,T)-Cuts. With B. Mouscadet, A. Rimmel, J. Tomasik, WG 2019
11. On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. With J. Hemery, A. Rimmel, J. Tomasik, COCOA 2018
12. The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. With J. Hemery, A. Rimmel, J. Tomasik, ISCIS 2018
13. Search Space Exploration and an Optimization Criterion for Hard Design Problems. With K. Le Guiban, A. Rimmel, J. Tomasik, GECCO 2016
14. Restricting the search space to boost Quantum Annealing performance. With B. Cavarec, A. Rimmel, J. Tomasik, IEEE CEC 2016

• Articles accepted in journals

15. The influence of maximum (s,t)-Cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem. With L. Salaün, Theor. Comput. Science
16. The Authorization Policy Existence Problem. With J. Crampton, G. Gutin, R. Watrigant, IEEE Trans. Dependable Secur. Comput. , 2020
17. On the parameterized complexity of separating certain sources from the target. With A. Rimmel, J. Tomasik, Theor. Comput. Science , 2019
18. Multiple Canadians on the road: minimizing the distance competitive ratio. With J. Desmarchelier, W. Guo, A. Lefebvre, A. Rimmel, J. Tomasik, Journal of Comb. Optim. , 2019
19. A lower bound for weak Schur numbers with a deterministic algorithm. With G. Ben Hassine, A. Rimmel, J. Tomasik, Journal of Discrete Algo. , 2018