Hardness and efficiency on minimizing maximum distances in spanning trees F Couto, LFI Cunha Theoretical Computer Science 838, 168-179, 2020 | 8 | 2020 |
Edge tree spanners F Couto, L Cunha, D Posner Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021 | 6 | 2021 |
Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k, ℓ)-graphs F Couto, LFI Cunha Electronic Notes in Theoretical Computer Science 346, 355-367, 2019 | 6 | 2019 |
Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently F Couto, LFI Cunha International Conference on Combinatorial Optimization and Applications …, 2018 | 6 | 2018 |
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and Cliques SR Alves, F Couto, L Faria, S Gravier, S Klein, US Souza Latin American Symposium on Theoretical Informatics, 587-599, 2020 | 5 | 2020 |
On the forbidden induced subgraph probe and sandwich problems F Couto, L Faria, S Gravier, S Klein Discrete Applied Mathematics 234, 56-66, 2018 | 5 | 2018 |
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs F Couto, L Faria, S Gravier, S Klein, VF dos Santos Electronic Notes in Discrete Mathematics 50, 133-138, 2015 | 5 | 2015 |
Chordal-(k,l) and Strongly Chordal-(k,l) Graph Sandwich Problems F Couto, L FARIA, S KLEIN 20th Conference of the International Federation of Operational Research …, 2014 | 5* | 2014 |
Hardness and efficiency on t-admissibility for graph operations F Couto, LFI Cunha Discrete Applied Mathematics 304, 342-348, 2021 | 4 | 2021 |
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes F Couto, LFI Cunha, D Juventude, L Santiago Information Processing Letters 177, 106265, 2022 | 3 | 2022 |
Chordal-(2,1) graph sandwich problem with boundary conditions F Couto, L FARIA, S GRAVIER, S Klein 9th International colloquium on graph theory and combinatorics, 2014 | 3* | 2014 |
Problemas Sanduıche para Grafos-(2, 1) com Condiçoes de Contorno F Couto M. Sc. thesis, Universidade Federal do Rio de Janeiro, Brazil, 2012 | 3 | 2012 |
Characterizations, probe and sandwich problems on (k, ℓ)-cographs F Couto, L Faria, S Gravier, S Klein, VF dos Santos Discrete Applied Mathematics 281, 118-133, 2020 | 2 | 2020 |
On the complexity of probe and sandwich problems for generalized threshold graphs F Couto, L Faria, S Gravier, S Klein, VF dos Santos International Workshop on Graph-Theoretic Concepts in Computer Science, 312-324, 2015 | 2 | 2015 |
On (k,ℓ)-Graph Sandwich Problems F Couto, L Faria, S Klein, F Protti, LT Nogueira Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2013 | 2 | 2013 |
New results on edge-coloring and total-coloring of split graphs F Couto, DA Ferraz, S Klein arXiv preprint arXiv:2303.05723, 2023 | 1 | 2023 |
Partitions and well-coveredness: The graph sandwich problem SR Alves, F Couto, L Faria, S Gravier, S Klein, US Souza Discrete Mathematics 346 (3), 113253, 2023 | 1 | 2023 |
Complexidade dos problemas sanduíche e probe para subclasses de grafos-(k, l) FVD Couto PhD thesis, Universidade Federal do Rio de Janeiro, Rio de Janeiro, RJ, 2016 | 1 | 2016 |
(k,l)-sandwich problems: why not ask for special kinds of bread? F Couto, L FARIA, S KLEIN, F PROTTI, LT NOGUEIRA Latin American Workshop on Cliques in Graphs, 2012 | 1* | 2012 |
(k,l)-sandwich problems: why not ask for special kinds of bread? F Couto, L Faria, S Klein, F Protti, LT Nogueira Matemática Contemporânea 42, 17-26, 0 | 1* | |