| On the inapproximability of the cable-trench problem MPL Benedito, LLC Pedrosa, HKK Rosado Procedia Computer Science 195, 39-48, 2021 | 4 | 2021 |
| A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem LLC Pedrosa, HKK Rosado Algorithmica 84 (12), 3522-3558, 2022 | 3 | 2022 |
| A constant-factor approximation for the generalized cable-trench problem M Benedito, L Pedrosa, H Rosado Anais do IV Encontro de Teoria da Computação, 2019 | 2 | 2019 |
| On the complexity of the Cable-Trench Problem MPL Benedito, LLC Pedrosa, HKK Rosado Discrete Applied Mathematics 340, 272-285, 2023 | 1 | 2023 |
| A (3+ ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds M Buchem, K Ettmayr, HKK Rosado, A Wiese Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | | 2024 |
| Approximation algorithms for network design problems with node constraints= Algoritmos de aproximação para problemas de rede com restrições de vértices HKK Rosado [sn], 2021 | | 2021 |
| An approximation algorithm for the q-metric node-weighted Steiner tree problem= Um algoritmo de aproximação para o problema da árvore de Steiner q-métrico com peso nos vértices HKK Rosado [sn], 2017 | | 2017 |
| Orientador: Rafael de Freitas Leão Agência: PICME e CNPQ Palavras-Chave: Topologia-Topologia Algébrica-Grupo Fundamental HKK Rosado | | |
