ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Near-perfect clique-factors in sparse pseudorandom graphs (2018)
Han, Jie; Kohayakawa, Yoshiharu ; Person, Yury
Source: Electronic Notes in Discrete Mathematics. Conference titles: Discrete Mathematics Days 2018. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2018.06.038. Acesso em: 22 nov. 2025. , 2018
APA
Han, J., Kohayakawa, Y., & Person, Y. (2018). Near-perfect clique-factors in sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2018.06.038
NLM
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2018 ; 68 221-226.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2018.06.038
Vancouver
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2018 ; 68 221-226.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2018.06.038
Trabalho de evento-anais periodico
Transversals of longest paths (2017)
Cerioli, Márcia R; Fernandes, Cristina Gomes ; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma T
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERIOLI, Márcia R et al. Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2017.10.024. Acesso em: 22 nov. 2025. , 2017
APA
Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez, J., & Lima, P. T. (2017). Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.024
NLM
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Vancouver
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Trabalho de evento-anais periodico
Strong intractability of generalized convex recoloring problems (2017)
Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2017.10.017. Acesso em: 22 nov. 2025. , 2017
APA
Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.017
NLM
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Vancouver
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Trabalho de evento-anais periodico
Monochromatic trees in random graphs (2017)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, M
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MOTA, Guilherme Oliveira e SCHACHT, M. Monochromatic trees in random graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.07.033. Acesso em: 22 nov. 2025. , 2017
APA
Kohayakawa, Y., Mota, G. O., & Schacht, M. (2017). Monochromatic trees in random graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.07.033
NLM
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 759-764.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.07.033
Vancouver
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 759-764.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.07.033
Trabalho de evento-anais periodico
On the number of r-transitive orientations of G (n, p) (2017)
Collares, M.; Kohayakawa, Yoshiharu ; Morris, R.; Mota, G.O.
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME
Subjects: MATEMÁTICA DISCRETA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COLLARES, M. et al. On the number of r-transitive orientations of G (n, p). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.06.046. Acesso em: 22 nov. 2025. , 2017
APA
Collares, M., Kohayakawa, Y., Morris, R., & Mota, G. O. (2017). On the number of r-transitive orientations of G (n, p). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.06.046
NLM
Collares M, Kohayakawa Y, Morris R, Mota GO. On the number of r-transitive orientations of G (n, p) [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 255-261.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.06.046
Vancouver
Collares M, Kohayakawa Y, Morris R, Mota GO. On the number of r-transitive orientations of G (n, p) [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 255-261.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.06.046
Trabalho de evento-anais periodico
Estimating the distance to a hereditary graph property (2017)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno; Stagni, Henrique
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME
Assunto: MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.07.014. Acesso em: 22 nov. 2025. , 2017
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2017). Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.07.014
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014
Trabalho de evento-anais periodico
Decompositions of highly connected graphs into paths of length five (2015)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.036. Acesso em: 22 nov. 2025. , 2015
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.036
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
Trabalho de evento-anais periodico
Triangle-free subgraphs of random graphs (2015)
Allen, Peter; Bottcher, Julia; Roberts, Barnaby; Kohayakawa, Yoshiharu
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Triangle-free subgraphs of random graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.06.055. Acesso em: 22 nov. 2025. , 2015
APA
Allen, P., Bottcher, J., Roberts, B., & Kohayakawa, Y. (2015). Triangle-free subgraphs of random graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.055
NLM
Allen P, Bottcher J, Roberts B, Kohayakawa Y. Triangle-free subgraphs of random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.055
Vancouver
Allen P, Bottcher J, Roberts B, Kohayakawa Y. Triangle-free subgraphs of random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.055
Trabalho de evento-anais periodico
A counting lemma for sparse pseudorandom hypergraphs (2015)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. A counting lemma for sparse pseudorandom hypergraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.070. Acesso em: 22 nov. 2025. , 2015
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2015). A counting lemma for sparse pseudorandom hypergraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.070
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070
Trabalho de evento-anais periodico
A min-max relation in flowgraphs (2015)
Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e FRANCO, Álvaro Junio Pereira. A min-max relation in flowgraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.019. Acesso em: 22 nov. 2025. , 2015
APA
Ferreira, C. E., & Franco, Á. J. P. (2015). A min-max relation in flowgraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.019
NLM
Ferreira CE, Franco ÁJP. A min-max relation in flowgraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 109-114.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.019
Vancouver
Ferreira CE, Franco ÁJP. A min-max relation in flowgraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 109-114.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.019
Trabalho de evento-anais periodico
Decompositions of highly connected graphs into paths of any given length (2015)
Botler, Fábio Happ ; Mota, G. O; Oshiro, Marcio Takashi Iura; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decompositions of highly connected graphs into paths of any given length. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.06.107. Acesso em: 22 nov. 2025. , 2015
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of any given length. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.107
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of any given length [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of any given length [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
Trabalho de evento-anais periodico
On minimum bisection and related partition problems in graphs with bounded tree width (2015)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.06.067. Acesso em: 22 nov. 2025. , 2015
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.067
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Trabalho de evento-anais periodico
The k-hop connected dominating set problem: hardness and polyhedra (2015)
Coelho, Rafael S; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COELHO, Rafael S e MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: hardness and polyhedra. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.011. Acesso em: 22 nov. 2025. , 2015
APA
Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2015). The k-hop connected dominating set problem: hardness and polyhedra. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.011
NLM
Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: hardness and polyhedra [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 59-64.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011
Vancouver
Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: hardness and polyhedra [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 59-64.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011
Trabalho de evento-anais periodico
Trajectory clustering of points in R (2015)
Fernandes, Cristina Gomes ; Oshiro, Marcio Takashi Iura
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS GEOMÉTRICOS, CINÉTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e OSHIRO, Marcio Takashi Iura. Trajectory clustering of points in R. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.010. Acesso em: 22 nov. 2025. , 2015
APA
Fernandes, C. G., & Oshiro, M. T. I. (2015). Trajectory clustering of points in R. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.010
NLM
Fernandes CG, Oshiro MTI. Trajectory clustering of points in R [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 53-58.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.010
Vancouver
Fernandes CG, Oshiro MTI. Trajectory clustering of points in R [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 53-58.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.07.010
Trabalho de evento-anais periodico
Path decompositions of regular graphs with prescribed girth (2015)
Botler, Fábio Happ ; Mota, G. O; Oshiro, Marcio Takashi Iura; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Path decompositions of regular graphs with prescribed girth. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.06.085. Acesso em: 22 nov. 2025. , 2015
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Path decompositions of regular graphs with prescribed girth. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.085
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Path decompositions of regular graphs with prescribed girth [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Path decompositions of regular graphs with prescribed girth [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
Trabalho de evento-anais periodico
An approximate blow-up lemma for sparse pseudorandom graphs (2013)
Allen, Peter ; Böttcher, Julia ; Hàn, Hiêp; Kohayakawa, Yoshiharu ; Person, Yury
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.061. Acesso em: 22 nov. 2025. , 2013
APA
Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2013). An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.061
NLM
Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. An approximate blow-up lemma for sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 44 393-398.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061
Vancouver
Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. An approximate blow-up lemma for sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 44 393-398.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061
Trabalho de evento-anais periodico
Polyhedral studies on the convex recoloring problem (2013)
Campêlo, Manoel; Lima, Karla Roberta Pereira Sampaio; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidades: EACH, IME
Subjects: ALGORITMOS, POLIEDROS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.036. Acesso em: 22 nov. 2025. , 2013
APA
Campêlo, M., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2013). Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.036
NLM
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
Vancouver
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
Trabalho de evento-resumo periodico
Complete arcs arising from a generalization of the Hermitian curve (extended abstract) (2013)
Borges, Herivelto ; Motta, B; Torres, F
Source: Electronic Notes in Discrete Mathematics. Conference titles: International Conference Combinatorics. Unidade: ICMC
Subjects: ÁLGEBRA, CURVAS ALGÉBRICAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BORGES, Herivelto e MOTTA, B e TORRES, F. Complete arcs arising from a generalization of the Hermitian curve (extended abstract). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2013.05.048. Acesso em: 22 nov. 2025. , 2013
APA
Borges, H., Motta, B., & Torres, F. (2013). Complete arcs arising from a generalization of the Hermitian curve (extended abstract). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2013.05.048
NLM
Borges H, Motta B, Torres F. Complete arcs arising from a generalization of the Hermitian curve (extended abstract) [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 40 271-275.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2013.05.048
Vancouver
Borges H, Motta B, Torres F. Complete arcs arising from a generalization of the Hermitian curve (extended abstract) [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 40 271-275.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2013.05.048
Trabalho de evento-anais periodico
Every hereditary permutation property is testable (2011)
Bastos, Antonio Josefran de Oliveira; Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Sampaio, Rudini Menezes
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME
Subjects: COMBINATÓRIA, PERMUTAÇÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BASTOS, Antonio Josefran de Oliveira et al. Every hereditary permutation property is testable. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2011.09.021. Acesso em: 22 nov. 2025. , 2011
APA
Bastos, A. J. de O., Hoppen, C., Kohayakawa, Y., & Sampaio, R. M. (2011). Every hereditary permutation property is testable. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.09.021
NLM
Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021
Vancouver
Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021
Trabalho de evento-anais periodico
Intersection of longest paths in a graph (2011)
Rezende, Susanna F. de; Fernandes, Cristina Gomes ; Martin, Daniel M.; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REZENDE, Susanna F. de et al. Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2011.10.024. Acesso em: 22 nov. 2025. , 2011
APA
Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2011). Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.10.024
NLM
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
Vancouver
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2025 nov. 22 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Conference titles

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration