Ranked Schröder Trees. - Olivier Bodini; Antoine Genitrini; Mehdi Naima (ANALCO, 2019)

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. - Olivier Bodini; Antoine Genitrini; Mehdi Naima; Alexandros Singh (CSR, 2020)

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

A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. - Olivier Bodini; Antoine Genitrini; Mehdi Naima (LATIN, 2022)

Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study. - Olivier Bodini; Antoine Genitrini; Cécile Mailler; Mehdi Naima (Adv. Appl. Math., 2022)

Compaction for two models of logarithmic-depth trees: Analysis and experiments. - Olivier Bodini; Antoine Genitrini; Bernhard Gittenberger; Isabella Larcher; Mehdi Naima (Random Struct. Algorithms, 2022)

Temporal Betweenness Centrality on Shortest Paths Variants. - Mehdi Naima; Matthieu Latapy; Clémence Magnien (CoRR, 2023)

A lattice on Dyck paths close to the Tamari lattice. - Jean-Luc Baril; Sergey Kirgizov; Mehdi Naima (CoRR, 2023)

Efficient Sampling of Temporal Networks with Preserved Causality Structure. - Felix I. Stamm; Mehdi Naima; Michael T. Schaub (SDM, 2025)

Optimal Uniform Shortest Path Sampling. - Simon Dreyer; Antoine Genitrini; Mehdi Naima (WALCOM, 2025)

The Ascent Lattice on Dyck Paths. - Jean-Luc Baril; Mireille Bousquet-Mélou; Sergey Kirgizov; Mehdi Naima (Electron. J. Comb., 2025)

Temporal betweenness centrality on shortest walks variants. - Mehdi Naima (Appl. Netw. Sci., 2025)