[1] Carla Negri Lintzmayer, Flávio Keidi Miyazawa, and Eduardo Candido Xavier. Online Circle and Sphere Packing. Theoretical Computer Science, 776:75--94, 2019. [ bib | DOI ]
[2] Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, and Zanoni Dias. Sorting Permutations by λ-Operations. Journal of Universal Computer Science, 25(2):98--121, 2019. [ bib | http ]
[3] Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva, and Orlando Lee. Berge's Conjecture and Aharoni--Hartman--Hoffman's Conjecture for Locally In-Semicomplete Digraphs. Graphs and Combinatorics, 35(4):921--931, 2019. [ bib | DOI ]
[4] Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, and Zanoni Dias. Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements. In The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 29--40. 2019. [ bib | DOI ]
[5] Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo Moura, and Eduardo Xavier. Quasilinear approximation scheme for Steiner Multi Cycle in the Euclidean plane. In The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 589--601. 2019. [ bib | DOI ]
[6] Carla Negri Lintzmayer, Guilherme Oliveira Mota, and Maycon Sambinelli. Decomposing Split Graphs into Locally Irregular Graphs. In The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 603--612. 2019. [ bib | DOI ]
[7] Márcia Cerioli, Cristina Gomes Fernandes, Orlando Lee, Carla Negri Lintzmayer, Guilherme Oliveira Mota, and Cândida Nunes Da Silva. On Edge-magic Labelings of Forests. In The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), volume 346 of Electronic Notes in Theoretical Computer Science, pages 299--307. 2019. [ bib | DOI ]
[8] Carla Negri Lintzmayer, Guillaume Fertin, and Zanoni Dias. Sorting permutations and binary strings by length-weighted rearrangements. Theoretical Computer Science, 715:35--59, 2018. [ bib | DOI ]
[9] Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, and Zanoni Dias. Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations. In Jesper Jansson, Carlos Martín-Vide, and Miguel A. Vega-Rodríguez, editors, Algorithms for Computational Biology, pages 53--64, Cham, 2018. Springer International Publishing. [ bib | DOI ]
[10] Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, and Zanoni Dias. Sorting Permutations by Limited-Size Operations. In Jesper Jansson, Carlos Martín-Vide, and Miguel A. Vega-Rodríguez, editors, Algorithms for Computational Biology, pages 76--87, Cham, 2018. Springer International Publishing. [ bib | DOI ]
[11] Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, and Zanoni Dias. Sorting λ-Permutations by λ-Operations. In Ronnie Alves, editor, Advances in Bioinformatics and Computational Biology, pages 1--13, Cham, 2018. Springer International Publishing. [ bib | DOI ]
[12] Kent E. Yucra Quispe, Carla N. Lintzmayer, and Eduardo C. Xavier. An exact algorithm for the Blocks Relocation Problem with new lower bounds. Computers & Operations Research, 99:206--217, 2018. [ bib | DOI ]
[13] Mário C. San Felice, Cristina G. Fernandes, and Carla N. Lintzmayer. The Online Multicommodity Connected Facility Location Problem. In Roberto Solis-Oba and Rudolf Fleischer, editors, Approximation and Online Algorithms, volume 10787 of Lecture Notes in Computer Science, pages 118--131. Springer International Publishing, 2018. [ bib | DOI ]
[14] Carla N. Lintzmayer, Flávio K. Miyazawa, and Eduardo C. Xavier. Two-Dimensional Knapsack for Circles. In Michael A. Bender, Martín Farach-Colton, and Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics, volume 10807 of Lecture Notes in Computer Science, pages 741--754. Springer International Publishing, 2018. [ bib | DOI ]
[15] Carla Negri Lintzmayer, Flávio Keidi Miyazawa, and Eduardo Candido Xavier. Online Circle and Sphere Packing. Encontro de Teoria da Computação (ETC CSBC), 3(1/2018), 2018. [ bib | http ]
[16] M. Sambinelli, C. N. Lintzmayer, C. N. da Silva, and O. Lee. Vertex partition problems in digraphs. Encontro de Teoria da Computação (ETC CSBC), 3(1/2018), 2018. [ bib | http ]
[17] Carla Negri Lintzmayer, Guillaume Fertin, and Zanoni Dias. Sorting Permutations by Prefix and Suffix Rearrangements. Journal of Bioinformatics and Computational Biology, 15(1):1750002, 2017. [ bib | DOI ]
[18] Carla Negri Lintzmayer. The Problem of Sorting Permutations by Prefix and Suffix Rearrangements. PhD thesis, University of Campinas, Institute of Computing, 2016. In English. [ bib | .pdf ]
[19] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation. Inteligencia Artificial, 18(55):81--111, 2015. [ bib | DOI ]
[20] Carla N. Lintzmayer, Guillaume Fertin, and Zanoni Dias. Approximation Algorithms for Sorting by Length-Weighted Prefix and Suffix Operations. Theoretical Computer Science, 593:26--41, 2015. [ bib | DOI ]
[21] Carla N. Lintzmayer and Zanoni Dias. Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions. In A. Pardo and A. Viola, editors, LATIN 2014: Theoretical Informatics, volume 8392 of Lecture Notes in Computer Science, pages 671--682. Springer Berlin Heidelberg, Heidelberg, Germany, 2014. [ bib | DOI ]
[22] Carla N. Lintzmayer and Zanoni Dias. On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Algorithms for Computational Biology, volume 8542 of Lecture Notes in Computer Science, pages 146--157. Springer International Publishing, Switzerland, 2014. [ bib | DOI ]
[23] Carla N. Lintzmayer and Zanoni Dias. On the Diameter of Rearrangement Problems. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Algorithms for Computational Biology, volume 8542 of Lecture Notes in Computer Science, pages 158--170. Springer International Publishing, Switzerland, 2014. [ bib | DOI ]
[24] Ulisses Dias, Gustavo R. Galvão, Carla N. Lintzmayer, and Zanoni Dias. A General Heuristic for Genome Rearrangement Problems. Journal of Bioinformatics and Computational Biology, 12(3):26, 2014. [ bib | DOI ]
[25] Anderson Faustino da Silva, Mauro Henrique Mulati, and Carla Negri Lintzmayer. Os Novos Algoritmos da Classe ColorAnt-RT: Uma Classe de Algoritmos para a Resolução do PCG. In Anais do XLV Simpósio Brasileiro de Pesquisa Operacional (SBPO'2013), 2013. [ bib ]
[26] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. Uma Solução para o Problema de Alocação de Registradores baseada em Meta-heurísticas. In Heitor Silvério Lopes, Luiz Carlos de Abreu Rodrigues, and Maria Teresinha Arns Steiner, editors, Meta-Heurísticas em Pesquisa Operacional, chapter 28, pages 445--458. Omnipax, Curitiba, Paraná, Brasil, 1 edition, 2013. [ bib ]
[27] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. O Impacto da Parametrização no Algoritmo Heurístico Baseado em Colônia de Formigas Artificiais ColorAnt3-RT. Learning & Nonlinear Models, 11(2):74--91, 2013. [ bib ]
[28] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. PColorAnt3-RT: Um Algoritmo ACO Paralelo para Coloração de Grafos. Revista de Informática Teórica e Aplicada, 20(1):65--86, 2013. [ bib ]
[29] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. Register Allocation by Evolutionary Algorithm. In Proceedings of the 31st International Conference of the Chilean Computer Science Society (SCCC'2012), pages 207--215, 2012. [ bib ]
[30] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. ColorAnt-RT: Algoritmo de Coloração de Grafo que utiliza Colônia de Formigas aplicado a Alocação de Registradores. Revista de Iniciação Científica, 12(3), 2012. [ bib ]
[31] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. RT-COLORANT: Um Algoritmo Heurístico Baseado em Colônia de Formigas Artificiais com Busca Local para Colorir Grafos. In Anais do XLIII Simpósio Brasileiro de Pesquisa Operacional (SBPO'2011), 2011. [ bib ]
[32] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. Algoritmo Heurístico Baseado em Colônia de Formigas Artificiais Colorant2 com Busca Local Aplicado ao Problema de Coloração de Grafo. In G. de A. Barreto and J. A. F. Costa, editors, Anais do X Congresso Brasileiro de Inteligência Computacional, pages 1--8. Sociedade Brasileira de Inteligência Computacional, 2011. [ bib ]
[33] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. Register Allocation with Graph Coloring by Ant Colony Optimization. In Proceedings of the 30th International Conference of the Chilean Computer Science Society (SCCC'2011), pages 247--255, 2011. [ bib ]
[34] Carla Negri Lintzmayer, Mauro Henrique Mulati, and Anderson Faustino da Silva. Toward Better Performance of ColorAnt ACO Algorithm. In Proceedings of the 30th International Conference of the Chilean Computer Science Society (SCCC'2011), pages 256--264, 2011. [ bib ]

This file was generated by bibtex2html 1.98.