Since September 1st 2023, I am an assistant professor at Sorbonne Université in the ComplexNetworks team of LIP6 which is a computer science research institute.

From March 2023 to July 2023 I was a visiting researcher at the Computational Network Science team of the computer science department of RWTH, Aachen, Germany. I am currently working on extensions of the color refinement algorithm of Weisfeiler and Leman to temporal graphs and its relationship to temporal graph centralities.

From September 2021 to February 2022 I was postdoctoral researcher at Sorbonne Université in the ComplexNetworks team. I mostly worked on graph metrics and graph random generation under the supervision of Matthieu Latapy.

My main subjects of interest are graph theory, dynamic graphs, combinatorics, random generation, analysis of algorithms and evolution processes than can model data structures and phylogenetic trees.

During my PhD that I did at Université Sorbonne Paris Nord under the supervision of Olivier Bodini and Antoine Genitrini I mostly worked around the enumeration, asymptotics and properties of increasing trees with label repetitions and finding connections with classical combinatorial objects. I also worked on the average tree compaction of some classes of increasing trees.

News

9 November, 2024	Our paper on shortest path sampling in graphs with Antoine Gentrini and Simon Dreyer has been accepted for publication at the 19th International Conference and Workshops on Algorithms and Computation WALCOM25.
1 October, 2024	Our draft paper on partial orders over walks with Mireille Bousquet-Mélou, Jean-Luc Baril and Sergey Kirgizov is available on HAL.
26 August, 2024	Our draft paper on shortest path sampling in graphs with Antoine Gentrini and Simon Dreyer is available on HAL.
27-28 January, 2024	I help organize SWERC which is a european programming contest SWERC 2024 which is held at Sorbonne Université, Paris, France.
22-24 January, 2024	I participated and gave a talk at 3rd annual meeting on LambdaComb days which was held at Sorbonne Université, Paris, France.
14-15 December, 2023	I participated and gave a talk at 17th Workshop of Computational Logic and Applications which was held in Jagiellonian University in Kraków, Poland.
3-7 July, 2023	I participated and was one of the co-organizers of the conference PermutationPatterns2023 which was held in Dijon, France.
31 May - 2 June, 2023	I participated and gave a talk at French Regional Conference on Complex Systems FRCCS 2023 which was held in Le Havre, France.
24 - 25 May, 2023	I participated and presented a poster at 5th Symposium of GDR MADICS MADICS 2023 which was held in Troyes, France.
13 April, 2023	I gave a seminar on Temporal Betweenness centrality at the Institute of Data Science at Maastricht University Maastricht, Netherlands.

Current Research Projects

• Together with Antoine Genitrini and Simon Dreyer we are working on random generation of shortest paths in graphs and couting problems with directed acyclic graphs arising from graph traversals.

• Together with Jean-Luc Baril and Sergey Kirgizov we are working on Dyck Paths transforms and their relations to order theory and other classical objects in combinatorics such as combinatorial maps.

• Together with Matthieu Latapy and Clémence Magnien we are working on temporal graphs centralities and more specifically the betweenness centrality.

• Together with Felix I. Stamm and Michael T. Schaub we are working on invariant centrality measures under rewirings in temporal graphs.

• Together with Olivier Bodini, Antoine Genitrini and Alois Panholzer we are working on increasing trees with labelled repetitions.

• Together with Murilo da Silva, Fabrice Lecuyer and Alane Marie de Lima we are working on approximating the local clustering coefficient in temporal graphs.

About me

University	Sorbonne Université - Campus Marie et Pierre Curie
Laboratory	LIP6
Address	4, Place Jussieu, 75005 Paris
Office	26-00 303
Email	mehdi.naima@lip6.fr
Phone	+33 1 44 27 70 37