Programa de Pós Graduação em Matemática

2017

1.	Collares, Maurício ; Kohayakawa, Yoshiharu ; MORRIS, ROBERT ; MOTA, G. O.. On the number of r-transitive orientations of G(n,p). Em: The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '17), 2017, Vienna. ENDM, The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '17). Amsterdam: Elsevier, v. 61, p. 255-261, 2017. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (THE EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB '17), 2017, VIENNA. ENDM, THE EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB '17). AMSTERDAM: ELSEVIER)
2.	HOPPEN, CARLOS ; Kohayakawa, Yoshiharu ; Lang, Richard ; LEFMANN, HANNO ; Stagni, Henrique. Estimating the distance to a hereditary graph property. Em: The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), 2017, Vienna. ENDM, The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '17). Amsterdam: Elsevier, v. 61, p. 607-163, 2017. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (THE EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB'17), 2017, VIENNA. ENDM, THE EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB '17). AMSTERDAM: ELSEVIER)
3.	Kohayakawa, Yoshiharu; MOTA, G. O. ; SCHACHT, M.. Monochromatic trees in random graphs. Em: The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '17), 2017, Vienna. ENDM, The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB '17). Amsterdam: Elsevier, v. 61, p. 759-764, 2017. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (THE EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB '17), 2017, VIENNA. ENDM, THE EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB '17). AMSTERDAM: ELSEVIER)

2015

ALLEN, PETER ; Böttcher, Julia ; Roberts, Barnaby ; Kohayakawa, Yoshiharu. Triangle-free subgraphs of random graphs. Em: The 8th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), 2015, Bergen. ENDM, The 8th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015). Amsterdam: Elsevier, v. 49, p. 393-397, 2015.
[ citações Google Scholar | citações Microsoft Acadêmico | busca Google ]
Qualis: Não identificado (THE 8TH EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB 2015), 2015, BERGEN. ENDM, THE 8TH EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB 2015). AMSTERDAM: ELSEVIER)

Kohayakawa, Yoshiharu; MOTA, G. O. ; SCHACHT, M. ; TARAZ, A.. A counting lemma for sparse pseudorandom hypergraphs. Em: VIII Latin-American Algorithms, Graphs and Optimization Symposium, 2015, Fortaleza. ENDM, VIII Latin-American Algorithms, Graphs and Optimization Symposium. Amsterdam: Elsevier, v. 50, p. 421-426, 2015.
[ citações Google Scholar | citações Microsoft Acadêmico | busca Google ]
Qualis: Não identificado (VIII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2015, FORTALEZA. ENDM, VIII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM. AMSTERDAM: ELSEVIER)

2011

1.	CORREA, R. ; HOPPEN, C. ; Kohayakawa, Yoshiharu ; Sampaio, Rudini M.. A note on random k-dimensional posets. Em: LAGOS '11 6th Latin-American Algorithms, Graphs and Optimization Symposium, 2011, Bariloche. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 37, p. 51-56, 2011. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (LAGOS '11 6TH LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, BARILOCHE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)
2.	HOPPEN, C. ; Kohayakawa, Yoshiharu ; Lefmann, H.. Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number. Em: EuroComb 2011 European Conference on Combinatorics, Graph Theory and Applications, 2011, Budapest. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 38, p. 469-472, 2011. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (EUROCOMB 2011 EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS, 2011, BUDAPEST. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)
3.	KAUFMANN, P.L. ; PELLEGRINI, L.. On lineability and spaceability of sets of nowhere integrable functions. Em: V ENAMA, 2011, São Carlos. Resumo dos trabalhos do V ENAMA, v. V, p. 135-136, 2011. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (V ENAMA, 2011, SÃO CARLOS. RESUMO DOS TRABALHOS DO V ENAMA)
4.	Kohayakawa, Yoshiharu; KONSTADINIDIS, P. B. ; MOTA, G. O.. On an anti-Ramsey property of random graphs. Em: LAGOS '11 6th Latin-American Algorithms, Graphs and Optimization Symposium, 2011, Bariloche. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 37, p. 237-242, 2011. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (LAGOS '11 6TH LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, BARILOCHE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)
5.	Kohayakawa, Yoshiharu; MOTA, G. O. ; PARENTE, R. F.. A note on counting orientations. Em: LAGOS '11 6th Latin-American Algorithms, Graphs and Optimization Symposium, 2011, Bariloche. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 37, p. 3-8, 2011. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (LAGOS '11 6TH LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2011, BARILOCHE. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)
6.	MARIANO, H. L.; MENDES, C. A.. Towards a good notion of category of logics. Em: TACL 2011 - The fifth International Confererence on Topology, Algebra and Categories in Logic, 2011, Marselha-França. 5th-TACL 2011, p. 207-210, 2011. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (TACL 2011 - THE FIFTH INTERNATIONAL CONFERERENCE ON TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC, 2011, MARSELHA-FRANÇA. 5TH-TACL 2011)

