Publications 2019-2025

• 2025
  • S. Dreyer, A. Genitrini, M. Naima : “Optimal Uniform Shortest Path Sampling”, WALCOM: Algorithms and Computation, vol. 15411, Lecture Notes in Computer Science, Chengdu, China, pp. 160-179, (Springer Nature Singapore) (2025)
  • J.‑L. Baril, M. Bousquet‑Mélou, S. Kirgizov, M. Naima : “The ascent lattice on Dyck paths”, The Electronic Journal of Combinatorics, vol. 32 (2), pp. p2.36, (Open Journal Systems) (2025)
  • J.‑L. Baril, S. Kirgizov, M. Naima : “A lattice on Dyck paths close to the Tamari lattice”, Seminaire Lotharingien de Combinatoire, vol. 89, (Université Louis Pasteur) (2025)
• 2023
  • J.‑L. Baril, S. Kirgizov, M. Naima : “A lattice on Dyck paths close to the Tamari Lattice”, Computational Logic and Applications, Kraków, Poland (2023)
• 2022
  • A. Genitrini, M. Naima, O. Bodini : “A combinatorial link between labelled graphs and increasingly labelled Schröder trees”, The 15^th Latin American Theoretical Informatics Symposium, vol. 13568, Lecture Notes in Computer Science, Guanajuato, Mexico, pp. 493-509, (Springer) (2022)
  • O. Bodini, A. Genitrini, B. Gittenberger, I. Larcher, M. Naima : “Compaction for two models of logarithmic-depth trees: Analysis and Experiments”, Random Structures and Algorithms, vol. 61 (1), pp. 31-61, (Wiley) (2022)
  • O. Bodini, A. Genitrini, C. Mailler, M. Naima : “Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study”, Advances in Applied Mathematics, vol. 133, pp. 102284, (Elsevier) (2022)
• 2020
  • O. Bodini, A. Genitrini, M. Naima, A. Singh : “Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics”, Computer Science - Theory and Applications - 15^th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings, vol. 12159, Lecture Notes in Computer Science, Yekaterinburg, Russian Federation, pp. 155-168, (Springer), (ISBN: 978-3-030-50025-2) (2020)
• 2019
  • O. Bodini, A. Genitrini, M. Naima : “Ranked Schröder Trees”, ANALCO 2019 - 16^th Workshop on Analytic Algorithmics and Combinatorics, San Diego, CA, United States, pp. 13-26, (Society for Industrial and Applied Mathematics) (2019)