default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarla Negri Lintzmayer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Fábio Botler, Andrea Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel Quiroz, Maycon Sambinelli:
Biclique immersions in graphs with independence number 2. Eur. J. Comb. 122: 104042 (2024)- [j19]Cristina G. Fernandes, Carla Negri Lintzmayer
, Phablo F. S. Moura:
Approximations for the Steiner Multicycle problem. Theor. Comput. Sci. 1020: 114836 (2024) - [i7]Pedro Henrique Del Bianco Hokama, Carla Negri Lintzmayer, Mário César San Felice:
A faster heuristic for the Traveling Salesman Problem with Drone. CoRR abs/2405.18566 (2024) - 2023
- [j18]Cristina G. Fernandes, Carla Negri Lintzmayer:
How heavy independent sets help to find arborescences with many leaves in DAGs. J. Comput. Syst. Sci. 135: 158-174 (2023) - [i6]Fábio Botler, Andrea Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel A. Quiroz, Maycon Sambinelli:
Biclique immersions in graphs with independence number 2. CoRR abs/2303.06483 (2023) - [i5]Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer, Martín Matamala, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Yoshiko Wakabayashi, Weiqiang Yu, José Zamora:
Boundedness for proper conflict-free and odd colorings. CoRR abs/2308.00170 (2023) - [i4]Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura:
Approximations for the Steiner Multicycle Problem. CoRR abs/2308.07471 (2023) - 2022
- [j17]Cristina G. Fernandes, Carla Negri Lintzmayer:
Leafy spanning arborescences in DAGs. Discret. Appl. Math. 323: 217-227 (2022) - [j16]Cristina G. Fernandes, Carla Negri Lintzmayer, Mário César San Felice:
Leafy spanning k-forests. J. Comb. Optim. 44(2): 934-946 (2022) - [c17]Cristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura:
Approximations for the Steiner Multicycle Problem. LATIN 2022: 188-203 - 2021
- [j15]Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias:
Approximation Algorithms for Sorting λ-Permutations by λ-Operations. Algorithms 14(6): 175 (2021) - [j14]Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli:
Decomposing split graphs into locally irregular graphs. Discret. Appl. Math. 292: 33-44 (2021) - [j13]Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias:
Length-weighted λ-rearrangement distance. J. Comb. Optim. 41(3): 579-602 (2021) - [i3]Cristina G. Fernandes, Carla Negri Lintzmayer:
How heavy independent sets help to find arborescences with many leaves in DAGs. CoRR abs/2111.13464 (2021) - 2020
- [j12]Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias:
Sorting permutations by fragmentation-weighted operations. J. Bioinform. Comput. Biol. 18(2): 2050006:1-2050006:31 (2020) - [j11]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier:
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. Theor. Comput. Sci. 835: 134-155 (2020) - [c16]Cristina G. Fernandes, Carla Negri Lintzmayer:
Leafy Spanning Arborescences in DAGs. LATIN 2020: 50-62 - [i2]Cristina G. Fernandes, Carla Negri Lintzmayer:
Leafy Spanning Arborescences in DAGs. CoRR abs/2007.07660 (2020)
2010 – 2019
- 2019
- [j10]Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva, Orlando Lee:
Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs. Graphs Comb. 35(4): 921-931 (2019) - [j9]Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias:
Sorting Permutations by λ-Operations. J. Univers. Comput. Sci. 25(2): 98-121 (2019) - [j8]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Online circle and sphere packing. Theor. Comput. Sci. 776: 75-94 (2019) - [c15]Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias:
Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements. LAGOS 2019: 29-40 - [c14]Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee, Carla Negri Lintzmayer, Guilherme Oliveira Mota, Cândida Nunes da Silva:
On Edge-magic Labelings of Forests. LAGOS 2019: 299-307 - [c13]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier:
Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane. LAGOS 2019: 589-601 - [c12]Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli:
Decomposing Split Graphs into Locally Irregular Graphs. LAGOS 2019: 603-612 - 2018
- [j7]Kent E. Yucra Quispe, Carla Negri Lintzmayer, Eduardo C. Xavier:
An exact algorithm for the Blocks Relocation Problem with new lower bounds. Comput. Oper. Res. 99: 206-217 (2018) - [j6]Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Sorting permutations and binary strings by length-weighted rearrangements. Theor. Comput. Sci. 715: 35-59 (2018) - [c11]Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias:
Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations. AlCoB 2018: 53-64 - [c10]Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias:
Sorting Permutations by Limited-Size Operations. AlCoB 2018: 76-87 - [c9]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Two-Dimensional Knapsack for Circles. LATIN 2018: 741-754 - [c8]Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias:
Sorting λ-Permutations by λ-Operations. BSB 2018: 1-13 - 2017
- [j5]Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Sorting permutations by prefix and suffix rearrangements. J. Bioinform. Comput. Biol. 15(1): 1750002:1-1750002:46 (2017) - [c7]Mário César San Felice, Cristina G. Fernandes, Carla Negri Lintzmayer:
The Online Multicommodity Connected Facility Location Problem. WAOA 2017: 118-131 - [i1]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Online Circle and Sphere Packing. CoRR abs/1708.08906 (2017) - 2015
- [j4]Mauro Henrique Mulati, Carla Negri Lintzmayer, Anderson Faustino da Silva:
The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation. Inteligencia Artif. 18(55): 81-111 (2015) - [j3]Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias:
Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theor. Comput. Sci. 593: 26-41 (2015) - 2014
- [j2]Ulisses Dias, Gustavo Rodrigues Galvão, Carla Negri Lintzmayer, Zanoni Dias:
A general heuristic for genome rearrangement problems. J. Bioinform. Comput. Biol. 12(3) (2014) - [c6]Carla Negri Lintzmayer, Zanoni Dias:
On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions. AlCoB 2014: 146-157 - [c5]Carla Negri Lintzmayer, Zanoni Dias:
On the Diameter of Rearrangement Problems. AlCoB 2014: 158-170 - [c4]Carla Negri Lintzmayer, Zanoni Dias:
Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions. LATIN 2014: 671-682 - 2013
- [j1]Carla Negri Lintzmayer, Mauro Henrique Mulati, Anderson Faustino da Silva:
PColorAnt3-RT: Um Algoritmo ACO Paralelo para Coloração de Grafos. RITA 20(1): 65-86 (2013) - 2012
- [c3]Carla Negri Lintzmayer, Mauro Henrique Mulati, Anderson Faustino da Silva:
Register Allocation by Evolutionary Algorithm. SCCC 2012: 207-215 - 2011
- [c2]Carla Negri Lintzmayer, Mauro Henrique Mulati, Anderson Faustino da Silva:
Register Allocation with Graph Coloring by Ant Colony Optimization. SCCC 2011: 247-255 - [c1]Carla Negri Lintzmayer, Mauro Henrique Mulati, Anderson Faustino da Silva:
Toward Better Performance of ColorAnt ACO Algorithm. SCCC 2011: 256-264
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
