CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Federal do ABC (UFABC). Centro de Matemática, Computação e Cognição (CMCC) (Institutional affiliation from 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. She is currently vice-coordinator of the Special Committee on Algorithms, Combinatorics and Optimization (CEACO) of the Brazilian Computing Society. She received the L'Oréal Prize for Women in Science in 2023, in the field of Mathematics. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
When dealing with computational problems, we always try to find efficient algorithms that solve them, for all possible instances. The concept of efficiency of an algorithm usually refers to its time complexity being polynomial on the input size. However, there are many relevant problems for which there is no hope that we will find efficient algorithms that find optimal solutions for all i…
A problem is of combinatorial optimization if it has as objective finding solutions on a domain that minimize or maximize a goal function. These characteristics are inherent to several important problems in the real world that come from different areas. Unfortunately, many combinatorial optimization problems are NP-hard, which leaves us with almost no hope to find efficient algorithms to …
In Problems of Transforming Strings (or Sorting Permutations) by Rearrangement Operations, given two sequences of symbols - where each symbol appears the same number of times in each sequence - and a set of allowed rearrangement operations, one wants to find a sequence of lowest cost containing rearrangement operations that transforms one symbol sequence into the other.The cost of this op…
(Only some records are available in English at this moment)
This is a research project to be executed at Charles University, under the supervision of Prof. Martin Loebl. Our main goal is to study some problems that involve the notion of submodularity, both from an algorithmic and a structural point of view. Submodularity appears in many valuation functions and, informally, it models contexts where adding more of something gives you less extra bene…
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 transpositions…
| 6 / 6 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 1 / 1 | Completed scholarships abroad |
| 8 / 8 | All Scholarships |
| Associated processes | |