ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Bounds for optimal coverings (2004)
Moreira, Carlos Gustavo Tamm de Araujo; Kohayakawa, Yoshiharu
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOREIRA, Carlos Gustavo Tamm de Araujo e KOHAYAKAWA, Yoshiharu. Bounds for optimal coverings. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S0166-218X(03)00372-X. Acesso em: 26 set. 2024. , 2004
APA
Moreira, C. G. T. de A., & Kohayakawa, Y. (2004). Bounds for optimal coverings. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S0166-218X(03)00372-X
NLM
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 263-276.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/S0166-218X(03)00372-X
Vancouver
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 263-276.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/S0166-218X(03)00372-X
Artigo de periodico
A density result for random sparse oriented graphs and its relation to a conjecture of woodall (2002)
Donadelli Junior, Jair; Kohayakawa, Yoshiharu
Source: Electronic Journal of Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DONADELLI JUNIOR, Jair e KOHAYAKAWA, Yoshiharu. A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, v. 9, n. 1, p. 1-10, 2002Tradução . . Disponível em: https://doi.org/10.37236/1661. Acesso em: 26 set. 2024.
APA
Donadelli Junior, J., & Kohayakawa, Y. (2002). A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, 9( 1), 1-10. doi:10.37236/1661
NLM
Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 set. 26 ] Available from: https://doi.org/10.37236/1661
Vancouver
Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 set. 26 ] Available from: https://doi.org/10.37236/1661
Artigo de periodico
Essentially infinite colourings of graphs (2000)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Schelp, Richard H.
Source: Journal of the London Mathematical Society. Second Series. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e SCHELP, Richard H. Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, v. 61, n. 3, p. 658-670, 2000Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796. Acesso em: 26 set. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Schelp, R. H. (2000). Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, 61( 3), 658-670. doi:10.1112/S0024610700008796
NLM
Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 set. 26 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796
Vancouver
Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 set. 26 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796
Trabalho de evento
Universality and tolerance (2000)
Alon, Noga; Capalbo, Michael; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Ruciânski, Andrzej; Szemerédi, Endre
Conference titles: Annual Symposium on Foundations of Computer Science. Unidade: IME
Assunto: COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Universality and tolerance. 2000, Anais.. Los alamitos: IEEE Computer Society, 2000. Disponível em: https://doi.org/10.1109/SFCS.2000.892007. Acesso em: 26 set. 2024.
APA
Alon, N., Capalbo, M., Kohayakawa, Y., Rodl, V., Ruciânski, A., & Szemerédi, E. (2000). Universality and tolerance. In . Los alamitos: IEEE Computer Society. doi:10.1109/SFCS.2000.892007
NLM
Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
Vancouver
Alon N, Capalbo M, Kohayakawa Y, Rodl V, Ruciânski A, Szemerédi E. Universality and tolerance [Internet]. 2000 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1109/SFCS.2000.892007
Trabalho de evento
Equivalent conditions for regularity (2000)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Skokan, J.
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SKOKAN, J. Equivalent conditions for regularity. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_5. Acesso em: 26 set. 2024.
APA
Kohayakawa, Y., Rodl, V., & Skokan, J. (2000). Equivalent conditions for regularity. In Proceedings. Berlin: Springer. doi:10.1007/10719839_5
NLM
Kohayakawa Y, Rodl V, Skokan J. Equivalent conditions for regularity [Internet]. Proceedings. 2000 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/10719839_5
Vancouver
Kohayakawa Y, Rodl V, Skokan J. Equivalent conditions for regularity [Internet]. Proceedings. 2000 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/10719839_5
Artigo de periodico
Finding skew partitions efficiently (2000)
Figueiredo, Celina Miraglia Herrera de; Klein, Sulamita; Kohayakawa, Yoshiharu ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FIGUEIREDO, Celina Miraglia Herrera de et al. Finding skew partitions efficiently. Journal of Algorithms, v. 37, n. 2, p. 505-521, 2000Tradução . . Disponível em: https://doi.org/10.1006/jagm.1999.1122. Acesso em: 26 set. 2024.
APA
Figueiredo, C. M. H. de, Klein, S., Kohayakawa, Y., & Reed, B. A. (2000). Finding skew partitions efficiently. Journal of Algorithms, 37( 2), 505-521. doi:10.1006/jagm.1999.1122
NLM
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 set. 26 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Vancouver
Figueiredo CMH de, Klein S, Kohayakawa Y, Reed BA. Finding skew partitions efficiently [Internet]. Journal of Algorithms. 2000 ; 37( 2): 505-521.[citado 2024 set. 26 ] Available from: https://doi.org/10.1006/jagm.1999.1122
Trabalho de evento
Algorithmic aspects of regularity (2000)
Kohayakawa, Yoshiharu ; Rodl, Vojtech
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RODL, Vojtech. Algorithmic aspects of regularity. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_1. Acesso em: 26 set. 2024.
APA
Kohayakawa, Y., & Rodl, V. (2000). Algorithmic aspects of regularity. In Proceedings. Berlin: Springer. doi:10.1007/10719839_1
NLM
Kohayakawa Y, Rodl V. Algorithmic aspects of regularity [Internet]. Proceedings. 2000 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/10719839_1
Vancouver
Kohayakawa Y, Rodl V. Algorithmic aspects of regularity [Internet]. Proceedings. 2000 ;[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/10719839_1
Artigo de periodico
The length of random subsets of Boolean lattices (2000)
Kohayakawa, Yoshiharu ; Kreuter, Bernd; Osthus, Deryk
Source: Random Structures & Algorithms. 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 e KREUTER, Bernd e OSTHUS, Deryk. The length of random subsets of Boolean lattices. Random Structures & Algorithms, v. 16, n. 2, p. 177-194, 2000Tradução . . Disponível em: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9. Acesso em: 26 set. 2024.
APA
Kohayakawa, Y., Kreuter, B., & Osthus, D. (2000). The length of random subsets of Boolean lattices. Random Structures & Algorithms, 16( 2), 177-194. doi:10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
NLM
Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 set. 26 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
Vancouver
Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 set. 26 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
Artigo de periodico
Induced Ramsey Numbers (1998)
Kohayakawa, Yoshiharu ; Prömel, Hans Jürgen; Rodl, Vojtech
Source: Combinatorica volume. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e PRÖMEL, Hans Jürgen e RODL, Vojtech. Induced Ramsey Numbers. Combinatorica volume, v. 18, n. 3, p. 373-404, 1998Tradução . . Disponível em: https://doi.org/10.1007/pl00009828. Acesso em: 26 set. 2024.
APA
Kohayakawa, Y., Prömel, H. J., & Rodl, V. (1998). Induced Ramsey Numbers. Combinatorica volume, 18( 3), 373-404. doi:10.1007/pl00009828
NLM
Kohayakawa Y, Prömel HJ, Rodl V. Induced Ramsey Numbers [Internet]. Combinatorica volume. 1998 ; 18( 3): 373-404.[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/pl00009828
Vancouver
Kohayakawa Y, Prömel HJ, Rodl V. Induced Ramsey Numbers [Internet]. Combinatorica volume. 1998 ; 18( 3): 373-404.[citado 2024 set. 26 ] Available from: https://doi.org/10.1007/pl00009828

USP Schools

ReP

Filtros

Authors

Source title

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration