On the Inapproximability of the Cable-Trench Problem. - Marcelo Pinheiro Leite Benedito; Lehilton L. C. Pedrosa; Hugo K. K. Rosado (LAGOS, 2021)

A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. - Lehilton Lelis Chaves Pedrosa; Hugo Kooki Kasuya Rosado (Algorithmica, 2022)

A (3+ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. - Moritz Buchem; Katja Ettmayr; Hugo K. K. Rosado; Andreas Wiese (CoRR, 2023)

On the complexity of the Cable-Trench Problem. - Marcelo Pinheiro Leite Benedito; Lehilton L. C. Pedrosa; Hugo K. K. Rosado (Discret. Appl. Math., 2023)

Scheduling on a Stochastic Number of Machines. - Moritz Buchem; Franziska Eberle; Hugo Kooki Kasuya Rosado; Kevin Schewior; Andreas Wiese (APPROX/RANDOM, 2024)

A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. - Moritz Buchem; Katja Ettmayr; Hugo K. K. Rosado; Andreas Wiese (SODA, 2024)