Fábio Happ Botler
Instituição:
Universidade Federal do Rio de Janeiro
Centro:
Centro de Tecnologia
Unidade:
Coordenação dos Programas de Pós-Graduação de Engenharia
Departamento:
Programa de Engenharia de Sistemas/COPPE
Formação:
-
Universidad de Valparaiso
| Pós-Doutorado | 2017 - 2018
-
Universidade de Chile
| Pós-Doutorado | 2016 - 2017
-
Universidade Estadual de Campinas
| Pós-Doutorado | 2016 - 2016
-
Universidade de São Paulo
Ciencia da Computacao | Doutorado | 2011 - 2016
-
Universidade Federal de Pernambuco
Matemática | Mestrado | 2009 - 2011
-
Universidade Federal de Pernambuco
Matemática | Graduação | 2005 - 2008
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:
(96.00% artigos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| Independent Dominating Sets in Planar Triangulations | 10.37236/12548 | 2024 |
| The mod k $k$ chromatic index of random graphs | 10.1002/jgt.22946 | 2023 |
| Biclique immersions in graphs with independence number 2 | 10.5817/CZ.MUNI.EUROCOMB23-024 | 2023 |
| Independent dominating sets in planar triangulations | 10.5817/CZ.MUNI.EUROCOMB23-023 | 2023 |
| Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs | 10.1016/j.disc.2023.113583 | 2023 |
| On nonrepetitive colorings of cycles | 10.1016/j.procs.2023.08.241 | 2023 |
| Separating the edges of a graph by a linear number of paths | 10.19086/aic.2023.6 | 2023 |
| A short proof of the bijection between minimal feedback arc sets and Hamiltonian paths in tournaments | 10.21711/231766362023/rmc5511 | 2023 |
| Decomposition of ( 2k + 1 ) -regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k + 1 | 10.1016/j.disc.2022.112906 | 2022 |
| Counting orientations of graphs with no strongly connected tournaments | 10.1016/j.disc.2022.113024 | 2022 |
| The mod k chromatic index of graphs is O(k) | 10.1002/jgt.22866 | 2022 |
| On Tuza?s conjecture for triangulations and graphs with small treewidth | 10.1016/j.disc.2020.112281 | 2021 |
| The 2-Decomposition Conjecture for a new class of graphs | 10.1016/j.procs.2021.11.044 | 2021 |
| Counting orientations of graphs with no strongly connected tournaments | 10.1016/j.procs.2021.11.047 | 2021 |
| Towards Gallai's path decomposition conjecture | 10.1002/jgt.22647 | 2020 |
| Gallai?s path decomposition conjecture for triangle-free planar graphs | 10.1016/j.disc.2019.01.020 | 2019 |
| Gallai's path decomposition conjecture for graphs with treewidth at most 3 | 10.1002/jgt.22489 | 2019 |
| Decomposition of graphs into trees with bounded maximum degree | 2019 | |
| On Computing the Path Number of a Graph | 10.1016/j.entcs.2019.08.017 | 2019 |
| Decomposing highly connected graphs into paths of length five | 10.1016/j.dam.2016.08.001 | 2018 |
| On path decompositions of -regular graphs | 10.1016/j.disc.2016.09.029 | 2017 |
| Decomposing 8-regular graphs into paths of length 4 | 10.1016/j.disc.2017.04.024 | 2017 |
| Decomposing highly edge-connected graphs into paths of any given length | 10.1016/j.jctb.2016.07.010 | 2017 |
| Decomposing regular graphs with prescribed girth into paths of given length | 10.1016/j.ejc.2017.06.011 | 2017 |
| Decompositions of triangle-free 5-regular graphs into paths of length five | 10.1016/j.disc.2015.04.018 | 2015 |
Eventos:
(45.83% eventos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| Independent dominating sets in planar triangulations | 2023 | |
| Biclique immersions in graphs with independence number 2 | 2023 | |
| Coloração caminho não repetitivo de ladders circulares | 10.5753/etc.2023.229946 | 2023 |
| Seymour?s Second Neighborhood Conjecture on sparse random graphs | 10.5753/etc.2022.222701 | 2022 |
| On the maximum number of edges in a graph with prescribed walk-nonrepetitive chromatic number | 10.5753/etc.2022.222730 | 2022 |
| Proper edge colorings of complete graphs without repeated triangles | 10.5753/etc.2022.222917 | 2022 |
| Avaliação de medidas de similaridade de texto para remoção de ambiguidade de nome de autores | 10.5753/wperformance.2022.223304 | 2022 |
| Minimal feedback arc sets containing long paths in few-vertex tournaments | 10.5281/zenodo.6090322 | 2021 |
| New Bounds on Roller Coaster Permutations | 10.5753/etc.2021.16378 | 2021 |
| The odd chromatic index of almost all graphs | 10.5753/etc.2020.11087 | 2020 |
| Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1 | 10.5753/etc.2020.11078 | 2020 |
| Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3 | 2019 | |
| Maximum number of triangle-free edge colourings with five and six colours | 2019 | |
| On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth | 2019 | |
| SUPERSET: A (Super)Natural Variant of the Card Game SET | 10.4230/LIPIcs.FUN.2018.12 | 2018 |
| On a joint technique for Hajós' and Gallai's Conjectures | 2017 | |
| Decomposition of 8-regular graphs into paths of length 4 | 2017 | |
| Gallai's conjecture for graphs with treewidth 3 | 10.1016/j.endm.2017.10.026 | 2017 |
| Decompositions of highly connected graphs into paths of length five | 2015 | |
| On path decompositions of 2k-regular graphs | 2015 | |
| Path decompositions of regular graphs with prescribed girth | 2015 | |
| Decompositions of highly connected graphs into paths of any given length | 2015 | |
| Caracterização geométrica das cônicas definidas por 5 elementos entre pontos e retas tangentes, determinação de pontos de cônicas e pontos de interseção | 2008 | |
| ESPECIFICAÇÃO E DESENVOLVIMENTO DE ALGORITMOS DE REPRESENTAÇÂO E MANIPULAÇÂO DE CURVAS CÔNICAS BASEADO SOBRE AS PROPRIEDADES GEOMETRICAS DAS CURVAS | 2007 |