E-LIB Suche - Ergebnisse für: Couto, Fernanda

1

Minimizing Distances Between Vertices and Edges Through Tre..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Couto, Fernanda ; Cunha, Luís ; Pinto, Edmundo. - p. 218-231 , 2024

Link: https://doi.org/10.1007/..

2

Partitions and well-coveredness: The graph sandwich problem:

Alves, Sancrey R. ; Couto, Fernanda ; Faria, Luerbio...
Discrete Mathematics. 346 (2023) 3 - p. 113253 , 2023

Link: https://doi.org/10.1016/..

3

Strategies for generating tree spanners: Algorithms, heuris..:

Couto, Fernanda ; Cunha, Luís Felipe I. ; Juventude, Daniel.
Information Processing Letters. 177 (2022) - p. 106265 , 2022

Link: https://doi.org/10.1016/..

4

Hardness and efficiency on t-admissibility for graph operat..:

Couto, Fernanda ; Cunha, Luís Felipe I.
Discrete Applied Mathematics. 304 (2021) - p. 342-348 , 2021

Link: https://doi.org/10.1016/..

5

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

Couto, Fernanda ; Faria, Luerbio ; Gravier, Sylvain..
Discrete Applied Mathematics. 281 (2020) - p. 118-133 , 2020

Link: https://doi.org/10.1016/..

6

Hardness and efficiency on minimizing maximum distances in ..:

Couto, Fernanda ; Cunha, Luís Felipe I.
Theoretical Computer Science. 838 (2020) - p. 168-179 , 2020

Link: https://doi.org/10.1016/..

7

Graph Sandwich Problem for the Property of Being Well-Cover..:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,

Alves, Sancrey Rodrigues ; Couto, Fernanda ; Faria, Luerbio... - p. 587-599 , 2020

Link: https://doi.org/10.1007/..

8

Edge Tree Spanners:

, In: AIRO Springer Series; Graphs and Combinatorial Optimization: from Theory to Applications,

Couto, Fernanda ; Cunha, Luís ; Posner, Daniel - p. 195-207 , 2020

Link: https://doi.org/10.1007/..

9

Hardness and Efficiency on Minimizing Maximum Distances for..:

Couto, Fernanda ; Cunha, Luís Felipe I.
Electronic Notes in Theoretical Computer Science. 346 (2019) - p. 355-367 , 2019

Link: https://doi.org/10.1016/..

10

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

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Couto, Fernanda ; Cunha, Luís Felipe I. - p. 46-61 , 2018

Link: https://doi.org/10.1007/..

11

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

Couto, Fernanda ; Faria, Luerbio ; Gravier, Sylvain.
Electronic Notes in Discrete Mathematics. 69 (2018) - p. 277-284 , 2018

Link: https://doi.org/10.1016/..

12

On the forbidden induced subgraph probe and sandwich proble..:

Couto, Fernanda ; Faria, Luerbio ; Gravier, Sylvain.
Discrete Applied Mathematics. 234 (2018) - p. 56-66 , 2018

Link: https://doi.org/10.1016/..

13

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

Couto, Fernanda ; Faria, Luerbio ; Klein, Sulamita
Journal of the Brazilian Computer Society. 20 (2014) 1 - p. , 2014

Link: https://doi.org/10.1186/..

14

REABILITAÇÃO FUNCIONAL DE FISSURA PALATINA UTILIZANDO A TÉC..:

Couto, Fernanda Bezerra ; Albuquerque, Assis Felipe Medeiros
Brazilian Journal of Case Reports. 2 (2022) Suppl.2 - p. 26 , 2022

Link: https://doi.org/10.52600..

15

Editorial - XXV Jornada Acadêmica de Odontologia (XXV JAO):

Pedreira, Lucas de Castro ; Brasil, Débora de Freitas ; Silva, Bruno Frota Amora...
Brazilian Journal of Case Reports. 2 (2022) Suppl.4 - p. 1-12 , 2022

Link: https://doi.org/10.52600..