ReP USP - Resultado da busca

Artigo de periodico
Spanning trees with nonseparating paths (2016)
Fernandes, Cristina Gomes ; Hernández Vélez, César; Lee, Orlando; Pina Júnior, José Coelho de
Source: Discrete Mathematics. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. Spanning trees with nonseparating paths. Discrete Mathematics, v. 339, n. 06 Ja 2016, p. 365–374, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2015.08.020. Acesso em: 15 nov. 2024.
APA
Fernandes, C. G., Hernández Vélez, C., Lee, O., & Pina Júnior, J. C. de. (2016). Spanning trees with nonseparating paths. Discrete Mathematics, 339( 06 Ja 2016), 365–374. doi:10.1016/j.disc.2015.08.020
NLM
Fernandes CG, Hernández Vélez C, Lee O, Pina Júnior JC de. Spanning trees with nonseparating paths [Internet]. Discrete Mathematics. 2016 ; 339( 06 Ja 2016): 365–374.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.disc.2015.08.020
Vancouver
Fernandes CG, Hernández Vélez C, Lee O, Pina Júnior JC de. Spanning trees with nonseparating paths [Internet]. Discrete Mathematics. 2016 ; 339( 06 Ja 2016): 365–374.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.disc.2015.08.020
Trabalho de evento-anais periodico
Sparse sums of positive semidefinite matrices (2016)
Silva, Marcel Kenji de Carli ; Harvey, Nicholas J. A; Sato, Cristiane Maria
Source: ACM Transactions on Algorithms. Conference titles: Annual ACM-SIAM Symposium on Discrete Algorithms - SODA’12. Unidade: IME
Subjects: TEORIA DOS GRAFOS, MATRIZES, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e HARVEY, Nicholas J. A e SATO, Cristiane Maria. Sparse sums of positive semidefinite matrices. ACM Transactions on Algorithms. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1145/2746241. Acesso em: 15 nov. 2024. , 2016
APA
Silva, M. K. de C., Harvey, N. J. A., & Sato, C. M. (2016). Sparse sums of positive semidefinite matrices. ACM Transactions on Algorithms. New York: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1145/2746241
NLM
Silva MK de C, Harvey NJA, Sato CM. Sparse sums of positive semidefinite matrices [Internet]. ACM Transactions on Algorithms. 2016 ; 12( article º 9): 9:1-9:17.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1145/2746241
Vancouver
Silva MK de C, Harvey NJA, Sato CM. Sparse sums of positive semidefinite matrices [Internet]. ACM Transactions on Algorithms. 2016 ; 12( article º 9): 9:1-9:17.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1145/2746241
Artigo de periodico
An extension of the blow-up lemma to arrangeable graphs (2015)
Boettcher, Julia; Kohayakawa, Yoshiharu ; Taraz, Anusch; Wuerfl, Andreas
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, GRAFOS ALEATÓRIOS, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOETTCHER, Julia et al. An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, v. 29, n. 2, p. 962-1001, 2015Tradução . . Disponível em: https://doi.org/10.1137/13093827X. Acesso em: 15 nov. 2024.
APA
Boettcher, J., Kohayakawa, Y., Taraz, A., & Wuerfl, A. (2015). An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29( 2), 962-1001. doi:10.1137/13093827X
NLM
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1137/13093827X
Vancouver
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1137/13093827X
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: 15 nov. 2024. , 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 2024 nov. 15 ] 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 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
Artigo de periodico
Decompositions of triangle-free 5-regular graphs into paths of length five (2015)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Wakabayashi, Yoshiko
Source: Discrete Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ e MOTA, Guilherme Oliveira e WAKABAYASHI, Yoshiko. Decompositions of triangle-free 5-regular graphs into paths of length five. Discrete Mathematics, v. 338, n. 11, p. 1845–1855, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2015.04.018. Acesso em: 15 nov. 2024.
APA
Botler, F. H., Mota, G. O., & Wakabayashi, Y. (2015). Decompositions of triangle-free 5-regular graphs into paths of length five. Discrete Mathematics, 338( 11), 1845–1855. doi:10.1016/j.disc.2015.04.018
NLM
Botler FH, Mota GO, Wakabayashi Y. Decompositions of triangle-free 5-regular graphs into paths of length five [Internet]. Discrete Mathematics. 2015 ; 338( 11): 1845–1855.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.disc.2015.04.018
Vancouver
Botler FH, Mota GO, Wakabayashi Y. Decompositions of triangle-free 5-regular graphs into paths of length five [Internet]. Discrete Mathematics. 2015 ; 338( 11): 1845–1855.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.disc.2015.04.018
Trabalho de evento-anais periodico
Decompositions of highly connected graphs into paths of any given length (2015)
Botler, F; 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 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: 15 nov. 2024. , 2015
APA
Botler, F., 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 F, 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 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
Vancouver
Botler F, 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 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
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: 15 nov. 2024. , 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 2024 nov. 15 ] 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 2024 nov. 15 ] 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: 15 nov. 2024. , 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 2024 nov. 15 ] 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 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.07.019
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: 15 nov. 2024. , 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 2024 nov. 15 ] 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 2024 nov. 15 ] 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: 15 nov. 2024. , 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 2024 nov. 15 ] 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 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011
Trabalho de evento-anais periodico
Path decompositions of regular graphs with prescribed girth (2015)
Botler, F; 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 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: 15 nov. 2024. , 2015
APA
Botler, F., 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 F, Mota GO, Oshiro MTI, Wakabayashi Y. Path decompositions of regular graphs with prescribed girth [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
Vancouver
Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Path decompositions of regular graphs with prescribed girth [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 nov. 15 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
Trabalho de evento
Advances in learning Bayesian networks of bounded treewidth (2014)
Nie, Siqi; Mauá, Denis Deratani ; Campos, Cassio Polpo de; Ji, Qiang
Source: Advances in Neural Information Processing Systems, 27. Conference titles: Annual Conference on Neural Information Processing Systems - NIPS. Unidade: IME
Subjects: ALGORITMOS, INTELIGÊNCIA ARTIFICIAL, ANÁLISE DE ALGORITMOS, TEORIA DOS GRAFOS, COMBINATÓRIA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NIE, Siqi et al. Advances in learning Bayesian networks of bounded treewidth. 2014, Anais.. Montreal: NIPS Foundation, 2014. Disponível em: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf. Acesso em: 15 nov. 2024.
APA
Nie, S., Mauá, D. D., Campos, C. P. de, & Ji, Q. (2014). Advances in learning Bayesian networks of bounded treewidth. In Advances in Neural Information Processing Systems, 27. Montreal: NIPS Foundation. Recuperado de http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
NLM
Nie S, Mauá DD, Campos CP de, Ji Q. Advances in learning Bayesian networks of bounded treewidth [Internet]. Advances in Neural Information Processing Systems, 27. 2014 ;[citado 2024 nov. 15 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Vancouver
Nie S, Mauá DD, Campos CP de, Ji Q. Advances in learning Bayesian networks of bounded treewidth [Internet]. Advances in Neural Information Processing Systems, 27. 2014 ;[citado 2024 nov. 15 ] Available from: http://papers.nips.cc/paper/5530-advances-in-learning-bayesian-networks-of-bounded-treewidth.pdf
Artigo de periodico
Spectral bounds for the independence ratio and the chromatic number of an operator (2014)
Bachoc, Christine; DeCorte, Evan; Oliveira Filho, Fernando Mário de; Vallentin, Frank
Source: Israel Journal of Mathematics. Unidade: IME
Subjects: OPERADORES LINEARES, TEORIA DOS GRAFOS, MATEMÁTICA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BACHOC, Christine et al. Spectral bounds for the independence ratio and the chromatic number of an operator. Israel Journal of Mathematics, v. 202, n. 1, p. 227-254, 2014Tradução . . Disponível em: https://doi.org/10.1007/s11856-014-1070-7. Acesso em: 15 nov. 2024.
APA
Bachoc, C., DeCorte, E., Oliveira Filho, F. M. de, & Vallentin, F. (2014). Spectral bounds for the independence ratio and the chromatic number of an operator. Israel Journal of Mathematics, 202( 1), 227-254. doi:10.1007/s11856-014-1070-7
NLM
Bachoc C, DeCorte E, Oliveira Filho FM de, Vallentin F. Spectral bounds for the independence ratio and the chromatic number of an operator [Internet]. Israel Journal of Mathematics. 2014 ; 202( 1): 227-254.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s11856-014-1070-7
Vancouver
Bachoc C, DeCorte E, Oliveira Filho FM de, Vallentin F. Spectral bounds for the independence ratio and the chromatic number of an operator [Internet]. Israel Journal of Mathematics. 2014 ; 202( 1): 227-254.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1007/s11856-014-1070-7

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Source title

Conference titles

Non normalized affiliation

Countries of institutions of collaboration