Lehilton L. C. Pedrosa

36 papers A 1B 6C 5Journal 21Unranked 3

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Algorithms for the bin packing problem with scenarios. J. Comb. Optim. 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
2024	J	`jnl`	Approximation Algorithms for the MAXSPACE Advertisement Problem. Theory Comput. Syst. Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery
2023	J	`jnl`	Algorithms for the Bin Packing Problem with Scenarios. CoRR 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
2023	J	`jnl`	On the complexity of the Cable-Trench Problem. Discret. Appl. Math. Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado
2023	C	`conf`	Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). LAGOS Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery
2022	B	`conf`	A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. LATIN Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa
2022	J	`jnl`	A parameterized approximation algorithm for the Multiple Allocation k-Hub Center. CoRR Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa
2021	C	`conf`	An efficient parameterized approximation scheme for the Star k-Hub Center. LAGOS Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa
2021	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2021	C	`conf`	On the Inapproximability of the Cable-Trench Problem. LAGOS Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado
2020	B	`conf`	A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. LATIN Lehilton L. C. Pedrosa, Hugo K. K. Rosado
2020	B	`conf`	Approximating Routing and Connectivity Problems with Multiple Distances. LATIN Lehilton L. C. Pedrosa, Greis Y. O. Quesquén
2020	J	`jnl`	Approximation algorithms for the MAXSPACE advertisement problem. CoRR Mauro Roberto Costa da Silva, Lehilton L. C. Pedrosa, Rafael C. S. Schouery
2020	J	`jnl`	Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2019	C	`conf`	A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. LAGOS Mauro Roberto Costa da Silva, Rafael C. S. Schouery, Lehilton L. C. Pedrosa
2019	C	`conf`	An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem. ATMOS Lehilton L. C. Pedrosa, Greis Y. O. Quesquén, Rafael C. S. Schouery
2019	J	`jnl`	Approximation algorithms for Median Hub Location Problems. J. Comb. Optim. Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa
2019	B	`conf`	Computing the Largest Bond of a Graph. IPEC Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2019	J	`jnl`	Computing the largest bond of a graph. CoRR Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
2018	J	`jnl`	Approximation algorithms for the bus evacuation problem. J. Comb. Optim. Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery
2018	J	`jnl`	Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. Algorithmica Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
2018	J	`jnl`	Integrated Supply Chain Management via Randomized Rounding. INFORMS J. Comput. Lehilton L. C. Pedrosa, Maxim Sviridenko
2018	—	`conf`	Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency. VTC Spring Allan Mariano de Souza, Lehilton L. C. Pedrosa, Leonardo C. Botega, Leandro Villas
2017	J	`jnl`	A PTAS for the Geometric Connected Facility Location Problem. Theory Comput. Syst. Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Renata G. D. de Souza
2017	J	`jnl`	Approximation algorithms for k-level stochastic facility location problems. J. Comb. Optim. Lucas P. Melo, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery
2017	J	`jnl`	Clustering through Continuous Facility Location Problems. Theor. Comput. Sci. Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
2016	B	`conf`	Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. LATIN Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
2016	J	`jnl`	Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. CoRR Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
2016	J	`jnl`	Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
2015	J	`jnl`	A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
2014	B	`conf`	Integrated Supply Chain Management via Randomized Rounding. LATIN Lehilton L. C. Pedrosa, Maxim Sviridenko
2014	A	`conf`	Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
2014	J	`jnl`	Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
2012	—	`conf`	A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
2011	J	`jnl`	Squared Metric Facility Location Problem CoRR Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
2010	—	`conf`	A New Method for Incremental Testing of Finite State Machines. NASA Formal Methods Lehilton L. C. Pedrosa, Arnaldo V. Moura

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.