Follow
Carla Negri Lintzmayer
Carla Negri Lintzmayer
Verified email at ufabc.edu.br - Homepage
Title
Cited by
Cited by
Year
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
192018
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
142014
Sorting permutations by prefix and suffix versions of reversals and transpositions
CN Lintzmayer, Z Dias
Latin American Symposium on Theoretical Informatics, 671-682, 2014
142014
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
122011
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
102011
Sorting permutations by prefix and suffix rearrangements
CN Lintzmayer, G Fertin, Z Dias
Journal of Bioinformatics and Computational Biology 15 (01), 1750002, 2017
82017
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
82011
Approximation algorithms for sorting by length-weighted prefix and suffix operations
CN Lintzmayer, G Fertin, Z Dias
Theoretical Computer Science 593, 26-41, 2015
72015
On the diameter of rearrangement problems
CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 158-170, 2014
72014
On sorting of signed permutations by prefix and suffix reversals and transpositions
CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 146-157, 2014
72014
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
72011
Online circle and sphere packing
CN Lintzmayer, FK Miyazawa, EC Xavier
Theoretical Computer Science 776, 75-94, 2019
52019
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
42019
Decomposing split graphs into locally irregular graphs
CN Lintzmayer, GO Mota, M Sambinelli
Electronic Notes in Theoretical Computer Science 346, 603-612, 2019
42019
Sorting permutations by limited-size operations
GHS Miranda, CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 76-87, 2018
42018
Two-dimensional knapsack for circles
CN Lintzmayer, FK Miyazawa, EC Xavier
Latin American Symposium on Theoretical Informatics, 741-754, 2018
42018
Sorting permutations by fragmentation-weighted operations
AO Alexandrino, CN Lintzmayer, Z Dias
Journal of Bioinformatics and Computational Biology 18 (02), 2050006, 2020
32020
Approximation algorithms for sorting permutations by fragmentation-weighted operations
AO Alexandrino, CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 53-64, 2018
32018
Register allocation by evolutionary algorithm
CN Lintzmayer, MH Mulati, AF da Silva
2012 31st International Conference of the Chilean Computer Science Society …, 2012
32012
Leafy spanning arborescences in DAGs
CG Fernandes, CN Lintzmayer
Discrete Applied Mathematics, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20