Algorithmic Aspects of the Maximum Colorful Arborescence Problem. - Guillaume Fertin; Julien Fradin; Géraldine Jean (TAMC, 2017)

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. - Guillaume Fertin; Julien Fradin; Christian Komusiewicz (CoRR, 2017)

On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. - Guillaume Fertin; Julien Fradin; Christian Komusiewicz (CPM, 2018)

Complex graphs in biology : problems, algorithms and evaluation. (Graphes complexes en biologie : problèmes, algorithmes et évaluation). - Julien Fradin (2018)

The Maximum Colorful Arborescence problem: How (computationally) hard can it be? - Guillaume Fertin; Julien Fradin; Géraldine Jean (Theor. Comput. Sci., 2021)