Advanced search
Start date
Betweenand

Lehilton Lelis Chaves Pedrosa

CV Lattes GoogleMyCitations


Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC)  (Institutional affiliation for the last research proposal)
Birthplace: Brazil

Bachelor- Computer Science - University of Brasília (2007), MSc - Computer Science - University of Campinas (2010), PhD - Computer Science - University of Campinas (2014). Currently Assistent professor at Institute of Computing - University of Campinas. (Source: Lattes Curriculum)

Research grants
Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated November 16, 2019
Total / Available in English
Most frequent collaborators in research granted by FAPESP
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (8)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications8
Citations16
Cit./Article2.0
Data from Web of Science

CHAVES PEDROSA, LEHILTON LELIS; MOURA, ARNALDO VIEIRA. Incremental testing of finite state machines. SOFTWARE TESTING VERIFICATION & RELIABILITY, v. 23, n. 8, p. 585-612, . Web of Science Citations: 2. (08/07969-9)

MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; SVIRIDENKO, MAXIM; WAKABAYASHI, YOSHIKO. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. ALGORITHMICA, v. 76, n. 2, p. 536-568, . Web of Science Citations: 5. (13/03447-6, 13/02434-8, 10/20710-4, 13/21744-8)

MEIRA, LUIS A. A.; MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.. Clustering through Continuous Facility Location Problems. THEORETICAL COMPUTER SCIENCE, v. 657, n. B, p. 137-145, . Web of Science Citations: 0. (10/20710-4)

FERNANDES, CRISTINA G.; MEIRA, LUIS A. A.; MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. MATHEMATICAL PROGRAMMING, v. 153, n. 2, p. 655-685, . Web of Science Citations: 7. (10/20710-4)

PEDROSA, LEHILTON L. C.; SVIRIDENKO, MAXIM. Integrated Supply Chain Management via Randomized Rounding. INFORMS JOURNAL ON COMPUTING, v. 30, n. 1, p. 124-136, . Web of Science Citations: 0. (12/17634-0)

FERNANDES, CRISTINA G.; DE PAULA, SAMUEL P.; PEDROSA, LEHILTON L. C.. Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. ALGORITHMICA, v. 80, n. 3, SI, p. 1041-1072, . Web of Science Citations: 2. (13/03447-6, 14/14209-1)

MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; DE SOUZA, RENATA G. D.. A PTAS for the Geometric Connected Facility Location Problem. THEORY OF COMPUTING SYSTEMS, v. 61, n. 3, p. 871-892, . Web of Science Citations: 0. (14/14209-1, 13/21744-8)

BENEDITO, MARCELO P. L.; PEDROSA, LEHILTON L. C.. Approximation algorithms for Median Hub Location Problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 38, n. 2, p. 375-401, . Web of Science Citations: 0. (16/12006-1, 15/11937-9)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

PEDROSA, Lehilton Lelis Chaves. Geração automática de casos de testes para máquinas de estados finitos. 2010. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (08/07969-9)

PEDROSA, Lehilton Lelis Chaves. Approximation algorithms for facility location problems and other supply chain problems. 2014. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas. (10/20710-4)

BENEDITO, Marcelo Pinheiro Leite. Approximation algorithms for hub location problems : Algoritmos de aproximação para problemas de localização e alocação de terminais. 2018. Dissertação (Mestrado) - (16/12006-1)

Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: