A New Method for Incremental Testing of Finite State Machines. - Lehilton L. C. Pedrosa; Arnaldo V. Moura (NASA Formal Methods, 2010)

Generalized Partial Test Case Generation Method. - Lehilton Lelis Chaves Pedrosa; Arnaldo Vieira Moura (SSIRI (Companion), 2010)

Squared Metric Facility Location Problem - Cristina G. Fernandes; Luis A. A. Meira; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa (CoRR, 2011)

Incremental testing of finite state machines. - Lehilton Lelis Chaves Pedrosa; Arnaldo Vieira Moura (Softw. Test. Verification Reliab., 2013)

Polynomial-Time Approximation Schemes for Circle Packing Problems. - Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa; Rafael Crivellari Saliba Schouery; Maxim Sviridenko; Yoshiko Wakabayashi (ESA, 2014)

A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. - Cristina G. Fernandes; Luis A. A. Meira; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa (Math. Program., 2015)

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. - Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa; Rafael Crivellari Saliba Schouery; Maxim Sviridenko; Yoshiko Wakabayashi (Algorithmica, 2016)

Approximation algorithms for k-level stochastic facility location problems. - Lucas P. Melo; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa; Rafael Crivellari Saliba Schouery (J. Comb. Optim., 2017)

A PTAS for the Geometric Connected Facility Location Problem. - Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa; Rafael Crivellari Saliba Schouery; Renata G. D. de Souza (Theory Comput. Syst., 2017)

Clustering through Continuous Facility Location Problems. - Luis A. A. Meira; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa (Theor. Comput. Sci., 2017)

Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency. - Allan Mariano de Souza; Lehilton L. C. Pedrosa; Leonardo C. Botega; Leandro Villas (VTC Spring, 2018)

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. - Cristina G. Fernandes; Samuel P. de Paula; Lehilton L. C. Pedrosa (Algorithmica, 2018)

Integrated Supply Chain Management via Randomized Rounding. - Lehilton L. C. Pedrosa; Maxim Sviridenko (INFORMS J. Comput., 2018)

Approximation algorithms for the bus evacuation problem. - Lehilton L. C. Pedrosa; Rafael Crivellari Saliba Schouery (J. Comb. Optim., 2018)

An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem. - Lehilton L. C. Pedrosa; Greis Y. O. Quesquén; Rafael C. S. Schouery (ATMOS, 2019)

Computing the Largest Bond of a Graph. - Gabriel L. Duarte; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (IPEC, 2019)

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)

Approximation algorithms for Median Hub Location Problems. - Marcelo Pinheiro Leite Benedito; Lehilton L. C. Pedrosa (J. Comb. Optim., 2019)

Approximating Routing and Connectivity Problems with Multiple Distances. - Lehilton L. C. Pedrosa; Greis Y. O. Quesquén (LATIN, 2020)

An efficient parameterized approximation scheme for the Star k-Hub Center. - Marcelo Pinheiro Leite Benedito; Lehilton L. C. Pedrosa (LAGOS, 2021)

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

Computing the Largest Bond and the Maximum Connected Cut of a Graph. - Gabriel L. Duarte; Hiroshi Eto; Tesshu Hanaka; Yasuaki Kobayashi; Yusuke Kobayashi 001; Daniel Lokshtanov; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Uéverton S. Souza (Algorithmica, 2021)

Improved approximation for the capacitated inventory access point problem. - Miguel Ángel Marfurt Alarcón; Lehilton Lelis Chaves Pedrosa (Oper. Res. Lett., 2021)

A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. - Marcelo Pinheiro Leite Benedito; Lucas P. Melo; Lehilton L. C. Pedrosa (LATIN, 2022)

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

Freeze-Tag is NP-hard in 3D with L1 distance. - Lehilton Lelis Chaves Pedrosa; Lucas de Oliveira Silva (LAGOS, 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)

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

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

Algorithms for the bin packing problem with scenarios. - Yulle G. F. Borges; Vinícius Loti de Lima; Flávio Keidi Miyazawa; Lehilton L. C. Pedrosa; Thiago Alves de Queiroz; Rafael C. S. Schouery (J. Comb. Optim., 2024)

Fast constructive heuristics for the uncapacitated inventory routing problem. - Miguel Ángel Marfurt Alarcón; Lehilton Lelis Chaves Pedrosa; Fábio Luiz Usberti (J. Heuristics, 2025)