Maycon Sambinelli

picture.jpg

Professor Adjunto
E-mail: m.sambinelli@ufabc.edu.br
Curriculum Lattes - Google Scholar - ORCID - ArXiv

Research Interests

  • Graph Theory
  • Algorithms
  • Combinatorics

Teaching (in Portuguese)

Em andamento

Finalizados

Orientações

Estou interessado em orientar alunos tenham bom desempenho acadêmico, afinidade com matemática, e interesse na área de Teoria dos Grafos.

Students

Grad Students

Undergrad Students

  • André Aranovich Florentino (Um Estudo sobre Combinatória)
  • Breno Pitta (Decomposição Localmente Irregular de Grafos)
  • Nicolas Frasson Boaroto (Coloração de Vértices e Teoria dos Menores)
  • Fabio Dos Santos de Souza (Coloração Sigma de Grafos)

Escrevinhações

Publications

Full papers


  1. Decomposing split graphs into locally irregular graphs
    Discreate Applied Mathematics, 292: 33-44, 2021 (with C. N. Lintzmayer, G. O. Mota)
  2. Towards Gallai's path decomposition conjecture
    Journal of Graph Theory, 97: 161–184, 2021 (with F. Botler)
  3. On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3
    Journal of Graph Theory, 93(3), 328-349, 2020 (with F. Botler, Rafael S. Coelho, O. Lee)
  4. Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for locally-semicomplete digraphs
    Graphs and Combinatorics, 35(4), 921-931, 2019 (with C. N. Lintzmayer, O. Lee, C. N. da Silva)
  5. Gallai's path decomposition conjecture for triangle-free planar graphs
    Discrete Mathematics, 342(5): 1403-1414, 2019 (with F. Botler, A. Jiménez)
  6. On Linial's conjecture for spine digraphs
    Discrete Mathematics, 340(6): 851-854, 2017 (with O. Lee, C. N. da Silva)

Extended abstracts

  1. Gallai's path decomposition conjecture for graphs with maximum E-degree at most 3
    European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB 2019 (with F. Botler)
  2. On computing the path number of a graph
    X Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS 2019 (with F. Botler, R. Cano)
  3. Decomposing split graphs into locally irregular graphs
    X Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS 2019 (with C. N. Lintzmayer, G. O. Mota)
  4. Linial's Conjecture for Arc-spine Digraphs
    X Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS 2019 (with L. Yoshimura, C. N. da Silva, O. Lee)
  5. α-diperfect digraphs
    XXVIII Congresso da Sociedade Brasileira de Computação - CSBC 2018 (with O. Lee, C. N. da Silva)
  6. Gallai's Conjecture for graphs with treewidth 3
    IX Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS 2017 (with F. Botler)
  7. Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs
    IX Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS 2017 (with O. Lee, C. N. da Silva)
  8. On a joint technique for Hajós' and Gallai's Conjectures
    XXVII Congresso da Sociedade Brasileira de Computação - CSBC 2017 (with F. Botler, Rafael S. Coelho, O. Lee)
  9. On Linial's conjecture for split digraphs
    XXVI Congresso da Sociedade Brasileira de Computação - CSBC 2016 (with O. Lee, C. N. da Silva)

Research projects

  • Extremal and structural problems in graph theory - FAPESP/CONICYT 2019/13364-7 - Coordenado por Cristina Gomes Fernandes (2020 - 2022)
  • Combinatória de grafos: uma abordagem estrutural e algorítmica - Universal CNPq 428385/2018-4 - Coordenado por Guilheme Mota - (12/2018 - 11/2020)
  • Estruturas Discretas e Algoritmos - Universal CNPq 423833/2018-9 - Coordenando por Cristina Gomes Fernandes (01/2019 - 12/2021)

Conferences and workshops I attended / plan to attend

Contact Information

Bloco A, Torre 2, Sala 518-2
Centro de Matemática, Computação e Cognição (CMCC)
Universidade Federal do ABC (UFABC)
Av. dos Estados, 5001
Bairro Bangu - Santo André - SP - Brasil
Theme is based on Cactus
Created with Emacs 27.2 (Org mode 9.4.4) on GNU/Linux
Last Updated: 2021-09-09 qui 16:13