Lossy Compression of Unordered Rooted Trees. - Romain Azaïs; Jean-Baptiste Durand; Christophe Godin (DCC, 2016)

Approximation of trees by self-nested trees. - Romain Azaïs; Jean-Baptiste Durand; Christophe Godin (ALENEX, 2019)

SPONGE: Software-Defined Traffic Engineering to Absorb Influx of Network Traffic. - Benoît Henry; Shihabur Rahman Chowdhury; Abdelkader Lahmadi; Romain Azaïs; Jérôme François; Raouf Boutaba (LCN, 2019)

Nearest Embedded and Embedding Self-Nested Trees. - Romain Azaïs (Algorithms, 2019)

treex: a Python package for manipulating rooted trees. - Romain Azaïs; Guillaume Cerutti; Didier Gemmerlé; Florian Ingels (J. Open Source Softw., 2019)

Enumeration of Unordered Forests. - Florian Ingels; Romain Azaïs (CoRR, 2020)

The weight function in the subtree kernel is decisive. - Romain Azaïs; Florian Ingels (J. Mach. Learn. Res., 2020)

Isomorphic Unordered Labeled Trees up to Substitution Ciphering. - Florian Ingels; Romain Azaïs (IWOCA, 2021)

Approches algorithmiques pour la statistique : processus déterministes par morceaux et arbres aléatoires. (Algorithmic approach to statistics: piecewise-deterministic processes and random trees). - Romain Azaïs (2022)

Enumeration of irredundant forests. - Florian Ingels; Romain Azaïs (Theor. Comput. Sci., 2022)

Characterization of random walks on space of unordered trees using efficient metric simulation. - Farah Ben-Naoum; Christophe Godin; Romain Azaïs (Discret. Appl. Math., 2023)

Detection of common subtrees with identical label distribution. - Romain Azaïs; Florian Ingels (Theor. Comput. Sci., 2024)

Maximum likelihood estimation for spinal-structured trees. - Romain Azaïs; Benoît Henry (J. Appl. Probab., 2025)