default search action
Lehilton L. C. Pedrosa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j16]Yulle G. F. Borges
, Vinícius Loti de Lima, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
Algorithms for the bin packing problem with scenarios. J. Comb. Optim. 48(4): 34 (2024) - [j15]Lehilton L. C. Pedrosa
Approximation Algorithms for the MAXSPACE Advertisement Problem. Theory Comput. Syst. 68(3): 571-590 (2024) - 2023
- [j14]Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado
On the complexity of the Cable-Trench Problem. Discret. Appl. Math. 340: 272-285 (2023) - 2022
- [j13]Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. Algorithmica 84(12): 3522-3558 (2022) - 2021
- [j12]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021) - [j11]Miguel Ángel Marfurt Alarcón
Improved approximation for the capacitated inventory access point problem. Oper. Res. Lett. 49(6): 874-876 (2021) - 2019
- [j10]Marcelo Pinheiro Leite Benedito
Approximation algorithms for Median Hub Location Problems. J. Comb. Optim. 38(2): 375-401 (2019) - 2018
- [j9]Cristina G. Fernandes
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. Algorithmica 80(3): 1041-1072 (2018) - [j8]Lehilton L. C. Pedrosa
Integrated Supply Chain Management via Randomized Rounding. INFORMS J. Comput. 30(1): 124-136 (2018) - [j7]Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery
Approximation algorithms for the bus evacuation problem. J. Comb. Optim. 36(1): 131-141 (2018) - 2017
- [j6]Lucas P. Melo, Flávio Keidi Miyazawa
Approximation algorithms for k-level stochastic facility location problems. J. Comb. Optim. 34(1): 266-278 (2017) - [j5]Flávio Keidi Miyazawa
A PTAS for the Geometric Connected Facility Location Problem. Theory Comput. Syst. 61(3): 871-892 (2017) - [j4]Luis A. A. Meira, Flávio Keidi Miyazawa
Clustering through Continuous Facility Location Problems. Theor. Comput. Sci. 657: 137-145 (2017) - 2016
- [j3]Flávio Keidi Miyazawa
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica 76(2): 536-568 (2016) - 2015
- [j2]Cristina G. Fernandes
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. 153(2): 655-685 (2015) - 2013
- [j1]Lehilton Lelis Chaves Pedrosa, Arnaldo Vieira Moura:
Incremental testing of finite state machines. Softw. Test. Verification Reliab. 23(8): 585-612 (2013)
Conference and Workshop Papers
- 2023
- [c17]Lehilton Lelis Chaves Pedrosa, Lucas de Oliveira Silva:
Freeze-Tag is NP-hard in 3D with L1 distance. LAGOS 2023: 360-366 - [c16]Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery:
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). LAGOS 2023: 400-402 - 2022
- [c15]Marcelo Pinheiro Leite Benedito
A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. LATIN 2022: 141-156 - 2021
- [c14]Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado:
On the Inapproximability of the Cable-Trench Problem. LAGOS 2021: 39-48 - [c13]Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa:
An efficient parameterized approximation scheme for the Star k-Hub Center. LAGOS 2021: 49-58 - 2020
- [c12]Lehilton L. C. Pedrosa
Approximating Routing and Connectivity Problems with Multiple Distances. LATIN 2020: 63-75 - [c11]Lehilton L. C. Pedrosa
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. LATIN 2020: 76-88 - 2019
- [c10]Lehilton L. C. Pedrosa
An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem. ATMOS 2019: 14:1-14:15 - [c9]Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa
Computing the Largest Bond of a Graph. IPEC 2019: 12:1-12:15 - [c8]Mauro R. C. da Silva, Rafael C. S. Schouery
A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. LAGOS 2019: 699-710 - 2018
- [c7]Allan Mariano de Souza
Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency. VTC Spring 2018: 1-7 - 2016
- [c6]Cristina G. Fernandes
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. LATIN 2016: 441-453 - 2014
- [c5]Flávio Keidi Miyazawa
Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA 2014: 713-724 - [c4]Lehilton L. C. Pedrosa, Maxim Sviridenko:
Integrated Supply Chain Management via Randomized Rounding. LATIN 2014: 562-573 - 2012
- [c3]Cristina G. Fernandes
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM 2012: 146-157 - 2010
- [c2]Lehilton L. C. Pedrosa, Arnaldo V. Moura:
A New Method for Incremental Testing of Finite State Machines. NASA Formal Methods 2010: 109-118 - [c1]Lehilton Lelis Chaves Pedrosa, Arnaldo Vieira Moura:
Generalized Partial Test Case Generation Method. SSIRI (Companion) 2010: 70-77
Informal and Other Publications
- 2023
- [i9]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:
Algorithms for the Bin Packing Problem with Scenarios. CoRR abs/2305.15351 (2023) - 2022
- [i8]Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa:
A parameterized approximation algorithm for the Multiple Allocation k-Hub Center. CoRR abs/2205.13030 (2022) - 2020
- [i7]Mauro R. C. da Silva, Lehilton L. C. Pedrosa, Rafael C. S. Schouery:
Approximation algorithms for the MAXSPACE advertisement problem. CoRR abs/2006.13430 (2020) - [i6]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR abs/2007.04513 (2020) - 2019
- [i5]Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza:
Computing the largest bond of a graph. CoRR abs/1910.01071 (2019) - [i4]Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado:
A 2-approximation for the k-prize-collecting Steiner tree problem. CoRR abs/1911.09221 (2019) - 2016
- [i3]Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa:
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. CoRR abs/1608.01721 (2016) - 2014
- [i2]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR abs/1412.4709 (2014) - 2011
- [i1]Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa:
Squared Metric Facility Location Problem. CoRR abs/1111.1672 (2011)
Coauthor Index
aka: Rafael Crivellari Saliba Schouery
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: