Gabriel Azevedo and Yoshiko Wakabayashi. 2024.
 An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph. In <em>Anais do IX Encontro de Teoria da Computação</em>, julho 21, 2024, Brasília/DF, Brasil. SBC, Porto Alegre, Brasil, 63-67. DOI: <a href="https://doi.org/10.5753/etc.2024.2500">https://doi.org/10.5753/etc.2024.2500</a>.