Comissão de Pesquisa e Inovação do IME-USP - Pesquisador Colaborador concluído

Resumos expandidos publicados em anais de congressos


Número total de itens: 33
(A1: 0, A2: 0, A3: 0, A4: 0, B1: 0, B2: 0, B3: 0, B4: 0, B5: 0, C: 0, NP: 0, Qualis não identificado: 33)

Legenda Qualis:

2021

1.   BARROS, G. F. ; CAVALAR, B. P. ; KOHAYAKAWA, YOSHIHARU ; Mota, G. O. ; Naia, T.. Oriented Graphs with Lower Orientation Ramsey Thresholds. Em: EuroComb 2021, 2021. Extended Abstracts EuroComb 2021, p. 799-804, 2021. Qualis: Não identificado (EUROCOMB 2021, 2021. EXTENDED ABSTRACTS EUROCOMB 2021)
2.   CAMPOS, M. ; Collares, M. ; Mota, G. O.. Counting C_k-free Orientations of G(n, p). Em: EuroComb 2021, p. 784-791, 2021. Qualis: Não identificado (EUROCOMB 2021)
3.   Collares, M. ; KOHAYAKAWA, YOSHIHARU ; Moreira, C. G. ; Mota, G. O.. Constrained colourings of random graphs. Em: LAGOS 2021, 2021. Proceedings of the {XI} Latin and American Algorithms, Graphs and Optimization Symposium, {LAGOS} 2021, v. 195, p. 368-375, 2021. Qualis: Não identificado (LAGOS 2021, 2021. PROCEEDINGS OF THE {XI} LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, {LAGOS} 2021)
4.   COLLARES, MAURÍCIO ; FERNANDES, ANTÔNIO K. B. ; MOTA, GUILHERME O. ; VICENTE, HUGO M.. Árvores Ramsey-restritas mínimas. Em: Encontro de Teoria da Computação, 2021, Brasil. Anais do VI Encontro de Teoria da Computação (ETC 2021), p. 46-49, 2021. Qualis: Não identificado (ENCONTRO DE TEORIA DA COMPUTAÇÃO, 2021, BRASIL. ANAIS DO VI ENCONTRO DE TEORIA DA COMPUTAÇÃO)
5.   PEREIRA, N. S. ; LIMA, PHYLLIPE ; GUERRA, EDUARDO ; MEIRELLES, Paulo. Towards Automated Playtesting in Game Development. Em: Brazilian Symposium on Computer Games and Digital Entertainment, 2021, Gramado. Proceedings SBGames 2021, 2021. Qualis: Não identificado (BRAZILIAN SYMPOSIUM ON COMPUTER GAMES AND DIGITAL ENTERTAINMENT, 2021, GRAMADO. PROCEEDINGS SBGAMES 2021)

2020

1.   FERREIRA LEITE, LEONARDO ALEXANDRE ; KON, FABIO ; Meirelles, Paulo. Understanding context and forces for choosing organizational structures for continuous delivery. Em: XI Congresso Brasileiro de Software: Teoria e Prática, 2020, Brasil. Anais Estendidos do XI Congresso Brasileiro de Software: Teoria e Prática (CBSoft 2020), p. 54, 2020. Qualis: Não identificado (XI CONGRESSO BRASILEIRO DE SOFTWARE: TEORIA E PRÁTICA, 2020, BRASIL. ANAIS ESTENDIDOS DO XI CONGRESSO BRASILEIRO DE SOFTWARE: TEORIA E PRÁTICA)

2019

