Luís Cunha

Jack Kuipers

Thiago Lopes

CoRR, January, 2025

Minimizing distances between vertices and edges through tree t-spanners.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

Structural characterizations of tree t-spanners for graphs with few P4's and (0, ℓ)-graphs.

[BibT_eX]

[DOI]

Diego Ferraz

RAIRO Oper. Res., 2025

Induced tree covering and the generalized Yutsis property.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2025

Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

On the parameterized complexity of the median and closest problems under some permutation metrics.

[BibT_eX]

[DOI]

Ignasi Sau

Uéverton S. Souza

Algorithms Mol. Biol., December, 2024

New parallelism and heuristic approaches for generating tree t -spanners in graphs.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., July, 2024

Graph admissibility: Case generation and analysis by learning models.

[BibT_eX]

[DOI]

Leandro Santiago

Felipe Silva Souza

J. Comput. Sci., 2024

Closing the complexity gap of the double distance problem.

[BibT_eX]

[DOI]

CoRR, 2024

Complexity and algorithms for Swap median and relation to other consensus problems.

[BibT_eX]

[DOI]

Thiago Lopes

Arnaud Mary

CoRR, 2024

On the Complexity of the Median and Closest Permutation Problems.

[BibT_eX]

[DOI]

Ignasi Sau

Uéverton S. Souza

Proceedings of the 24th International Workshop on Algorithms in Bioinformatics, 2024

Algorithmic Construction of Tessellation Cover to QUBO Formulations.

[BibT_eX]

[DOI]

Matheus Romaneli

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2022

Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Total tessellation cover: Bounds, hardness, and applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs.

[BibT_eX]

[DOI]

Diego Ferraz

CoRR, 2022

2021

A computational complexity comparative study of graph tessellation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Hardness and efficiency on t-admissibility for graph operations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Hardness and efficiency on minimizing maximum distances in spanning trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the computational complexity of closest genome problems.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Pedro Feijão

Discret. Appl. Math., 2020

Total tessellation cover and quantum walk.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.

[BibT_eX]

[DOI]

Fábio Protti

J. Comput. Biol., 2019

Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The Tessellation Cover Number of Good Tessellable Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Closure of genomic sets: applications of graph convexity to genome rearrangement problems.

[BibT_eX]

[DOI]

Fábio Protti

Electron. Notes Discret. Math., 2018

Identifying Maximal Perfect Haplotype Blocks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.

[BibT_eX]

[DOI]

Tharso D. Fernandes

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Rearranjo de genomas: algoritmos e complexidade

[BibT_eX]

[DOI]

PhD thesis, 2017

Fast and Simple Jumbled Indexing for Binary RLE Strings.

[BibT_eX]

[DOI]

CoRR, 2017

The tessellation problem of quantum walks.

[BibT_eX]

[DOI]

Tharso D. Fernandes

CoRR, 2017

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2015

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.

[BibT_eX]

[DOI]

J. Comput. Biol., 2015

Sorting Separable Permutations by Restricted Multi-break Rearrangements.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

Advancing the Transposition Distance and Diameter through Lonely Permutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2013

2012

Transposition Diameter and Lonely Permutations.

[BibT_eX]

[DOI]