2010

1.	ARRIETA, J. M. ; PEREIRA, M. C.. Homogenization in thin domains. Em: IV Encontro Nacional de Análise Matemática e Aplicações, 2010, Belém. IV ENAMA, v. 4, p. 21-22, 2010. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (IV ENCONTRO NACIONAL DE ANÁLISE MATEMÁTICA E APLICAÇÕES, 2010, BELÉM. IV ENAMA)
2.	FAJARDO, R. ; PELLEGRINI, L.. Estrutura linear em certos conjuntos de operadores sobre C(K). Em: IV ENAMA, 2010, Belém-PA. IV ENAMA, p. 94-95, 2010. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (IV ENAMA, 2010, BELÉM-PA. IV ENAMA)

2009

1.	ARRIETA, J. M. ; CARVALHO, A. N. ; PEREIRA, M. C. ; SILVA, R. P.. Upper semicontinuity of attractors for a parabolic problem on a thin domain with highly oscillating boundary. Em: ENAMA - Encontro Nacional de Análise Matemática, 2009, Maringá PR. III ENAMA - Encontro Nacional de Análise Matemática, v. 3, p. 17-18, 2009. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (ENAMA - ENCONTRO NACIONAL DE ANÁLISE MATEMÁTICA, 2009, MARINGÁ PR. III ENAMA - ENCONTRO NACIONAL DE ANÁLISE MATEMÁTICA)
2.	Böttcher, Julia ; Kohayakawa, Yoshiharu ; Taraz, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal?. Em: LAGOS 09 5th Latin-American Algorithms, Graphs and Optimization Symposium, 2009, Gramado. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 35, p. 335-340, 2009. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (LAGOS 09 5TH LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2009, GRAMADO. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)
3.	Hoppen, C. ; Kohayakawa, Y. ; Lefmann, H.. Kneser Colorings of Uniform Hypergraphs. Em: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), 2009, Bordeaux. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 34, p. 219-223, 2009. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS (EUROCOMB 2009), 2009, BORDEAUX. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)
4.	Hoppen, C. ; KOHAYAKAWA, Y. ; Sampaio, R.M.. A note on permutation regularity. Em: LAGOS 09 5th Latin-American Algorithms, Graphs and Optimization Symposium, 2009, Gramado. Electronic Notes in Discrete Mathematics. Amsterdã: Elsevier, v. 35, p. 183-188, 2009. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (LAGOS 09 5TH LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2009, GRAMADO. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. AMSTERDÃ: ELSEVIER)

2002

MARCOS, E. N.; GREEN, E. L.. $N$ Koszul Algebras. Em: Centre International de Rencontres Mathématiques., 2003, Luminy. Algebra Montpellier Anouncements, http://www.emis.de/journals/AMA/AMA01-2003/index01-2003.html#G. Luminy: http://www.emis.de/journals/AMA/AMA01-2003/index01-2003.html#G, 2002.
[ citações Google Scholar | citações Microsoft Acadêmico | busca Google ]
Qualis: Não identificado (CENTRE INTERNATIONAL DE RENCONTRES MATHÉMATIQUES., 2003, LUMINY. ALGEBRA MONTPELLIER ANOUNCEMENTS, HTTP://WWW.EMIS.DE/JOURNALS/AMA/AMA01-2003/INDEX01-2003.HTML#G. LUMINY: HTTP://WWW.EMIS.DE/JOURNALS/AMA/AMA01-2003/INDEX01-2003.HTML#G)

2001

1.	KOHAYAKAWA, Y; MIYAZAWA, F ; RAGHAVAN, P ; WAKABAYASHI, Y. Multidimensional Cube Packing?. Em: Brazilian Symposium on Graphs and Combinatorics (GRACO), 2001, 2001. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (BRAZILIAN SYMPOSIUM ON GRAPHS AND COMBINATORICS (GRACO), 2001)
2.	MOREIRA, C. G. T. A. ; KOHAYAKAWA, Y. Bounds for Optimal Coverings?. Em: Brazilian Symposium on Graphs and Combinatorics (GRACO), 2001, p. 62-65, 2001. [ citações Google Scholar \| citações Microsoft Acadêmico \| busca Google ] Qualis: Não identificado (BRAZILIAN SYMPOSIUM ON GRAPHS AND COMBINATORICS (GRACO), 2001)

(*) Relatório criado com produções desde 2000 até 2024
Data de processamento: 11/04/2024 15:30:02