David Coudert

I'm senior researcher (Directeur de Recherche) at Inria and the scientific leader of COATI, a joint project-team between the research center of Inria Sophia Antipolis - Méditerranée and the I3S laboratory which itself belongs to the CNRS and Université Côte d'Azur (UCA). I received a Master degree in Computer Science from ENS Lyon and UCBL in 1997, a PhD in Computer Science from UNS in 2001, and the Habilitation à Diriger des Recherches in 2010. I did a post-doc in 2002 at Universitat Polytècnica de Catalunya (UPC), DMA4, Barcelona, Spain. In September 2002, I became Chargé de Recherche at Inria Sophia Antipolis. I was a member of the joint project-team Mascotte between INRIA and the I3S laboratory(CNRS/UNS) till December 2012. I was team vice-leader of Mascotte from July 2006 till March 2011, and then the scientific leader of the team till December 2012. In January 2013, we started the new joint project-team COATI. In 2016, I have been promoted Directeur de Recherche.

Data: CV HAL, IdRef, ORCID 0000-0002-3306-8314

• Algorithmics, combinatorial optimization, graph theory
• Algorithm engineering
• WDM networks: traffic grooming, routing and wavelength assignment, protection, reconfiguration
• Wireless Backhaul networks: design, configuration, routing
• Design of fault tolerant networks: shared risk resource groups and various kind of protection mechanisms
• Transportation networks: routing, planning, multi-modal

I'm an active contributor of the open source project Sagemath and in particular of its graph module (tickets written and reviewed).

• The complete list of projects I am (was) involved in can be found here
• Active projects: EA EfDyNet (2019-2021), ANR MultiMod (2018-2023).

2020
	Attend (online) the joint ACP, CNRS GDR IA and RO International Autumn School on Combinatorial Optimization, Constraint Programming and Machine Learning -- online and Toulouse, France -- November 24-27, 2020.
	Global Virtual SageDays 110 -- October 29-30, 2020. I will give a talk on the Flinders Hamiltonian Cycle Problem Challenge (we used Sagemath for this challenge).
	Attend (online) the 15th INFORMS Telecommunications and Network Analytics Conference -- online -- October 20-21, 2020.
	Attend AlgoTel/CoRes 2020 -- Lyon, France -- September 28 - October 2, 2020. Ali Al Zoobi will present our paper entitled Compromis espace-temps pour le problème des k plus courts chemins simples.
	This summer I have mentored Vigul Gupta (third year student of dual degree (B.Tech + M.Tech) Mathematics and Computing course at IIT-BHU, India) for his Google summer of code project with Sagemath. He contributed the improvement of various method related to distances computation in (weighted) (directed) graphs. He has in particular implemented state-of-the-art methods for radius, diameter, eccentricities, etc. See his blog for more details.
	Member of the PhD committee of Huy Duong -- online from Montréal, Québec, Canada -- July 27, 2020. I co-supervised his PhD thesis with Brigitte Jaumard
	Member (and president) of the PhD committee of Imane Oussakel -- online and Toulouse, France -- July 17, 2020.
kSSP	The code (C++) of the algorithms presented in our SEA'20 paper for the k Shortest Simple Paths is now available on gitlab. We also provide a small interface to use it with Sagemath.
	Attend SEA 2020 -- online (originally Catania, Italy) -- June 16-18, 2020. Ali Al Zoobi will present our work on Space and time trade-off for the k shortest simple paths problem.
	Global Virtual SageDays 109 -- May 28, 2020.
	Sagemath participates to the 2020 edition of Google summer of code. I will mentor a student to improve distances computations in the graph module.
	Attend ROADEF 2020 -- Montpellier, France -- February 19-21, 2020.
	Attend Journées du GDR RSD (GDR RSD) -- Nantes, France -- January 23-24, 2020.