| Advancing the transposition distance and diameter through lonely permutations LFI Cunha, LAB Kowada, R de A. Hausen, CMH de Figueiredo SIAM Journal on Discrete Mathematics 27 (4), 1682-1709, 2013 | 7 | 2013 |
| The graph tessellation cover number: extremal bounds, efficient algorithms and hardness A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ... Latin American Symposium on Theoretical Informatics, 1-13, 2018 | 6 | 2018 |
| Transposition diameter and lonely permutations LFI Cunha, LAB Kowada, RA Hausen, CMH de Figueiredo Brazilian Symposium on Bioinformatics, 1-12, 2012 | 5* | 2012 |
| Faster jumbled indexing for binary RLE strings LFI Cunha, S Dantas, T Gagie, R Wittler, JS LAB Kowada 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017 | 4* | 2017 |
| On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time LFI Cunha, LAB Kowada, RA Hausen, CMH de Figueiredo Brazilian Symposium on Bioinformatics, 126-135, 2013 | 4 | 2013 |
| A faster 1.375-approximation algorithm for sorting by transpositions LFI Cunha, LAB Kowada, RA Hausen, CMH de Figueiredo Journal of Computational Biology 22 (11), 1044-1056, 2015 | 3 | 2015 |
| On the computational complexity of closest genome problems LFI Cunha, P Feijão, VF dos Santos, LAB Kowada, CMH de Figueiredo Discrete Applied Mathematics, 2019 | 2 | 2019 |
| Identifying Maximal Perfect Haplotype Blocks L Cunha, Y Diekmann, L Kowada, J Stoye Brazilian Symposium on Bioinformatics, 26-37, 2018 | 2 | 2018 |
| Bounds and complexity for the tessellation problem A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ... Mat. Contemp, 2017 | 2 | 2017 |
| The block-interchange and the breakpoint Closest Permutation problems are NP-Complete LFI Cunha, CMH dos Santos, VFS, Kowada, LAB, de Figueiredo Proceedings of the 18th Latin-Iberoamerican Conference on Operations …, 2016 | 2 | 2016 |
| Upper bounds and exact values on transposition distance of permutations LFI Cunha, LAB Kowada Matemática Contemporânea 39, 77-84, 0 | 2 | |
| Closure of genomic sets: applications of graph convexity to genome rearrangement problems L Cunha, F Protti Electronic Notes in Discrete Mathematics 69, 285-292, 2018 | 1 | 2018 |
| Tree t-spanners of a graph: minimizing maximum distances efficiently F Couto, L Cunha 12th Annual International Conference on Combinatorial Optimization and …, 2018 | 1 | 2018 |
| Sorting Separable Permutations by Restricted Multi-break Rearrangements LFI Cunha, LAB Kowada, CMH de Figueiredo Matemática Contemporânea 44, 1-10, 2015 | 1 | 2015 |
| Limites para Distância e Diâmetro em Rearranjo de Genomas por Transposições LFI Cunha Master dissertation, Programa de Engenharia de Sistemas e Computação–COPPE …, 2013 | 1 | 2013 |
| The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness A Abreu, L Cunha, C de Figueiredo, L Kowada, F Marquezino, D Posner, ... Theoretical Computer Science 801, 175-191, 2020 | | 2020 |
| Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs F Couto, LFI Cunha Electronic Notes in Theoretical Computer Science 346, 355-367, 2019 | | 2019 |
| The Tessellation Cover Number of Good Tessellable Graphs A Abreu, L Cunha, C de Figueiredo, L Kowada, F Marquezino, R Portugal, ... arXiv preprint arXiv:1908.10844, 2019 | | 2019 |
| Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems LFI Cunha, F Protti Journal of Computational Biology, 2019 | | 2019 |
| Determining optimum tree t-spanners for split graphs and cographs F Couto, L Cunha, D Ferraz VIII Latin American Workshop on Cliques in Graphs, 10, 2018 | | 2018 |
Luis Antonio Brasil KowadaUFFE-mail confirmado em ic.uff.br
