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 the University Nice - Sophia Antipolis (UNS). 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.
- 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
- The complete list of projects I am (was) involved in can be found here
- Active projects: EA EfDyNet (2019-2021), ANR MultiMod (2018-2021).
|Attend the Journées du GDR RSD (GDR RSD) -- Nantes, France -- January 23-24, 2020.|
|Attended (referee) the PhD thesis of Francesca Fossati -- LIP6, Paris, France -- November 29, 2019.|
|Attended (referee) the PhD thesis of Valentin Pollet -- LIRMM, Montpellier, France -- October 3, 2019.|
|Attend New Horizons in Computational Geometry and Topology -- Inria, Sophia Antipolis, France, September 5-6 2019.|
|This summer, I was a mentor for Sagemath in the context of Google Summer of Code. The students, Rajat Mittal, Georgios Giapitzakis Tzintanos, and Ritesh K have worked on improving various methods of the graph module related to shortest paths computation and implementing Yen's k-shortest simple paths algorithm. They have also implemented various graph traversal methods like Lex-BFS, Lex-DFS, Lex-UP, Lex-DOWN, and Lew-M. See the tickets on which the students have worked. Project reports can be found on students web pages.|
|Visit Concordia University in the context of associated-team EfDyNet -- Montréal Canada, July 12-27, 2019.
Seminar on the Flinders Hamiltonian Cycle Problem Challenge at the Department of Computer Science & Software Engineering of Concordia University, July 25, 2019.
|Attend CoRes'19 and AlgoTel'19 -- Saint Laurent de la Cabrerisse, France -- June 3-7, 2019.
See the online proceedings in HAL for CoRes and AlgoTel.
I will give a keynote lecture on the Flinders Hamiltonian Cycle Problem Challenge.
|Attended Workshop Complexité et algorithmes -- Roscoff, France -- April 3-5, 2019.
Laurent Viennot and myself will present recent achievements of ANR MULTIMOD.
|MULTIMOD||Project meeting of ANR project MultiMod -- Roscoff, France -- April 1-2, 2019.|
|Keynote speaker at the 21ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2019) -- Saint Laurent de la Cabrerisse, France -- June 3-7, 2019. See the online proceedings in HAL.
I will present what we did to win the Flinders Hamiltonian Cycle Problem Challenge.
|CoRes 2019||Attend the 4e Rencontres Francophones sur la Conception de Protocoles, l'Evaluation de Performance et l'Expérimentation des Réseaux de Communication (CoRes 2019) -- Saint Laurent de la Cabrerisse, France -- June 2-3, 2019. See the online proceedings in HAL.|
|Attend the Journées non-thématiques RESCOM of GDR RSD -- Grenoble, France -- January 17-18, 2019.|