ReP USP - Resultado da busca

Artigo de periodico
The Turan theorem for random graphs (2004)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias
Source: Combinatorics Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SCHACHT, Mathias. The Turan theorem for random graphs. Combinatorics Probability & Computing, v. 13, n. 1, p. 61-91, 2004Tradução . . Disponível em: https://doi.org/10.1017/S0963548303005856. Acesso em: 12 nov. 2024.
APA
Kohayakawa, Y., Rodl, V., & Schacht, M. (2004). The Turan theorem for random graphs. Combinatorics Probability & Computing, 13( 1), 61-91. doi:10.1017/S0963548303005856
NLM
Kohayakawa Y, Rodl V, Schacht M. The Turan theorem for random graphs [Internet]. Combinatorics Probability & Computing. 2004 ; 13( 1): 61-91.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1017/S0963548303005856
Vancouver
Kohayakawa Y, Rodl V, Schacht M. The Turan theorem for random graphs [Internet]. Combinatorics Probability & Computing. 2004 ; 13( 1): 61-91.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1017/S0963548303005856
Artigo de periodico
Embedding graphs with bounded degree in sparse pseudorandom graphs (2004)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Sissokho, Papa
Source: Israel Journal of Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SISSOKHO, Papa. Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, v. 139, p. 93-137, 2004Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543. Acesso em: 12 nov. 2024.
APA
Kohayakawa, Y., Rodl, V., & Sissokho, P. (2004). Embedding graphs with bounded degree in sparse pseudorandom graphs. Israel Journal of Mathematics, 139, 93-137. doi:10.1007/bf02787543
NLM
Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 nov. 12 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
Vancouver
Kohayakawa Y, Rodl V, Sissokho P. Embedding graphs with bounded degree in sparse pseudorandom graphs [Internet]. Israel Journal of Mathematics. 2004 ; 139 93-137.[citado 2024 nov. 12 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF02787543
Artigo de periodico
Searching in Random partially ordered sets (2004)
Carmo, Renato José da Silva; Donadelli Junior, Jair; Kohayakawa, Yoshiharu ; Laber, Eduardo Sany
Source: Theoretical Computer Science. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARMO, Renato José da Silva et al. Searching in Random partially ordered sets. Theoretical Computer Science, v. 321, n. 1, p. 41-57, 2004Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2003.06.001. Acesso em: 12 nov. 2024.
APA
Carmo, R. J. da S., Donadelli Junior, J., Kohayakawa, Y., & Laber, E. S. (2004). Searching in Random partially ordered sets. Theoretical Computer Science, 321( 1), 41-57. doi:10.1016/j.tcs.2003.06.001
NLM
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Theoretical Computer Science. 2004 ; 321( 1): 41-57.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1016/j.tcs.2003.06.001
Vancouver
Carmo RJ da S, Donadelli Junior J, Kohayakawa Y, Laber ES. Searching in Random partially ordered sets [Internet]. Theoretical Computer Science. 2004 ; 321( 1): 41-57.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1016/j.tcs.2003.06.001
Relatorio tecnico
Small world semiplanes with generalised Schubert cells (2004)
Futorny, Vyacheslav ; Ustimenko, Vasly
Unidade: IME
Subjects: TEORIA DOS GRAFOS, GEOMETRIA FINITA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FUTORNY, Vyacheslav e USTIMENKO, Vasly. Small world semiplanes with generalised Schubert cells. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/f9eb979c-4eb2-4dc1-8c6a-54ca5f6ec27e/1425196.pdf. Acesso em: 12 nov. 2024. , 2004
APA
Futorny, V., & Ustimenko, V. (2004). Small world semiplanes with generalised Schubert cells. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/f9eb979c-4eb2-4dc1-8c6a-54ca5f6ec27e/1425196.pdf
NLM
Futorny V, Ustimenko V. Small world semiplanes with generalised Schubert cells [Internet]. 2004 ;[citado 2024 nov. 12 ] Available from: https://repositorio.usp.br/directbitstream/f9eb979c-4eb2-4dc1-8c6a-54ca5f6ec27e/1425196.pdf
Vancouver
Futorny V, Ustimenko V. Small world semiplanes with generalised Schubert cells [Internet]. 2004 ;[citado 2024 nov. 12 ] Available from: https://repositorio.usp.br/directbitstream/f9eb979c-4eb2-4dc1-8c6a-54ca5f6ec27e/1425196.pdf
Relatorio tecnico
A two-player game on graph factors (2004)
Carmo, Renato José da Silva; Feder, Tomás; Kohayakawa, Yoshiharu ; Laber, Eduardo Sany; Motwani, Rajeev; O´Callaghan, Liadan; Panigrahy, Rina; Thomas, Dilys
Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARMO, Renato José da Silva et al. A two-player game on graph factors. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf. Acesso em: 12 nov. 2024. , 2004
APA
Carmo, R. J. da S., Feder, T., Kohayakawa, Y., Laber, E. S., Motwani, R., O´Callaghan, L., et al. (2004). A two-player game on graph factors. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf
NLM
Carmo RJ da S, Feder T, Kohayakawa Y, Laber ES, Motwani R, O´Callaghan L, Panigrahy R, Thomas D. A two-player game on graph factors [Internet]. 2004 ;[citado 2024 nov. 12 ] Available from: https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf
Vancouver
Carmo RJ da S, Feder T, Kohayakawa Y, Laber ES, Motwani R, O´Callaghan L, Panigrahy R, Thomas D. A two-player game on graph factors [Internet]. 2004 ;[citado 2024 nov. 12 ] Available from: https://repositorio.usp.br/directbitstream/60b60c06-5f07-4f5f-982d-8f134e36bb79/1389020.pdf
Trabalho de evento
Lempel, Even, and Cederbaum planarity method (2004)
Boyer, John M; Fernandes, Cristina Gomes ; Noma, Alexandre ; Pina Júnior, José Coelho de
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOYER, John M et al. Lempel, Even, and Cederbaum planarity method. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_10. Acesso em: 12 nov. 2024.
APA
Boyer, J. M., Fernandes, C. G., Noma, A., & Pina Júnior, J. C. de. (2004). Lempel, Even, and Cederbaum planarity method. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_10
NLM
Boyer JM, Fernandes CG, Noma A, Pina Júnior JC de. Lempel, Even, and Cederbaum planarity method [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_10
Vancouver
Boyer JM, Fernandes CG, Noma A, Pina Júnior JC de. Lempel, Even, and Cederbaum planarity method [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_10
Trabalho de evento-anais periodico
Some formulations for the group Steiner tree problem (2004)
Ferreira, Carlos Eduardo ; Oliveira Filho, Fernando M. de
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Conference on Combinatorics, Graphs and Applications. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e OLIVEIRA FILHO, Fernando M. de. Some formulations for the group Steiner tree problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://ac.els-cdn.com/S1571065304010777/1-s2.0-S1571065304010777-main.pdf?_tid=1046cc39-8b62-42ac-8c82-0d12a4a3b60a&acdnat=1550077205_9203d72abd9919df0e4031f52940c0a3. Acesso em: 12 nov. 2024. , 2004
APA
Ferreira, C. E., & Oliveira Filho, F. M. de. (2004). Some formulations for the group Steiner tree problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://ac.els-cdn.com/S1571065304010777/1-s2.0-S1571065304010777-main.pdf?_tid=1046cc39-8b62-42ac-8c82-0d12a4a3b60a&acdnat=1550077205_9203d72abd9919df0e4031f52940c0a3
NLM
Ferreira CE, Oliveira Filho FM de. Some formulations for the group Steiner tree problem [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 127-132.[citado 2024 nov. 12 ] Available from: https://ac.els-cdn.com/S1571065304010777/1-s2.0-S1571065304010777-main.pdf?_tid=1046cc39-8b62-42ac-8c82-0d12a4a3b60a&acdnat=1550077205_9203d72abd9919df0e4031f52940c0a3
Vancouver
Ferreira CE, Oliveira Filho FM de. Some formulations for the group Steiner tree problem [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 127-132.[citado 2024 nov. 12 ] Available from: https://ac.els-cdn.com/S1571065304010777/1-s2.0-S1571065304010777-main.pdf?_tid=1046cc39-8b62-42ac-8c82-0d12a4a3b60a&acdnat=1550077205_9203d72abd9919df0e4031f52940c0a3

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Source title

Funding Agencies

Non normalized affiliation