Kennedy Corrêa and Manoel Campêlo. 2025.
 NP-Hardness and Approximation Results for the Minimally Labeled k-Spanning Forest Problem. In <em>Proceedings of the 10th Theory of Computation Meeting</em>, July 20, 2025, Maceió/AL, Brasil. SBC, Porto Alegre, Brasil, 65-69. DOI: <a href="https://doi.org/10.5753/etc.2025.8860">https://doi.org/10.5753/etc.2025.8860</a>.