Segui
Luís Felipe Ignácio Cunha
Titolo
Citata da
Citata da
Anno
Hardness and efficiency on minimizing maximum distances in spanning trees
F Couto, LFI Cunha
Theoretical Computer Science 838, 168-179, 2020
142020
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
122015
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ...
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018
112018
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
112013
Identifying maximal perfect haplotype blocks
L Cunha, Y Diekmann, L Kowada, J Stoye
Brazilian Symposium on Bioinformatics, 26-37, 2018
102018
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
92019
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
82020
Tree t-spanners of a graph: minimizing maximum distances efficiently
F Couto, L Cunha
12th Annual International Conference on Combinatorial Optimization and …, 2018
82018
Hardness and efficiency on t-admissibility for graph operations
F Couto, LFI Cunha
Discrete Applied Mathematics 304, 342-348, 2021
72021
Edge tree spanners
F Couto, L Cunha, D Posner
Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021
72021
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
72017
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes
F Couto, LFI Cunha, D Juventude, L Santiago
Information Processing Letters 177, 106265, 2022
62022
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
62020
Genome rearrangements on multigenomic models: applications of graph convexity problems
LFI Cunha, F Protti
Journal of Computational Biology 26 (11), 1214-1222, 2019
62019
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time
LFI Cunha, LAB Kowada, R de A. Hausen, CMH de Figueiredo
Advances in Bioinformatics and Computational Biology: 8th Brazilian …, 2013
62013
A faster 1.375-approximation algorithm for sorting by transpositions
LFI Cunha, LAB Kowada, R de A. Hausen, CMH de Figueiredo
Algorithms in Bioinformatics: 14th International Workshop, WABI 2014 …, 2014
52014
Transposition diameter and lonely permutations
LFI Cunha, LAB Kowada, R de A. Hausen, CMH de Figueiredo
Brazilian Symposium on Bioinformatics, 1-12, 2012
52012
New parallelism and heuristic approaches for generating tree t‐spanners in graphs
L Cunha, E Marciano, A Moraes, L Santiago, C Santos
Concurrency and Computation: Practice and Experience, e8106, 2024
42024
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
42018
Bounds and complexity for the tessellation problem
A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ...
Mat. Contemp 45, 22-30, 2017
42017
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20