On (k, ℓ)-Graph Sandwich Problems. - Fernanda Couto; Luérbio Faria; Sulamita Klein; Fábio Protti; Loana Tito Nogueira (FAW-AAIM, 2013)

On specifying boundary conditions for the graph sandwich problem. - Fernanda Couto; Luérbio Faria; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (CTW, 2013)

Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems. - Fernanda Couto; Luérbio Faria; Sulamita Klein (J. Braz. Comput. Soc., 2014)

On the forbidden induced subgraph probe problem. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein (CTW, 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 (WG, 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)

Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently. - Fernanda Couto; Luís Felipe I. Cunha (COCOA, 2018)

On the forbidden induced subgraph probe and sandwich problems. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein (Discret. Appl. Math., 2018)

Chordal-(2, 1) graph sandwich problem with boundary conditions. - Fernanda Couto; Luérbio Faria; Sylvain Gravier; Sulamita Klein (Electron. Notes Discret. Math., 2018)

Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs. - Fernanda Couto; Luís Felipe I. Cunha (LAGOS, 2019)

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 (LATIN, 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)

Hardness and efficiency on minimizing maximum distances in spanning trees. - Fernanda Couto; Luís Felipe I. Cunha (Theor. Comput. Sci., 2020)

Hardness and efficiency on t-admissibility for graph operations. - Fernanda Couto; Luís Felipe I. Cunha (Discret. Appl. Math., 2021)

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)

Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes. - Fernanda Couto; Luís Felipe I. Cunha; Daniel Juventude; Leandro Santiago 003 (Inf. Process. Lett., 2022)

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)

Filling some gaps on the edge coloring problem of split graphs. - Fernanda Couto; Diego Amaro Ferraz; Sulamita Klein (CoRR, 2024)

New results on edge-coloring and total-coloring of split graphs. - Fernanda Couto; Diego Amaro Ferraz; Sulamita Klein (Discret. Appl. Math., 2025)

Structural characterizations of tree t-spanners for graphs with few P4's and (0, ℓ)-graphs. - Fernanda Couto; Luís Felipe I. Cunha; Diego Ferraz (RAIRO Oper. Res., 2025)

Minimizing distances between vertices and edges through tree t-spanners. - Fernanda Couto; Luís Cunha 001; Edmundo Pinto; Daniel Posner (Theor. Comput. Sci., 2025)