We stand with Ukraine  

Hugo K. K. Rosado

Orcid: 0000-0002-8881-9699

Affiliations:
  • Technical University of Munich, Department of Mathematics, Garching, Germany
  • State University of Campinas, SP, Brazil (PhD)


According to our database1, Hugo K. K. Rosado authored at least 5 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.
[BibTeX]
[DOI]
Moritz Buchem
,
Katja Ettmayr
,
Hugo K. K. Rosado
,
Andreas Wiese
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
On the complexity of the Cable-Trench Problem.
[BibTeX]
[DOI]
Marcelo Pinheiro Leite Benedito
,
Lehilton L. C. Pedrosa
,
Hugo K. K. Rosado
Discret. Appl. Math., December, 2023

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

2022
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem.
[BibTeX]
[DOI]
Lehilton Lelis Chaves Pedrosa
,
Hugo Kooki Kasuya Rosado
Algorithmica, 2022

2021
On the Inapproximability of the Cable-Trench Problem.
[BibTeX]
[DOI]
Marcelo Pinheiro Leite Benedito
,
Lehilton L. C. Pedrosa
,
Hugo K. K. Rosado
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021


  Loading...