1.   BARROS, G. F. ; CAVALAR, B. P. ; Mota, G. O. ; PARCZYK, O.. Anti-Ramsey Threshold of Cycles for Sparse Graphs. Em: LAGOS, 2019, Belo Horizonte. The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), v. 346, p. 89-98, 2019. Qualis: Não identificado (LAGOS, 2019, BELO HORIZONTE. THE PROCEEDINGS OF LAGOS 2019, THE TENTH LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM)
2.   BERGER, S. ; Kohayakawa, Y. ; MAESAKA, G. ; MARTINS, T. ; MENDONCA, W. ; Mota, G. O. ; PARCZYK, O.. The size-Ramsey number of powers of bounded degree trees. Em: Eurocomb, 2019. Acta Math. Univ. Comenianae, v. 88, p. 451-456, 2019. Qualis: Não identificado (EUROCOMB, 2019. ACTA MATH. UNIV. COMENIANAE)
3.   HOPPEN, C. ; Mota, G. O. ; Parente, R. F. ; SATO, C. M.. Counting Sparse k-edge-connected Hypergraphs with Given Number of Vertices and Edges. Em: LAGOS, 2019, Belo Horizonte. Electronic Notes in Theoretical Computer Science - The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), v. 346, p. 535-544, 2019. Qualis: Não identificado (LAGOS, 2019, BELO HORIZONTE. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE - THE PROCEEDINGS OF LAGOS 2019, THE TENTH LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM)
4.   Kohayakawa, Y. ; MENDONCA, W. ; Mota, G. O. ; Schülke, B.. Covering 3-coloured random graphs with monochromatic trees. Em: Eurocomb, 2019. Acta Math. Univ. Comenianae, v. 88, p. 871-875, 2019. Qualis: Não identificado (EUROCOMB, 2019. ACTA MATH. UNIV. COMENIANAE)
5.   Lintzmayer, C. N. ; Mota, G. O. ; CERIOLI, M. R. ; FERNANDES, C. G. ; Lee, O. ; SILVA, C. N.. On Edge-magic Labelings of Forests. Em: LAGOS, 2019, Belo Horizonte. Electronic Notes in Theoretical Computer Science - The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), v. 346, p. 299-307, 2019. Qualis: Não identificado (LAGOS, 2019, BELO HORIZONTE. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE - THE PROCEEDINGS OF LAGOS 2019, THE TENTH LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM)
6.   Lintzmayer, C. N. ; Mota, G. O. ; SAMBINELLI, M.. Decomposing Split Graphs into Locally Irregular Graphs. Em: LAGOS, 2019, Belo Horizonte. Electronic Notes in Theoretical Computer Science - The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), v. 346, p. 603-612, 2019. Qualis: Não identificado (LAGOS, 2019, BELO HORIZONTE. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE - THE PROCEEDINGS OF LAGOS 2019, THE TENTH LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM)

2017

