Fábio Botler
Ph.D. in Computer Science
fbotler at cos.ufrj.br

Programa de Engenharia de Sistemas e Computação
Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa em Engenharia
Universidade Federal do Rio de Janeiro


Curriculum Vitae
Curriculum Lattes

Main Research Interests

Papers

  • The mod k chromatic index of graphs is O(k),
            preprint (with L. Colucci, Y. Kohayakawa).
  • Counting graph orientations with no directed triangles,
            preprint (with P. Araújo, G. O. Mota).
  • On Tuza's conjecture for triangulations and graphs with small treewidth,
            preprint (with C. G. Fernandes, Juan Gutiérrez).
  • Decomposition of graphs into trees with bounded maximum degree,
            Matemática Contemporânea, Volume 46, 2018, 8th Latin-American Workshop on Cliques in Graphs.
  • Towards Gallai's path decomposition conjecture, preprint (with M. Sambinelli).
  • Gallai's path decomposition conjecture for triangle-free planar graphs,
            Discrete Mathematics, Volume 342, Issue 5, 1403-1414, 2019 (with M. Sambinelli, A. Jiménez).
            Editors' Choice selections for 2019
  • Gallai's path decomposition conjecture for graphs with treewidth at most 3,
            Journal of Graph Theory, 2019 (with M. Sambinelli, R. S. Coelho, O. Lee - see also the preprint).
  • SUPERSET: A (Super)Natural Variant of the Card Game SET,
            Leibniz International Proceedings in Informatics (LIPIcs), Vol. 100, p. 12:1-12:17, 2018
           (with A. Cristi, R. Hoeksma, K. Schewior, A. Tönnis).
  • Decomposing 8-regular graphs into paths of length 4,
           Discrete Mathematics, Vol. 340, Issue 9, p. 2275-2285, 2017 (with A. Talon).
  • Decomposing regular graphs with prescribed girth into paths with given length,
           European Journal of Combinatorics, Vol. 66, p. 28-36, 2017 (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • On path decompositions of 2k-regular graphs,
           Discrete Mathematics, Vol. 340, Issue 6, p. 1405-1411, 2017 (with A. Jiménez).
  • Decompositions of highly connected graphs into paths of any given length,
           Journal of Combinatorial Theory, Series B, Vol. 122, p. 508-542, 2017
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Decomposing highly connected graphs into paths of length five,
           Discrete Applied Mathematics, Vol. 245, p. 128-138, 2018 (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Decompositions of triangle-free 5-regular graphs into paths of length five,
           Discrete Mathematics, Vol. 338, Issue 11 p. 1845-1855, 2015 (with G. O. Mota, Y. Wakabayashi).
  • Extended abstracts

  • The odd chromatic index of almost all graphs,
           Anais do V Encontro de Teoria da Computação, 49-52, 2020.
           V Encontro de Teoria da Computação, ETC 2020
           (with L. Colucci, Y. Kohayakawa).
  • Decomposition of (2k+1)-regular graphs
    containing special spanning 2k-regular Cayley graphs into paths of length 2k+1,

           Anais do V Encontro de Teoria da Computação, 13-16, 2020.
           V Encontro de Teoria da Computação, ETC 2020
           (with L. Hoffmann).
  • Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3,
           Acta Mathematica Universitatis Comenianae 88 (3), 501-505, 2019.
           European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2019
           (with M. Sambinelli).
  • Maximum number of triangle-free edge colourings with five and six colours,
           Acta Mathematica Universitatis Comenianae 88 (3), 495-499, 2019.
           European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2019
           (with J. Corsten, A. Dankovics, N. Frankl, H. Hàn, A. Jiménez, J. Skokan).
  • On computing the path number of a graph,
           X Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019
           (with M. Sambinelli, R. Cano).
  • On Tuza's conjecture for triangulations and graphs with small treewidth,
           X Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019
           (with C. G. Fernandes, Juan Gutiérrez).
  • Gallai's Conjecture for graphs with treewidth 3,
           IX Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2017
           (with M. Sambinelli).
  • On a joint technique for Hajós' and Gallai's Conjectures,
           Congresso da Sociedade Brasileira de Computação, CSBC 2017
           (with M. Sambinelli, R. S. Coelho, O. Lee).
  • Decomposing 8-regular graphs into paths of length 4,
           Electronic Notes in Discrete Mathematics 61 (2017), 147-153,
           The Ninth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017
           (with A. Talon).
  • Decompositions of highly connected graphs into paths of any given length,
           Electronic Notes in Discrete Mathematics 49 (2015), 795-802,
           The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Path decompositions of regular graphs with prescribed girth,
           Electronic Notes in Discrete Mathematics 49 (2015), 629-636,
           The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • On path decompositions of 2k-regular graphs,
           Electronic Notes in Discrete Mathematics 50 (2015), 163-168,
           VIII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2015
           (with A. Jiménez).
  • Decompositions of highly connected graphs into paths of length five,
           Electronic Notes in Discrete Mathematics 50 (2015), 211-216,
           VIII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2015
           (with G. O. Mota, M. T. I. Oshiro, Y. Wakabayashi).
  • Path decompositions of triangle-free 5-regular graphs,
           ICGT 2014 (with G. O. Mota, Y. Wakabayashi).
  • A constrained path decomposition of cubic graphs and the path number of cacti,
            Eurocomb 2013 (with Y. Wakabayashi).
  • Theses

  • Decomposição de Grafos em Caminhos,
            Ph.D. Thesis (in portuguese).
  • Decomposition of Graphs into Paths,
            Extended abstract of my Ph.D. Thesis submitted to CLTD - CLEI 2016.
  • Research and Study Groups

  • The Graphs and Algorithms research group at UFRJ [Seminars]
  • The Núcleo Milenio Información y Coordinación en Redes [Seminars]
  • The Combinatorics Research Group at the Universidade de São Paulo [Seminars]
  • Teaching

  • Combinatória Extremal e Probabilística - 2020/2 (PESC: CPS846')
  • Teoria da Computação - 2020/1 (PESC: COS700)
  • Complexidade de Algoritmos - 2019/3 (PESC: COS841; PPGI: MAB704)
  • Teoria dos Grafos - 2019/2 (ECI: COS242')
  • Combinatória Extremal e Probabilística - 2019/2 (PESC: CPS846')
  • Tópicos Especiais Engenharia de Computação e Informação - 2019/1 (ECI: Cos013)
  • Teoria da Computação - 2019/1 (PESC: COS700)
  • Complexidade de Algoritmos - 2018/3 (PESC: COS841; PPGI: MAB704)
  • Video

  • Ciclo de palestras em Teoria dos Grafos - UFPE (in portuguese):
    Colorações módulo k de grafos
  • Live on Festival do Conhecimento UFRJ on YouTube, or on Facebook (in portuguese)
    (with Daniel R. Figueiredo and Jayme Luiz Szwarcfiter )
  • Video of my seminar in the Seminários online de Grafos, Algoritmos e Combinatória (in portuguese):
    Counting graph orientations with no directed triangles
    (Organized by Vinicius dos Santos and Guilherme O. Mota)
  • Video of my presentation in PESC Week 2019 (in portuguese):
    Ciência das Redes x Teoria dos Grafos
    (Duel talk with Daniel R. Figueiredo)
  • Video of my presentation in PESC Week 2018 (in portuguese):
    LEGO, Tetris, e outras analogias não tão discretas
  • Address

    Last modified: qui out 22 21:59:09 -03 2020
    This website style was gently copied from Tássio Naia dos Santos