Send your message by email

Advanced search

Ministério da Educação (Brasil). Universidade Federal do ABC (UFABC). Centro de Matemática, Computação e Cognição (CMCC)
(Institutional affiliation for the last research proposal)

Birthplace:
Brazil

Bachelor's degree in Computer Science from Universidade Estadual de Maringá, Brazil (2011), doctor's degree in Computer Sciences from Universidade Estadual de Campinas, Brazil (2016), and postdoc in Computer Science at Universidade Estadual de Campinas, Brazil (2017). She is current an adjunct professor at Universidade Federal do ABC, Brazil. Her research interests concentrate in Theoretical computer science, with emphasis in design and analysis of algorithms, combinatorial optimization, and graph theory. (Source: Lattes Curriculum)

Scholarships in Brazil

- Approximation algorithms, BP.IC
### Abstract

In a combinatorial optimization problem the objective is to find a solution of minimum or maximum cost among all possible solutions. Normally, these kind of problems are NP-hard, so there is no hope in finding an algorithm that solves the problems in polynomial time. An approximation algorithm is an algorithm that runs in polynomial time and returns a solution whose cost is at most a fa...

- One and two-dimensional bin packing with conflicts and unloading restrictions, BP.PD
### Abstract

This project aims to study and develop algorithms for packing problems. A classic example is the bin packing problem, for which the input is a list of items (each one with a size) and we want to pack them in the smallest number of bins (where the bins have a maximum size). Several of the simplest variations of packing problems belong to the class of NP-hard problems. In this project, we...

- The sorting permutations problem using prefix and suffix operations, BP.DD
### Abstract

Reversals and transpositions are the most common kind of genome rearrangements, which are operations that affect large fragments of genomes. With rearrangements is possible to establish the divergence between individuals along evolution. The minimum distance between two certain genomes is assumed as being the evolutionary distance between them and it can be calculated by using scenarios...

Scholarships abroad

- Sorting permutations by prefix reversals and suffix reversals, BE.EP.DD
### Abstract

One way of comparing two genomes is to compute a distance between them. One approach to do this is finding the minimum number of large scale mutations, the genome rearrangements, that occurred to transform one genome into the other. When we represent the genomes as permutations, the goal is to sort a given permutation with the minimum number of rearrangements. Reversals and transpositio...

1 /
1
| Ongoing scholarships in Brazil |

2 /
2
| Completed scholarships in Brazil |

1 /
1
| Completed scholarships abroad |

4 /
4
| All Scholarships |

Associated processes |

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications | 8 |

Citations | 11 |

Cit./Article | 1.4 |

Data from Web of Science |

DIAS, ULISSES; GALVAO, GUSTAVO RODRIGUES; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. A general heuristic for genome rearrangement problems.** JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY**, v. 12, n. 3, JUN 2014. Web of Science Citations: 2. (12/01584-3, 13/01172-0)

SANTOS MIRANDA, GUILHERME HENRIQUE; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Sorting Permutations by lambda-Operations.** JOURNAL OF UNIVERSAL COMPUTER SCIENCE**, v. 25, n. 2, p. 98-121, 2019. Web of Science Citations: 0. (17/12646-3, 13/08293-7, 15/11937-9, 16/14132-4)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations by prefix and suffix rearrangements.** JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY**, v. 15, n. 1, FEB 2017. Web of Science Citations: 3. (14/19401-8, 13/01172-0, 13/08293-7, 15/11937-9, 14/20738-7, 16/14132-4)

YUCRA QUISPE, KENT E.; LINTZMAYER, CARLA N.; XAVIER, EDUARDO C.. An exact algorithm for the Blocks Relocation Problem with new lower bounds.** Computers & Operations Research**, v. 99, p. 206-217, NOV 2018. Web of Science Citations: 4. (16/23552-7, 15/11937-9, 16/14132-4)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations and binary strings by length-weighted rearrangements.** THEORETICAL COMPUTER SCIENCE**, v. 715, p. 35-59, MAR 8 2018. Web of Science Citations: 0. (14/20738-7, 14/19401-8, 13/01172-0, 15/11937-9, 13/08293-7)

LINTZMAYER, CARLA NEGRI; MIYAZAWA, FLAVIO KEIDI; XAVIER, EDUARDO CANDIDO. Online circle and sphere packing.** THEORETICAL COMPUTER SCIENCE**, v. 776, p. 75-94, JUL 12 2019. Web of Science Citations: 0. (16/23552-7, 16/14132-4, 15/11937-9, 16/01860-1)

SAMBINELLI, MAYCON; LINTZMAYER, CARLA NEGRI; DA SILVA, CANDIDA NUNES; LEE, ORLANDO. Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs.** GRAPHS AND COMBINATORICS**, v. 35, n. 4, p. 921-931, JUL 2019. Web of Science Citations: 0. (16/14132-4, 15/11937-9)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Approximation algorithms for sorting by length-weighted prefix and suffix operations.** THEORETICAL COMPUTER SCIENCE**, v. 593, p. 26-41, AUG 16 2015. Web of Science Citations: 2. (14/20738-7, 14/19401-8, 13/01172-0, 13/08293-7)

(References retrieved automatically from State of São Paulo Research Institutions)

LINTZMAYER, Carla Negri. The problem of sorting permutations by prefix and suffix rearrangements = O problema da ordenação de permutações usando rearranjos de prefixos e sufixos. 2016. Tese (Doutorado) – Universidade Estadual de Campinas, Instituto de Computação.

Please report errors in researcher information by writing to:
cdi@fapesp.br.