Romain Azaïs

According to our database, Romain Azaïs authored at least 12 papers between 2016 and 2023.

Collaborative distances:

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

2023

Characterization of random walks on space of unordered trees using efficient metric simulation.

Farah Ben-Naoum, Christophe Godin, Romain Azaïs

Discret. Appl. Math., December, 2023

Detection of Common Subtrees with Identical Label Distribution.

Romain Azaïs, Florian Ingels

CoRR, 2023

2022

Enumeration of irredundant forests.

Florian Ingels, Romain Azaïs

Theor. Comput. Sci., 2022

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

2021

Isomorphic Unordered Labeled Trees up to Substitution Ciphering.

Florian Ingels, Romain Azaïs

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

The weight function in the subtree kernel is decisive.

Romain Azaïs, Florian Ingels

J. Mach. Learn. Res., 2020

Enumeration of Unordered Forests.

Florian Ingels, Romain Azaïs

CoRR, 2020

2019

treex: a Python package for manipulating rooted trees.

Romain Azaïs, Guillaume Cerutti, Didier Gemmerlé, Florian Ingels

J. Open Source Softw., 2019

Nearest Embedded and Embedding Self-Nested Trees.

Romain Azaïs

Algorithms, 2019

SPONGE: Software-Defined Traffic Engineering to Absorb Influx of Network Traffic.

Benoit Henry, Shihabur Rahman Chowdhury, Abdelkader Lahmadi, Romain Azaïs, Jérôme François, Raouf Boutaba

Proceedings of the 44th IEEE Conference on Local Computer Networks, 2019

Approximation of trees by self-nested trees.

Romain Azaïs, Jean-Baptiste Durand, Christophe Godin

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2016

Lossy Compression of Unordered Rooted Trees.

Romain Azaïs, Jean-Baptiste Durand, Christophe Godin

Proceedings of the 2016 Data Compression Conference, 2016