Menu

Filtros : "Han, Jie" "2019" "IME" Removidos: "Indexado no: Scopus" "COELHO, FLAVIO ULHOA" "IAU" Limpar

Filtros

Refine with date range

  • 1

1 - 5 (5 records)

  • Artigo de periodico

    On some extremal results for order types (2019)

    Han, Jie ; Kohayakawa, Yoshiharu ; Sales, Marcelo Tadeu; Stagni, Henrique

    Source: Acta Mathematica Universitatis Comenianae. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DA COMPUTAÇÃO

    Versão PublicadaAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      HAN, Jie et al. On some extremal results for order types. Acta Mathematica Universitatis Comenianae, v. 88, n. 3, p. 779-785, 2019Tradução . . Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305. Acesso em: 05 ago. 2024.

    • APA

      Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). On some extremal results for order types. Acta Mathematica Universitatis Comenianae, 88( 3), 779-785. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305

    • NLM

      Han J, Kohayakawa Y, Sales MT, Stagni H. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.[citado 2024 ago. 05 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305

    • Vancouver

      Han J, Kohayakawa Y, Sales MT, Stagni H. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.[citado 2024 ago. 05 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305

  • Artigo de periodico

    Clique-factors in sparse pseudorandom graphs (2019)

    Han, Jie ; Kohayakawa, Yoshiharu ; Morris, Patrick; Person, Yury

    Source: European Journal of Combinatorics. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      HAN, Jie et al. Clique-factors in sparse pseudorandom graphs. European Journal of Combinatorics, v. 82, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2019.102999. Acesso em: 05 ago. 2024.

    • APA

      Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2019). Clique-factors in sparse pseudorandom graphs. European Journal of Combinatorics, 82. doi:10.1016/j.ejc.2019.102999

    • NLM

      Han J, Kohayakawa Y, Morris P, Person Y. Clique-factors in sparse pseudorandom graphs [Internet]. European Journal of Combinatorics. 2019 ; 82[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.ejc.2019.102999

    • Vancouver

      Han J, Kohayakawa Y, Morris P, Person Y. Clique-factors in sparse pseudorandom graphs [Internet]. European Journal of Combinatorics. 2019 ; 82[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.ejc.2019.102999

  • Trabalho de evento

    Extremal and probabilistic results for order types (2019)

    Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo T; Stagni, Henrique

    Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME

    Assunto: COMBINATÓRIA PROBABILÍSTICA

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      HAN, Jie et al. Extremal and probabilistic results for order types. 2019, Anais.. Philadelphia: SIAM, 2019. Disponível em: https://doi.org/10.1137/1.9781611975482.27. Acesso em: 05 ago. 2024.

    • APA

      Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). Extremal and probabilistic results for order types. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611975482.27

    • NLM

      Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1137/1.9781611975482.27

    • Vancouver

      Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1137/1.9781611975482.27

  • Artigo de periodico

    Universality for bounded degree spanning trees in randomly perturbed graphs (2019)

    Böttcher, Julia; Han, Jie ; Kohayakawa, Yoshiharu ; Montgomery, Richard ; Parczyk, Olaf ; Person, Yury

    Source: Random Structures & Algorithms. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

    Versão AceitaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BÖTTCHER, Julia et al. Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, v. 55, n. 4, p. 854-864, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20850. Acesso em: 05 ago. 2024.

    • APA

      Böttcher, J., Han, J., Kohayakawa, Y., Montgomery, R., Parczyk, O., & Person, Y. (2019). Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, 55( 4), 854-864. doi:10.1002/rsa.20850

    • NLM

      Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/rsa.20850

    • Vancouver

      Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/rsa.20850

  • Artigo de periodico

    Powers of tight Hamilton cycles in randomly perturbed hypergraphs (2019)

    Bedenknecht, Wiebke ; Han, Jie ; Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira

    Source: Random Structures & Algorithms. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      BEDENKNECHT, Wiebke et al. Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Structures & Algorithms, v. 55, n. 4, p. 795-807, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20885. Acesso em: 05 ago. 2024.

    • APA

      Bedenknecht, W., Han, J., Kohayakawa, Y., & Mota, G. O. (2019). Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Random Structures & Algorithms, 55( 4), 795-807. doi:10.1002/rsa.20885

    • NLM

      Bedenknecht W, Han J, Kohayakawa Y, Mota GO. Powers of tight Hamilton cycles in randomly perturbed hypergraphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 795-807.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/rsa.20885

    • Vancouver

      Bedenknecht W, Han J, Kohayakawa Y, Mota GO. Powers of tight Hamilton cycles in randomly perturbed hypergraphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 795-807.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/rsa.20885
  • 1

1 - 5 (5 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024