Fernanda Couto

According to our database, Fernanda Couto authored at least 19 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

New results on edge-coloring and total-coloring of split graphs.

Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein

Discret. Appl. Math., 2025

2024

Minimizing Distances Between Vertices and Edges Through Tree t-Spanners.

Fernanda Couto, Luís Felipe I. Cunha, Edmundo Pinto, Daniel Posner

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

Partitions and well-coveredness: The graph sandwich problem.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Discret. Math., 2023

2022

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

Fernanda Couto, Luís Felipe I. Cunha, Daniel Juventude, Leandro Santiago

Inf. Process. Lett., 2022

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

Fernanda Couto, Luís Felipe I. Cunha, Diego Ferraz

CoRR, 2022

2021

Hardness and efficiency on t-admissibility for graph operations.

Fernanda Couto, Luís Felipe I. Cunha

Discret. Appl. Math., 2021

2020

Hardness and efficiency on minimizing maximum distances in spanning trees.

Fernanda Couto, Luís Felipe I. Cunha

Theor. Comput. Sci., 2020

Characterizations, probe and sandwich problems on (k, ℓ)-cographs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Discret. Appl. Math., 2020

Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.

Sancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few <i>P</i>₄'s and (<i>k</i>, <i>ℓ</i>)-graphs.

Fernanda Couto, Luís Felipe I. Cunha

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

2018

Chordal-(2, 1) graph sandwich problem with boundary conditions.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Electron. Notes Discret. Math., 2018

On the forbidden induced subgraph probe and sandwich problems.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

Discret. Appl. Math., 2018

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

Fernanda Couto, Luís Felipe I. Cunha

Proceedings of the Combinatorial Optimization and Applications, 2018

2015

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Electron. Notes Discret. Math., 2015

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the forbidden induced subgraph probe problem.

Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein

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

2014

Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems.

Fernanda Couto, Luérbio Faria, Sulamita Klein

J. Braz. Comput. Soc., 2014

2013

On specifying boundary conditions for the graph sandwich problem.

Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

On (<i>k</i>, ℓ)-Graph Sandwich Problems.

Fernanda Couto, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013