Mehdi Naima

According to our database, Mehdi Naima authored at least 15 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Reversible Residual Normalization Alleviates Spatio-Temporal Distribution Shift.

Zhaobo Hu, Vincent Gauthier, Mehdi Naima

CoRR, April, 2026

Modern Structure-Aware Simplicial Spatiotemporal Neural Network.

Zhaobo Hu, Vincent Gauthier, Mehdi Naima

CoRR, April, 2026

Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks.

Zhaobo Hu, Vincent Gauthier, Mehdi Naima

CoRR, April, 2026

2025

Temporal betweenness centrality on shortest walks variants.

Mehdi Naima

Appl. Netw. Sci., December, 2025

The Ascent Lattice on Dyck Paths.

Jean-Luc Baril, Mireille Bousquet-Mélou, Sergey Kirgizov, Mehdi Naima

Electron. J. Comb., 2025

Optimal Uniform Shortest Path Sampling.

Simon Dreyer, Antoine Genitrini, Mehdi Naima

Proceedings of the WALCOM: Algorithms and Computation, 2025

Efficient Sampling of Temporal Networks with Preserved Causality Structure.

Felix I. Stamm, Mehdi Naima, Michael T. Schaub

Proceedings of the 2025 SIAM International Conference on Data Mining, 2025

2023

A lattice on Dyck paths close to the Tamari lattice.

Jean-Luc Baril, Sergey Kirgizov, Mehdi Naima

CoRR, 2023

Temporal Betweenness Centrality on Shortest Paths Variants.

Mehdi Naima, Matthieu Latapy, Clémence Magnien

CoRR, 2023

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

Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study.

Olivier Bodini, Antoine Genitrini, Cécile Mailler, Mehdi Naima

Adv. Appl. Math., 2022

A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees.

Olivier Bodini, Antoine Genitrini, Mehdi Naima

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).

Mehdi Naima

PhD thesis, 2020

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.

Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh

Proceedings of the Computer Science - Theory and Applications, 2020

2019

Ranked Schröder Trees.

Olivier Bodini, Antoine Genitrini, Mehdi Naima

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019