Romain Azaïs

19 papers A 1B 2C 1Journal 14
YearRankTypeTitle / Venue / Authors
2025 J jnl
Maximum likelihood estimation for spinal-structured trees.
J. Appl. Probab.
Romain Azaïs, Benoît Henry
2024 J jnl
Detection of common subtrees with identical label distribution.
Theor. Comput. Sci.
Romain Azaïs, Florian Ingels
2023 J jnl
Characterization of random walks on space of unordered trees using efficient metric simulation.
CoRR
Farah Ben-Naoum, Christophe Godin, Romain Azaïs
2023 J jnl
Characterization of random walks on space of unordered trees using efficient metric simulation.
Discret. Appl. Math.
Farah Ben-Naoum, Christophe Godin, Romain Azaïs
2023 J jnl
Detection of Common Subtrees with Identical Label Distribution.
CoRR
Romain Azaïs, Florian Ingels
2022 — book
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 J jnl
Enumeration of irredundant forests.
Theor. Comput. Sci.
Florian Ingels, Romain Azaïs
2021 C conf
Isomorphic Unordered Labeled Trees up to Substitution Ciphering.
IWOCA
Florian Ingels, Romain Azaïs
2021 J jnl
Isomorphic unordered labeled trees up to substitution ciphering.
CoRR
Florian Ingels, Romain Azaïs
2020 J jnl
Enumeration of Unordered Forests.
CoRR
Florian Ingels, Romain Azaïs
2020 J jnl
The weight function in the subtree kernel is decisive.
J. Mach. Learn. Res.
Romain Azaïs, Florian Ingels
2019 A conf
Approximation of trees by self-nested trees.
ALENEX
Romain Azaïs, Jean-Baptiste Durand, Christophe Godin
2019 J jnl
Nearest Embedded and Embedding Self-Nested Trees.
Algorithms
Romain Azaïs
2019 B conf
SPONGE: Software-Defined Traffic Engineering to Absorb Influx of Network Traffic.
LCN
Benoît Henry, Shihabur Rahman Chowdhury, Abdelkader Lahmadi, Romain Azaïs, Jérôme François, Raouf Boutaba
2019 J jnl
The Weight Function in the Subtree Kernel is Decisive.
CoRR
Romain Azaïs, Florian Ingels
2019 J jnl
treex: a Python package for manipulating rooted trees.
J. Open Source Softw.
Romain Azaïs, Guillaume Cerutti, Didier Gemmerlé, Florian Ingels
2018 J jnl
Approximation of trees by self-nested trees.
CoRR
Romain Azaïs, Jean-Baptiste Durand, Christophe Godin
2017 J jnl
Nearest Embedded and Embedding Self-Nested Trees.
CoRR
Romain Azaïs
2016 B conf
Lossy Compression of Unordered Rooted Trees.
DCC
Romain Azaïs, Jean-Baptiste Durand, Christophe Godin