Mehdi Naima

Orcid: 0000-0003-2735-2420

According to our database1, Mehdi Naima authored at least 12 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Temporal betweenness centrality on shortest walks variants.
Appl. Netw. Sci., December, 2025

The Ascent Lattice on Dyck Paths.
Electron. J. Comb., 2025

Optimal Uniform Shortest Path Sampling.
Proceedings of the WALCOM: Algorithms and Computation, 2025

Efficient Sampling of Temporal Networks with Preserved Causality Structure.
Proceedings of the 2025 SIAM International Conference on Data Mining, 2025

2023
A lattice on Dyck paths close to the Tamari lattice.
CoRR, 2023

Temporal Betweenness Centrality on Shortest Paths Variants.
CoRR, 2023

2022
Compaction for two models of logarithmic-depth trees: Analysis and experiments.
Random Struct. Algorithms, 2022

Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study.
Adv. Appl. Math., 2022

A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2020
Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes).
PhD thesis, 2020

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.
Proceedings of the Computer Science - Theory and Applications, 2020

2019
Ranked Schröder Trees.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019


  Loading...