Seguir
Luís Felipe Ignácio Cunha
Título
Citado por
Citado por
Ano
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
122020
Identifying maximal perfect haplotype blocks
L Cunha, Y Diekmann, L Kowada, J Stoye
Brazilian Symposium on Bioinformatics, 26-37, 2018
82018
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
82013
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time
LFI Cunha, LAB Kowada, R A Hausen, CMH de Figueiredo
Brazilian Symposium on Bioinformatics, 126-135, 2013
62013
Tree t-spanners of a graph: minimizing maximum distances efficiently
F Couto, L Cunha
12th Annual International Conference on Combinatorial Optimization and …, 2018
52018
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
52017
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
52015
A faster 1.375-approximation algorithm for sorting by transpositions
LFI Cunha, LAB Kowada, R A Hausen, CMH de Figueiredo
International Workshop on Algorithms in Bioinformatics, 26-37, 2014
52014
Transposition diameter and lonely permutations
LFI Cunha, LAB Kowada, R A Hausen, CMH de Figueiredo
Brazilian Symposium on Bioinformatics, 1-12, 2012
5*2012
Kowada, LAB, de A. Hausen, R., and de Figueiredo, CMH (2013a). Advancing the transposition distance and diameter through lonely permutations
LFI Cunha
SIAM J. Discrete Math 27, 1682-1709, 0
5
On the computational complexity of closest genome problems
LFI Cunha, P Feijão, VF dos Santos, LAB Kowada, CMH de Figueiredo
Discrete Applied Mathematics 274, 26-34, 2020
42020
Edge tree spanners
F Couto, L Cunha, D Posner
Graphs and Combinatorial Optimization: from Theory to Applications, 195-207, 2021
32021
Hardness and efficiency on minimizing maximum distances in spanning trees
F Couto, LFI Cunha
Theoretical Computer Science 838, 168-179, 2020
32020
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
32019
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
22016
Upper bounds and exact values on transposition distance of permutations
LFI Cunha, LAB Kowada
Matemática Contemporânea 39, 77-84, 0
2
A computational complexity comparative study of graph tessellation problems
A Abreu, L Cunha, C de Figueiredo, L Kowada, F Marquezino, R Portugal, ...
Theoretical Computer Science 858, 81-89, 2021
12021
Total tessellation cover and quantum walk
A Abreu, L Cunha, C de Figueiredo, F Marquezino, D Posner, R Portugal
arXiv preprint arXiv:2002.08992, 2020
12020
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
12018
The tessellation problem of quantum walks
A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ...
arXiv preprint arXiv:1705.09014, 2017
12017
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20