The Maximum Colorful Arborescence problem: How (computationally) hard can it be?
Theor. Comput. Sci., 2021
Complex graphs in biology : problems, algorithms and evaluation. (Graphes complexes en biologie : problèmes, algorithmes et évaluation).
PhD thesis, 2018
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018
The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.
CoRR, 2017
Algorithmic Aspects of the Maximum Colorful Arborescence Problem.
Proceedings of the Theory and Applications of Models of Computation, 2017