An exact algorithm for the blocks relocation problem with new lower bounds KEY Quispe, CN Lintzmayer, EC Xavier
Computers & Operations Research 99, 206-217, 2018
32 2018 A general heuristic for genome rearrangement problems U Dias, GR Galvão, CN Lintzmayer, Z Dias
Journal of Bioinformatics and Computational Biology 12 (03), 1450012, 2014
18 2014 Register allocation with graph coloring by ant colony optimization CN Lintzmayer, MH Mulati, AF da Silva
2011 30th International Conference of the Chilean Computer Science Society …, 2011
16 2011 Sorting permutations by prefix and suffix versions of reversals and transpositions CN Lintzmayer, Z Dias
Latin American Symposium on Theoretical Informatics, 671-682, 2014
13 2014 Rt-colorant: Um algoritmo heurıstico baseado em colônia de formigas artificiais com busca local para colorir grafos CN Lintzmayer, MH Mulati, AF da Silva
XLIII SBPO-Simpósio Brasileiro de Pesquisa Operacional 2011, 2011
10 2011 Decomposing split graphs into locally irregular graphs CN Lintzmayer, GO Mota, M Sambinelli
Discrete Applied Mathematics 292, 33-44, 2021
9 2021 Sorting permutations by prefix and suffix rearrangements CN Lintzmayer, G Fertin, Z Dias
Journal of bioinformatics and computational biology 15 (01), 1750002, 2017
9 2017 Online circle and sphere packing CN Lintzmayer, FK Miyazawa, EC Xavier
Theoretical Computer Science 776, 75-94, 2019
8 2019 Approximation algorithms for sorting by length-weighted prefix and suffix operations CN Lintzmayer, G Fertin, Z Dias
Theoretical Computer Science 593, 26-41, 2015
8 2015 Toward better performance of ColorAnt ACO algorithm CN Lintzmayer, MH Mulati, AF da Silva
2011 30th International Conference of the Chilean Computer Science Society …, 2011
8 2011 On the diameter of rearrangement problems CN Lintzmayer, Z Dias
Algorithms for Computational Biology: First International Conference, AlCoB …, 2014
7 2014 On sorting of signed permutations by prefix and suffix reversals and transpositions CN Lintzmayer, Z Dias
Algorithms for Computational Biology: First International Conference, AlCoB …, 2014
7 2014 Algoritmo Heurstico Baseado em Colonia de Formigas Artificiais ColorAnt2 com Busca Local Aplicado ao Problema de Coloração de Grafo CN Lintzmayer, MH Mulati, AF da Silva
X Congresso Brasileiro de Inteligência Computacional, 2011
7 2011 Two-dimensional knapsack for circles CN Lintzmayer, FK Miyazawa, EC Xavier
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018
6 2018 Leafy spanning arborescences in DAGs CG Fernandes, CN Lintzmayer
Discrete Applied Mathematics 323, 217-227, 2022
5 2022 Sorting permutations by fragmentation-weighted operations AO Alexandrino, CN Lintzmayer, Z Dias
Journal of Bioinformatics and Computational Biology 18 (02), 2050006, 2020
5 2020 Approximation algorithms for sorting permutations by length-weighted short rearrangements AO Alexandrino, GHS Miranda, CN Lintzmayer, Z Dias
Electronic Notes in Theoretical Computer Science 346, 29-40, 2019
5 2019 Decomposing split graphs into locally irregular graphs CN Lintzmayer, GO Mota, M Sambinelli
Electronic Notes in Theoretical Computer Science 346, 603-612, 2019
5 2019 Sorting permutations by limited-size operations GHS Miranda, CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 76-87, 2018
5 2018 Length-weighted -rearrangement distance AO Alexandrino, GHS Miranda, CN Lintzmayer, Z Dias
Journal of Combinatorial Optimization 41 (3), 579-602, 2021
4 2021