Mehdi Naima. Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes). PhD thesis, University Sorbonne Paris Nord, France, 2020. [doi]
@phdthesis{hal-15430,
title = {Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes)},
author = {Mehdi Naima},
year = {2020},
url = {https://tel.archives-ouvertes.fr/tel-03160040},
researchr = {https://researchr.org/publication/hal-15430},
cites = {0},
citedby = {0},
school = {University Sorbonne Paris Nord, France},
}