Carla Negri Lintzmayer

Orcid: 0000-0003-0602-6298

According to our database1, Carla Negri Lintzmayer authored at least 36 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximations for the Steiner Multicycle problem.
Theor. Comput. Sci., 2024

Biclique immersions in graphs with independence number 2.
Eur. J. Comb., 2024

A faster heuristic for the Traveling Salesman Problem with Drone.
CoRR, 2024

2023
How heavy independent sets help to find arborescences with many leaves in DAGs.
J. Comput. Syst. Sci., August, 2023

Boundedness for proper conflict-free and odd colorings.
CoRR, 2023

2022
Leafy spanning k-forests.
J. Comb. Optim., 2022

Leafy spanning arborescences in DAGs.
Discret. Appl. Math., 2022

2021
Length-weighted λ-rearrangement distance.
J. Comb. Optim., 2021

Decomposing split graphs into locally irregular graphs.
Discret. Appl. Math., 2021

Approximation Algorithms for Sorting λ-Permutations by λ-Operations.
Algorithms, 2021

2020
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane.
Theor. Comput. Sci., 2020

Sorting permutations by fragmentation-weighted operations.
J. Bioinform. Comput. Biol., 2020

2019
Online circle and sphere packing.
Theor. Comput. Sci., 2019

Sorting Permutations by λ-Operations.
J. Univers. Comput. Sci., 2019

Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs.
Graphs Comb., 2019

Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Edge-magic Labelings of Forests.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Sorting permutations and binary strings by length-weighted rearrangements.
Theor. Comput. Sci., 2018

An exact algorithm for the Blocks Relocation Problem with new lower bounds.
Comput. Oper. Res., 2018

Sorting λ-Permutations by λ-Operations.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

Two-Dimensional Knapsack for Circles.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Sorting Permutations by Limited-Size Operations.
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations.
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

2017
Sorting permutations by prefix and suffix rearrangements.
J. Bioinform. Comput. Biol., 2017

The Online Multicommodity Connected Facility Location Problem.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

2015
Approximation algorithms for sorting by length-weighted prefix and suffix operations.
Theor. Comput. Sci., 2015

The Hybrid ColorAnt-RT Algorithms and an Application to Register Allocation.
Inteligencia Artif., 2015

2014
A general heuristic for genome rearrangement problems.
J. Bioinform. Comput. Biol., 2014

Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

On the Diameter of Rearrangement Problems.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions.
Proceedings of the Algorithms for Computational Biology - First International Conference, 2014

2013
PColorAnt3-RT: Um Algoritmo ACO Paralelo para Coloração de Grafos.
RITA, 2013

2012
Register Allocation by Evolutionary Algorithm.
Proceedings of the 31st International Conference of the Chilean Computer Science Society, 2012

2011
Toward Better Performance of ColorAnt ACO Algorithm.
Proceedings of the 30th International Conference of the Chilean Computer Science Society, 2011

Register Allocation with Graph Coloring by Ant Colony Optimization.
Proceedings of the 30th International Conference of the Chilean Computer Science Society, 2011


  Loading...