List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? Theoretical Computer Science | 2021-01-25 | Paper |
| On the maximum colorful arborescence problem and color hierarchy graph structure (available as arXiv preprint) | 2020-12-16 | Paper |
| Algorithmic aspects of the maximum colorful arborescence problem Lecture Notes in Computer Science | 2017-05-19 | Paper |
Research outcomes over time
This page was built for person: Julien Fradin