1.   Bastos, J. O. ; Mota, G.O. ; Schacht, M. ; Schnitzer, J. ; Schulenburg, F.. Loose Hamiltonian cycles forced by large (k−2)-degree - sharp version. Em: Eurocomb - European Conference on Combinatorics, Graph Theory and Applications, 2017, Viena. Electronic notes in discrete mathematics, v. 61, p. 101-106, 2017. Qualis: Não identificado (EUROCOMB - EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2017, VIENA. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
2.   Bedenknecht, W. ; Mota, G. O. ; Reiher, C. ; Schacht, M.. On the local density problem for graphs of given odd-girth. Em: LAGOS '17 - IX Latin-American Algorithms, Graphs and Optimization Symposium, 2017, Marseille. Electronic Notes in Discrete Mathematics, v. 62, p. 39-44, 2017. Qualis: Não identificado (LAGOS '17 - IX LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2017, MARSEILLE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
3.   Clemens, D. ; Jensen, M. ; Kohayakawa, Y. ; Morrison, N. ; Mota, G. O. ; Reding, D. ; Roberts, B.. O número de tamanho-Ramsey para potências de caminhos. Em: II ETC - Congresso da Sociedade Brasileira de Computação, 2017, São Paulo. Anais do CSBC 2017, 2017. Qualis: Não identificado (II ETC - CONGRESSO DA SOCIEDADE BRASILEIRA DE COMPUTAÇÃO, 2017, SÃO PAULO. ANAIS DO CSBC 2017)
4.   Collares, M. ; Kohayakawa, Y. ; Morris, R. ; Mota, G.O.. On the number of r -transitive orientations of G ( n , p ). Em: Eurocomb - European Conference on Combinatorics, Graph Theory and Applications, 2017, Viena. Electronic notes in discrete mathematics, v. 61, p. 255-261, 2017. Qualis: Não identificado (EUROCOMB - EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2017, VIENA. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
5.   GUEDES, D. ; MEIRELLES, Paulo ; MANZO, R. ; CAMARINHA, D.. Mezuro: Understanding source code metrics. Em: The 13th International Conference on Open Source Systems, 2017, Buenos Aires. Poster Proceedings of the 13th International Conference on Open Source Systems, p. 15-18, 2017. Qualis: Não identificado (THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS, 2017, BUENOS AIRES. POSTER PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS)
6.   Kohayakawa, Y. ; Mota, G.O. ; Schacht, M.. Monochromatic trees in random graphs. Em: Eurocomb - European Conference on Combinatorics, Graph Theory and Applications, 2017, Viena. Electronic notes in discrete mathematics, v. 61, p. 759-764, 2017. Qualis: Não identificado (EUROCOMB - EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2017, VIENA. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
7.   MARTINS, T. ; GUEDES, D. ; GUIMARAES, L. ; POPPI, R. ; PARRA, H. ; MEIRELLES, Paulo. Pushing Together: A platform for social participation. Em: The 13th International Conference on Open Source Systems, 2017, Buenos Aires. Poster Proceedings - The 13th International Conference on Open Source Systems, p. 23-26, 2017. Qualis: Não identificado (THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS, 2017, BUENOS AIRES. POSTER PROCEEDINGS - THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS)
8.   MENDES, F. ; MEIRELLES, Paulo. Transpyler: Creating Localized Pythons. Em: The 13th International Conference on Open Source Systems, 2017, Buenos Aires. Poster Proceedings of the 13th International Conference on Open Source Systems, p. 10-14, 2017. Qualis: Não identificado (THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS, 2017, BUENOS AIRES. POSTER PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS)
9.   Mota, G. O. Advances in Anti-Ramsey Theory for sparse graphs. Em: II ETC - Congresso da Sociedade Brasileira de Computação 2017, 2017, São Paulo. Anais do CSBC 2017, 2017. Qualis: Não identificado (II ETC - CONGRESSO DA SOCIEDADE BRASILEIRA DE COMPUTAÇÃO 2017, 2017, SÃO PAULO. ANAIS DO CSBC 2017)
10.   RIBEIRO, A. C. ; SILVA, D. C. A. ; MEIRELLES, Paulo ; KON, F.. Kiskadee: ranking warnings based on continuous source code static analysis. Em: The 13th International Conference on Open Source Systems, 2017, Buenos Aires. Poster Proceedings of the 13th International Conference on Open Source Systems, p. 27-30, 2017. Qualis: Não identificado (THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS, 2017, BUENOS AIRES. POSTER PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON OPEN SOURCE SYSTEMS)

2016

1.   Mota, G.O.; Schacht, M. ; Bastos, J. O. ; Schulenburg, F. ; Schnitzer, J.. Loose Hamiltonian cycles forced by (k-2)-degree ? approximate version. Em: Tenth Jornadas de Matematica Discreta y Algoritmica (JMDA 2016),, 2016, Barcelona. Electronic notes on Discrete Mathematics, v. 54, p. 325-330, 2016. Qualis: Não identificado (TENTH JORNADAS DE MATEMATICA DISCRETA Y ALGORITMICA ,, 2016, BARCELONA. ELECTRONIC NOTES ON DISCRETE MATHEMATICS)

2015

1.   Botler, F. ; Mota, G.O. ; Oshiro, M. T. O. ; Wakabayashi, Y.. Path decompositions of regular graphs with prescribed girth. Em: European Conference on Combinatorics, Graph Theory and Applications, 2015, Bergen. Electronic Notes in Discrete Mathematics, v. 49, p. 629-636, 2015. Qualis: Não identificado (EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2015, BERGEN. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
2.   Botler, F. ; Mota, G.O. ; Oshiro, M. T. O. ; Wakabayashi, Y.. Decompositions of highly connected graphs into paths of length five. Em: LAGOS'15 VIII Latin-American Algorithms, Graphs and Optimization Symposium, 2011, 2015, Beberibe. Electronic Notes in Discrete Mathematics, v. 50C, p. 211-216, 2015. Qualis: Não identificado (LAGOS'15 VIII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, 2015, BEBERIBE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
3.   Botler, F. ; Mota, G.O. ; Oshiro, M. T. O. ; Wakabayashi, Y.. Decompositions of Highly Connected Graphs into Paths of Any Given Length. Em: European Conference on Combinatorics, Graph Theory and Applications, 2015, Bergen. Electronic Notes in Discrete Mathematics, v. 49, p. 795-802, 2015. Qualis: Não identificado (EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2015, BERGEN. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
4.   Kohayakawa, Y. ; Mota, G.O. ; Schacht, M. ; Taraz, A.. A counting lemma for sparse pseudorandom hypergraphs. Em: LAGOS'15 VIII Latin-American Algorithms, Graphs and Optimization Symposium, 2011, 2015, Beberibe. Electronic Notes in Discrete Mathematics, v. 50C, p. 421-426, 2015. Qualis: Não identificado (LAGOS'15 VIII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, 2015, BEBERIBE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)

2014

1.   Botler, F. ; Mota, G.O. ; Wakabayashi, Y.. Path decompositions of triangle-free 5-regular graphs. Em: 9th International colloquium on graph theory and combinatorics - ICGT 2014, 2014, Grenoble. 9th International colloquium on graph theory and combinatorics, 2014. Qualis: Não identificado (9TH INTERNATIONAL COLLOQUIUM ON GRAPH THEORY AND COMBINATORICS - ICGT 2014, 2014, GRENOBLE. 9TH INTERNATIONAL COLLOQUIUM ON GRAPH THEORY AND COMBINATORICS)
2.   FERREIRA, C. ; GONCALVES, A. ; SANTOS, M. ; Meirelles, Paulo ; NERI, H. R.. Práticas de colaboração no desenvolvimento de Software com o Governo: impactos na aprendizagem de alunos de graduação. Em: Fórum de Educação em Engenharia de Software - Simpósio Brasileiro de Engenharia de Software, 2014, Maceió, AL. Congresso Brasileiro de Software, 2014. Qualis: Não identificado (FÓRUM DE EDUCAÇÃO EM ENGENHARIA DE SOFTWARE - SIMPÓSIO BRASILEIRO DE ENGENHARIA DE SOFTWARE, 2014, MACEIÓ, AL. CONGRESSO BRASILEIRO DE SOFTWARE)
3.   Kohayakawa, Y. ; Konstadinidis, P. B. ; Mota, G.O.. On an anti-Ramsey threshold for sparse graphs with one triangle. Em: 9th International colloquium on graph theory and combinatorics - ICGT 2014, 2014, Grenoble. 9th International colloquium on graph theory and combinatorics, 2014. Qualis: Não identificado (9TH INTERNATIONAL COLLOQUIUM ON GRAPH THEORY AND COMBINATORICS - ICGT 2014, 2014, GRENOBLE. 9TH INTERNATIONAL COLLOQUIUM ON GRAPH THEORY AND COMBINATORICS)

2013

1.   Mota, G.O.; Sárközy, G. ; Schacht, M. ; Taraz, A.. Ramsey number for bipartite graphs with small bandwidth. Em: European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, 2013, Pisa. The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013. Pisa: Edizioni Della Normale, v. 16, p. 165-170, 2013. Qualis: Não identificado (EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS - EUROCOMB 2013, 2013, PISA. THE SEVENTH EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS - EUROCOMB 2013. PISA: EDIZIONI DELLA NORMALE)

2011

1.   Kohayakawa, Y. ; Konstadinidis, P. B. ; Mota, G.O.. On an anti-Ramsey property of random graphs. Em: LAGOS'11 VI Latin-American Algorithms, Graphs and Optimization Symposium, 2011, Bariloche. Electronic Notes in Discrete Mathematics, v. 37, 2011. Qualis: Não identificado (LAGOS'11 VI LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, BARILOCHE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)
2.   Kohayakawa, Y. ; Mota, G.O. ; Parente, R. F.. A note on counting orientations. Em: LAGOS'11 VI Latin-American Algorithms, Graphs and Optimization Symposium, 2011, 2011, Bariloche. Electronic Notes in Discrete Mathematics, v. 37, 2011. Qualis: Não identificado (LAGOS'11 VI LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, 2011, BARILOCHE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS)


(*) Relatório criado com produções desde 2000 até 2024
Data de processamento: 08/08/2024 12:41:02