A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. - Mauro Roberto Costa da Silva; Rafael C. S. Schouery; Lehilton L. C. Pedrosa (LAGOS, 2019)

Acelerando a identificação de impressões digitais através da técnica de offloading computacional. - Renan A. Barbosa; João P. B. Andrade; Mauro Roberto Costa da Silva; Francisco I. da S. Lima; Fernando A. M. Trinta; Paulo A. L. Rego (SBRC, 2021)

Accelerating Fingerprint-based Person Identification through Computation Offloading in Edge and Cloud Environments. - Renan A. Barbosa; João P. B. Andrade; Mauro Roberto Costa da Silva; Fernando A. M. Trinta; Paulo A. L. Rego (CloudNet, 2023)

Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). - Lehilton L. C. Pedrosa; Mauro Roberto Costa da Silva; Rafael C. S. Schouery (LAGOS, 2023)

Local-search based heuristics for advertisement scheduling. - Mauro Roberto Costa da Silva; Rafael Crivellari Saliba Schouery (RAIRO Oper. Res., 2024)

Approximation Algorithms for the MAXSPACE Advertisement Problem. - Lehilton L. C. Pedrosa; Mauro Roberto Costa da Silva; Rafael C. S. Schouery (Theory Comput. Syst., 2024)