Julien Fradin

According to our database, Julien Fradin authored at least 5 papers between 2017 and 2021.

Collaborative distances:

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

2021

The Maximum Colorful Arborescence problem: How (computationally) hard can it be?

Guillaume Fertin, Julien Fradin, Géraldine Jean

Theor. Comput. Sci., 2021

2018

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

Julien Fradin

PhD thesis, 2018

On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure.

Guillaume Fertin, Julien Fradin, Christian Komusiewicz

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.

Guillaume Fertin, Julien Fradin, Christian Komusiewicz

CoRR, 2017

Algorithmic Aspects of the Maximum Colorful Arborescence Problem.

Guillaume Fertin, Julien Fradin, Géraldine Jean

Proceedings of the Theory and Applications of Models of Computation, 2017