Fábio Botler
Ph.D. in Computer Science
fbotler at ime.usp.br

Departamento de Ciência da Computação
Instituto de Matemática e Estatística
Universidade de São Paulo

Extended abstracts

Separating cycle systems,
        Discrete Mathematics Days 2024
       (with T. Naia).

On nonrepetitive colorings of cycles,
        Procedia Computer Science, Volume 223, 2023, 302-307
       XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023)
       (with W. Lomenha, J. P. de Souza).

Biclique immersions in graphs with independence number 2,
       European Conference on Combinatorics, Graph Theory and Applications, Eurocomb 2023
       (with A. Jiménez, C. N. Lintzmayer , A. Pastine, D. Quiroz, M. Sambinelli)..

Independent dominating sets in planar triangulations,
       European Conference on Combinatorics, Graph Theory and Applications, Eurocomb 2023
       (with C. G. Fernandes, Juan Gutiérrez).

Coloração caminho não repetitivo de ladders circulares,
        Anais do Encontro de Teoria da Computação (ETC 2023) (with W. Lomenha, J. P. de Souza).

Avaliação de medidas de similaridade de texto para remoção de ambiguidade de nome de autores,
        Anais do Workshop em Desempenho de Sistemas Computacionais e de Comunicação (WPerformance 2022)
        (with M. Lemos, D. R. Figueiredo).

On the maximum number of edges in a graph with prescribed walk-nonrepetitive chromatic number,
        Anais do Encontro de Teoria da Computação (ETC 2022) (with W. Lomenha, J. P. de Souza).

Proper edge colorings of complete graphs without repeated triangles,
        Anais do Encontro de Teoria da Computação (ETC 2022)
        (with L. Colucci, P. Matias, G. O. Mota, R. Parente, M. Secco).

Seymour's Second Neighborhood Conjecture on sparse random graphs,
        Anais do Encontro de Teoria da Computação (ETC 2022) (with Phablo F. S. Moura, Tássio Naia).

Counting orientations of graphs with no strongly connected tournaments,
       Procedia Computer Science 195, 385–393, 2021.
       (with C. Hoppen, G. O. Mota).

The 2-Decomposition Conjecture for a new class of graphs,
       Procedia Computer Science 195, 359-367, 2021.
       (with A. Jiménez, M. Sambinelli, Y. Wakabayashi).

New Bounds on Roller Coaster Permutations,
       Anais do VI Encontro de Teoria da Computação, 50-53, 2021.
       (with Bruno L. Netto).

The Mod k Chromatic Index of Random Graphs,
       Extended Abstracts EuroComb 2021, 726-731, 2021.
       (with L. Colucci, Y. Kohayakawa).

The odd chromatic index of almost all graphs,
       Anais do V Encontro de Teoria da Computação, 49-52, 2020.
       (with L. Colucci, Y. Kohayakawa).
        Second best paper award.

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.
       (with L. Hoffmann).
        Best paper award.

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).