Transposition Diameter and Lonely Permutations. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (BSB, 2012)

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (BSB, 2013)

Advancing the Transposition Distance and Diameter through Lonely Permutations. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (SIAM J. Discret. Math., 2013)

Sorting Separable Permutations by Restricted Multi-break Rearrangements. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Celina M. H. de Figueiredo (CTW, 2015)

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (J. Comput. Biol., 2015)

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. - Luís Felipe I. Cunha; Simone Dantas; Travis Gagie; Roland Wittler; Luis A. B. Kowada; Jens Stoye (CPM, 2017)

The tessellation problem of quantum walks. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Tharso D. Fernandes; Celina M. H. de Figueiredo; Luis A. B. Kowada; Franklin L. Marquezino; Daniel Posner; Renato Portugal (CoRR, 2017)

Fast and Simple Jumbled Indexing for Binary RLE Strings. - Luís Felipe I. Cunha; Simone Dantas; Travis Gagie; Roland Wittler; Luis A. B. Kowada; Jens Stoye (CoRR, 2017)

Rearranjo de genomas: algoritmos e complexidade - Luís Felipe I. Cunha (2017)

Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently. - Fernanda Couto; Luís Felipe I. Cunha (COCOA, 2018)

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Tharso D. Fernandes; Celina M. H. de Figueiredo; Luis A. B. Kowada; Franklin L. Marquezino; Daniel Posner; Renato Portugal (LATIN, 2018)

Identifying Maximal Perfect Haplotype Blocks. - Luís Felipe I. Cunha; Yoan Diekmann; Luis A. B. Kowada; Jens Stoye (BSB, 2018)

Closure of genomic sets: applications of graph convexity to genome rearrangement problems. - Luís Felipe I. Cunha; Fábio Protti (Electron. Notes Discret. Math., 2018)

The Tessellation Cover Number of Good Tessellable Graphs. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Luis A. B. Kowada; Franklin L. Marquezino; Renato Portugal; Daniel Posner (CoRR, 2019)

Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs. - Fernanda Couto; Luís Felipe I. Cunha (LAGOS, 2019)

Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems. - Luís Felipe I. Cunha; Fábio Protti (J. Comput. Biol., 2019)

Total tessellation cover and quantum walk. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Franklin L. Marquezino; Daniel Posner; Renato Portugal (CoRR, 2020)

On the computational complexity of closest genome problems. - Luís Felipe I. Cunha; Pedro Feijão; Vinícius Fernandes dos Santos; Luis Antonio Brasil Kowada; Celina M. H. de Figueiredo (Discret. Appl. Math., 2020)

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Luis A. B. Kowada; Franklin L. Marquezino; Daniel Posner; Renato Portugal (Theor. Comput. Sci., 2020)

Hardness and efficiency on minimizing maximum distances in spanning trees. - Fernanda Couto; Luís Felipe I. Cunha (Theor. Comput. Sci., 2020)

Hardness and efficiency on t-admissibility for graph operations. - Fernanda Couto; Luís Felipe I. Cunha (Discret. Appl. Math., 2021)

A computational complexity comparative study of graph tessellation problems. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Luis A. B. Kowada; Franklin L. Marquezino; Renato Portugal; Daniel Posner (Theor. Comput. Sci., 2021)

Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs. - Fernanda Couto; Luís Felipe I. Cunha; Diego Ferraz (CoRR, 2022)

Total tessellation cover: Bounds, hardness, and applications. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Franklin L. Marquezino; Daniel Posner; Renato Portugal (Discret. Appl. Math., 2022)

Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes. - Fernanda Couto; Luís Felipe I. Cunha; Daniel Juventude; Leandro Santiago 003 (Inf. Process. Lett., 2022)

Algorithmic Construction of Tessellation Cover to QUBO Formulations. - Luís Felipe I. Cunha; Franklin L. Marquezino; Daniel Posner; Matheus Romaneli (AAIM (2), 2024)

On the Complexity of the Median and Closest Permutation Problems. - Luís Cunha 001; Ignasi Sau; Uéverton S. Souza (WABI, 2024)

Complexity and algorithms for Swap median and relation to other consensus problems. - Luís Cunha 001; Thiago Lopes; Arnaud Mary (CoRR, 2024)

Closing the complexity gap of the double distance problem. - Luís Cunha 001; Thiago Lopes; Uéverton S. Souza; Marília D. V. Braga; Jens Stoye (CoRR, 2024)

Graph admissibility: Case generation and analysis by learning models. - Luís Felipe I. Cunha; Leandro Santiago 003; Felipe Silva Souza (J. Comput. Sci., 2024)

New parallelism and heuristic approaches for generating tree t -spanners in graphs. - Luís Felipe I. Cunha; Eriky Marciano; Anderson Moraes; Leandro Santiago 003; Carlos Santos (Concurr. Comput. Pract. Exp., 2024)

On the parameterized complexity of the median and closest problems under some permutation metrics. - Luís Cunha 001; Ignasi Sau; Uéverton S. Souza (Algorithms Mol. Biol., 2024)

Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable. - Luís Felipe I. Cunha; Ignasi Sau; Uéverton S. Souza; Mario Valencia-Pabon (ICALP, 2025)

Induced tree covering and the generalized Yutsis property. - Luís Cunha 001; Gabriel L. Duarte; Fábio Protti; Loana Tito Nogueira; Uéverton S. Souza (J. Comput. Syst. Sci., 2025)

Structural characterizations of tree t-spanners for graphs with few P4's and (0, ℓ)-graphs. - Fernanda Couto; Luís Felipe I. Cunha; Diego Ferraz (RAIRO Oper. Res., 2025)

Minimizing distances between vertices and edges through tree t-spanners. - Fernanda Couto; Luís Cunha 001; Edmundo Pinto; Daniel Posner (Theor. Comput. Sci., 2025)

Determining distances and consensus between mutation trees. - Luís Cunha 001; Jack Kuipers; Thiago Lopes (CoRR, 2025)