Filtros : "Kohayakawa, Yoshiharu" Limpar

Filtros



Refine with date range


  • Source: Journal of Graph Theory. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      HAN, Jie; KOHAYAKAWA, Yoshiharu; MORRIS, Patrick; PERSON, Yury. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, New York, v. 96, n. 1, p. 87-108, 2021. Disponível em: < http://dx.doi.org/10.1002/jgt.22576 > DOI: 10.1002/jgt.22576.
    • APA

      Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2021). Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96( 1), 87-108. doi:10.1002/jgt.22576
    • NLM

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.Available from: http://dx.doi.org/10.1002/jgt.22576
    • Vancouver

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.Available from: http://dx.doi.org/10.1002/jgt.22576
  • Source: Random Structures & Algorithms. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

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

      COLLARES, Maurício; KOHAYAKAWA, Yoshiharu; MORRIS, Robert; MOTA, Guilherme Oliveira. Counting restricted orientations of random graphs. Random Structures & Algorithms, Hoboken, v. 56, n. 4, p. 1016-1030, 2020. Disponível em: < https://doi.org/10.1002/rsa.20904 > DOI: 10.1002/rsa.20904.
    • APA

      Collares, M., Kohayakawa, Y., Morris, R., & Mota, G. O. (2020). Counting restricted orientations of random graphs. Random Structures & Algorithms, 56( 4), 1016-1030. doi:10.1002/rsa.20904
    • NLM

      Collares M, Kohayakawa Y, Morris R, Mota GO. Counting restricted orientations of random graphs [Internet]. Random Structures & Algorithms. 2020 ; 56( 4): 1016-1030.Available from: https://doi.org/10.1002/rsa.20904
    • Vancouver

      Collares M, Kohayakawa Y, Morris R, Mota GO. Counting restricted orientations of random graphs [Internet]. Random Structures & Algorithms. 2020 ; 56( 4): 1016-1030.Available from: https://doi.org/10.1002/rsa.20904
  • Conference titles: Latin American Symposium - LATIN. Unidade: IME

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

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

      KOHAYAKAWA, Yoshiharu; MIYAZAWA, Flavio Keidi. LATIN 2020: theoretical informatics. [S.l: s.n.], 2020.Disponível em: DOI: 10.1007/978-3-030-61792-9.
    • APA

      Kohayakawa, Y., & Miyazawa, F. K. (2020). LATIN 2020: theoretical informatics. Cham: Springer. doi:10.1007/978-3-030-61792-9
    • NLM

      Kohayakawa Y, Miyazawa FK. LATIN 2020: theoretical informatics [Internet]. 2020 ;Available from: https://doi.org/10.1007/978-3-030-61792-9
    • Vancouver

      Kohayakawa Y, Miyazawa FK. LATIN 2020: theoretical informatics [Internet]. 2020 ;Available from: https://doi.org/10.1007/978-3-030-61792-9
  • Source: Journal of Combinatorial Theory, Series B. 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

      HAN, Jie; JENSSEN, Matthew; KOHAYAKAWA, Yoshiharu; MOTA, Guilherme Oliveira; ROBERTS, Barnaby. The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, New York, v. 145, p. 359-375, 2020. Disponível em: < https://doi.org/10.1016/j.jctb.2020.06.004 > DOI: 10.1016/j.jctb.2020.06.004.
    • APA

      Han, J., Jenssen, M., Kohayakawa, Y., Mota, G. O., & Roberts, B. (2020). The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, 145, 359-375. doi:10.1016/j.jctb.2020.06.004
    • NLM

      Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.Available from: https://doi.org/10.1016/j.jctb.2020.06.004
    • Vancouver

      Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.Available from: https://doi.org/10.1016/j.jctb.2020.06.004
  • Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

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

      COUTINHO, Gabriel; KOHAYAKAWA, Yoshiharu; SANTOS, Vinicius dos; URRUTIA, Sebastião. Electronic Notes in Theoretical Computer Science. [S.l: s.n.], 2020.Disponível em: .
    • APA

      Coutinho, G., Kohayakawa, Y., Santos, V. dos, & Urrutia, S. (2020). Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/electronic-notes-in-theoretical-computer-science/vol/346/suppl/C
    • NLM

      Coutinho G, Kohayakawa Y, Santos V dos, Urrutia S. Electronic Notes in Theoretical Computer Science [Internet]. 2020 ; 346 1-758.Available from: https://www.sciencedirect.com/journal/electronic-notes-in-theoretical-computer-science/vol/346/suppl/C
    • Vancouver

      Coutinho G, Kohayakawa Y, Santos V dos, Urrutia S. Electronic Notes in Theoretical Computer Science [Internet]. 2020 ; 346 1-758.Available from: https://www.sciencedirect.com/journal/electronic-notes-in-theoretical-computer-science/vol/346/suppl/C
  • Source: Communications of the ACM. Unidade: IME

    Assunto: CIÊNCIA DA COMPUTAÇÃO

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

      KIWI, Marcos; KOHAYAKAWA, Yoshiharu; RAJSBAUM, Sergio; et al. A perspective on theoretical computer science in Latin America. Communications of the ACM, New York, v. 63, n. 11, p. 102-107, 2020. Disponível em: < https://doi.org/10.1145/3419975 > DOI: 10.1145/3419975.
    • APA

      Kiwi, M., Kohayakawa, Y., Rajsbaum, S., Rodríguez-Henríquez, F., Szwarcfiter, J. L., & Viola, A. (2020). A perspective on theoretical computer science in Latin America. Communications of the ACM, 63( 11), 102-107. doi:10.1145/3419975
    • NLM

      Kiwi M, Kohayakawa Y, Rajsbaum S, Rodríguez-Henríquez F, Szwarcfiter JL, Viola A. A perspective on theoretical computer science in Latin America [Internet]. Communications of the ACM. 2020 ; 63( 11): 102-107.Available from: https://doi.org/10.1145/3419975
    • Vancouver

      Kiwi M, Kohayakawa Y, Rajsbaum S, Rodríguez-Henríquez F, Szwarcfiter JL, Viola A. A perspective on theoretical computer science in Latin America [Internet]. Communications of the ACM. 2020 ; 63( 11): 102-107.Available from: https://doi.org/10.1145/3419975
  • Unidade: IME

    Assunto: COMBINATÓRIA PROBABILÍSTICA

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

      CAVALAR, Bruno Pasqualotto; KOHAYAKAWA, Yoshiharu. Sunflowers theorems in computational complexity. 2020.Universidade de São Paulo, São Paulo, 2020. Disponível em: < https://www.teses.usp.br/teses/disponiveis/45/45134/tde-25112020-162107/ >.
    • APA

      Cavalar, B. P., & Kohayakawa, Y. (2020). Sunflowers theorems in computational complexity. Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/45/45134/tde-25112020-162107/
    • NLM

      Cavalar BP, Kohayakawa Y. Sunflowers theorems in computational complexity [Internet]. 2020 ;Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-25112020-162107/
    • Vancouver

      Cavalar BP, Kohayakawa Y. Sunflowers theorems in computational complexity [Internet]. 2020 ;Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-25112020-162107/
  • Source: Combinatorics, Probability and Computing. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA

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

      HAN, Jie; KOHAYAKAWA, Yoshiharu; PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability and Computing, Cambridge, 2020. Disponível em: < https://doi.org/10.1017/S0963548320000577 > DOI: 10.1017/S0963548320000577.
    • APA

      Han, J., Kohayakawa, Y., & Person, Y. (2020). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability and Computing. doi:10.1017/S0963548320000577
    • NLM

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability and Computing. 2020 ;Available from: https://doi.org/10.1017/S0963548320000577
    • Vancouver

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability and Computing. 2020 ;Available from: https://doi.org/10.1017/S0963548320000577
  • Source: LATIN 2020 : theoretical informatics. Conference titles: Latin American Symposium - LATIN. Unidade: IME

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

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu; MIYAZAWA, Flavio Keidi. We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics[S.l: s.n.], 2020.
    • APA

      Kohayakawa, Y., & Miyazawa, F. K. (2020). We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. Cham: Springer.
    • NLM

      Kohayakawa Y, Miyazawa FK. We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. 2020 ;
    • Vancouver

      Kohayakawa Y, Miyazawa FK. We are very pleased to present this volume with the papers accepted to the 14th Latin American Theoretical INformatics Symposium. [Prefácio]. LATIN 2020 : theoretical informatics. 2020 ;
  • Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      STAGNI, Henrique; KOHAYAKAWA, Yoshiharu. Property testing and parameter estimation. 2020.Universidade de São Paulo, São Paulo, 2020. Disponível em: < https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/ >.
    • APA

      Stagni, H., & Kohayakawa, Y. (2020). Property testing and parameter estimation. Universidade de São Paulo, São Paulo. Recuperado de https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/
    • NLM

      Stagni H, Kohayakawa Y. Property testing and parameter estimation [Internet]. 2020 ;Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/
    • Vancouver

      Stagni H, Kohayakawa Y. Property testing and parameter estimation [Internet]. 2020 ;Available from: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-11022021-194125/
  • Source: Combinatorics, Probability and Computing. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, ALGORITMOS PARA PROCESSAMENTO

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

      HOPPEN, Carlos; KOHAYAKAWA, Yoshiharu; LANG, Richard; LEFMANN, Hanno; STAGNI, Henrique. Estimating parameters associated with monotone properties. Combinatorics, Probability and Computing, Cambridge, v. 29, n. 4, p. 616-632, 2020. Disponível em: < https://doi.org/10.1017/S0963548320000048 > DOI: 10.1017/S0963548320000048.
    • APA

      Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2020). Estimating parameters associated with monotone properties. Combinatorics, Probability and Computing, 29( 4), 616-632. doi:10.1017/S0963548320000048
    • NLM

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability and Computing. 2020 ; 29( 4): 616-632.Available from: https://doi.org/10.1017/S0963548320000048
    • Vancouver

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability and Computing. 2020 ; 29( 4): 616-632.Available from: https://doi.org/10.1017/S0963548320000048
  • Source: Journal of the London Mathematical Society. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      BERGER, Sören; KOHAYAKAWA, Yoshiharu; MAESAKA, Giulia Satiko; et al. The size‐Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, Chichester, 2020. Disponível em: < https://doi.org/10.1112/jlms.12408 > DOI: 10.1112/jlms.12408.
    • APA

      Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., & Parczyk, O. (2020). The size‐Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society. doi:10.1112/jlms.12408
    • NLM

      Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size‐Ramsey number of powers of bounded degree trees [Internet]. Journal of the London Mathematical Society. 2020 ;Available from: https://doi.org/10.1112/jlms.12408
    • Vancouver

      Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size‐Ramsey number of powers of bounded degree trees [Internet]. Journal of the London Mathematical Society. 2020 ;Available from: https://doi.org/10.1112/jlms.12408
  • Source: Anais. Conference titles: Encontro de Teoria da Computação - ETC. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS

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

      BOTLER, Fábio Happ; COLUCCI, Lucas; KOHAYAKAWA, Yoshiharu. The odd chromatic index of almost all graphs. Anais.. Porto Alegre: SBC, 2020.Disponível em: DOI: 10.5753/etc.2020.11087.
    • APA

      Botler, F. H., Colucci, L., & Kohayakawa, Y. (2020). The odd chromatic index of almost all graphs. In Anais. Porto Alegre: SBC. doi:10.5753/etc.2020.11087
    • NLM

      Botler FH, Colucci L, Kohayakawa Y. The odd chromatic index of almost all graphs [Internet]. Anais. 2020 ;Available from: https://doi.org/10.5753/etc.2020.11087
    • Vancouver

      Botler FH, Colucci L, Kohayakawa Y. The odd chromatic index of almost all graphs [Internet]. Anais. 2020 ;Available from: https://doi.org/10.5753/etc.2020.11087
  • 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; KOHAYAKAWA, Yoshiharu; MORRIS, Patrick; PERSON, Yury. Clique-factors in sparse pseudorandom graphs. European Journal of Combinatorics, London, Academic Press, v. 82, 2019. Disponível em: < https://doi.org/10.1016/j.ejc.2019.102999 > DOI: 10.1016/j.ejc.2019.102999.
    • 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 ; 82Available 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 ; 82Available from: https://doi.org/10.1016/j.ejc.2019.102999
  • 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; STAGNI, Henrique; KOHAYAKAWA, Yoshiharu; SALES, Marcelo Tadeu. On some extremal results for order types. Acta Mathematica Universitatis Comenianae, Bratislava, v. 88, n. 3, p. 779-785, 2019. Disponível em: < http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305 >.
    • APA

      Han, J., Stagni, H., Kohayakawa, Y., & Sales, M. T. (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, Stagni H, Kohayakawa Y, Sales MT. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
    • Vancouver

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

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

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

      KOHAYAKAWA, Yoshiharu; MENDONÇA, Walner; MOTA, Guilherme; SCHÜLKE, Bjarne. Covering 3-coloured random graphs with monochromatic trees. Acta mathematica universitatis comenianae, Bratislava, v. 88, n. 3, p. 871-875, 2019. Disponível em: < http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310 >.
    • APA

      Kohayakawa, Y., Mendonça, W., Mota, G., & Schülke, B. (2019). Covering 3-coloured random graphs with monochromatic trees. Acta mathematica universitatis comenianae, 88( 3), 871-875. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310
    • NLM

      Kohayakawa Y, Mendonça W, Mota G, Schülke B. Covering 3-coloured random graphs with monochromatic trees [Internet]. Acta mathematica universitatis comenianae. 2019 ; 88( 3): 871-875.Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310
    • Vancouver

      Kohayakawa Y, Mendonça W, Mota G, Schülke B. Covering 3-coloured random graphs with monochromatic trees [Internet]. Acta mathematica universitatis comenianae. 2019 ; 88( 3): 871-875.Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310
  • Source: Journal of Graph Theory. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

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

      CLEMENS, Dennis; JENSSEN, Matthew; KOHAYAKAWA, Yoshiharu; et al. The size-Ramsey number of powers of paths. Journal of Graph Theory, Hoboken, v. 91, n. 3, p. 290-299, 2019. Disponível em: < http://dx.doi.org/10.1002/jgt.22432 > DOI: 10.1002/jgt.22432.
    • APA

      Clemens, D., Jenssen, M., Kohayakawa, Y., Morrison, N., Mota, G. O., Reding, D., & Roberts, B. (2019). The size-Ramsey number of powers of paths. Journal of Graph Theory, 91( 3), 290-299. doi:10.1002/jgt.22432
    • NLM

      Clemens D, Jenssen M, Kohayakawa Y, Morrison N, Mota GO, Reding D, Roberts B. The size-Ramsey number of powers of paths [Internet]. Journal of Graph Theory. 2019 ; 91( 3): 290-299.Available from: http://dx.doi.org/10.1002/jgt.22432
    • Vancouver

      Clemens D, Jenssen M, Kohayakawa Y, Morrison N, Mota GO, Reding D, Roberts B. The size-Ramsey number of powers of paths [Internet]. Journal of Graph Theory. 2019 ; 91( 3): 290-299.Available from: http://dx.doi.org/10.1002/jgt.22432
  • 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; KOHAYAKAWA, Yoshiharu; SALES, Marcelo T; STAGNI, Henrique. Extremal and probabilistic results for order types. Anais.. Philadelphia: SIAM, 2019.Disponível em: DOI: 10.1137/1.9781611975482.27.
    • 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 ;Available from: http://dx.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 ;Available from: http://dx.doi.org/10.1137/1.9781611975482.27
  • Source: Electronic Notes in Theoretical Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. 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

      COUTINHO, Gabriel; KOHAYAKAWA, Yoshiharu; SANTOS, Vinicius dos; URRUTIA, Sebastián. We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science[S.l: s.n.], 2019.Disponível em: DOI: 10.1016/j.entcs.2019.08.001.
    • APA

      Coutinho, G., Kohayakawa, Y., Santos, V. dos, & Urrutia, S. (2019). We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio]. Electronic Notes in Theoretical Computer Science. Amsterdam. doi:10.1016/j.entcs.2019.08.001
    • NLM

      Coutinho G, Kohayakawa Y, Santos V dos, Urrutia S. We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.Available from: https://doi.org/10.1016/j.entcs.2019.08.001
    • Vancouver

      Coutinho G, Kohayakawa Y, Santos V dos, Urrutia S. We are happy to organize this issue of the Electronic Notes in Theoretical Computer Science. [Prefácio] [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 1-2.Available from: https://doi.org/10.1016/j.entcs.2019.08.001
  • Source: Mathematical Proceedings of the Cambridge Philosophical Society. Unidade: IME

    Subjects: GRAFOS ALEATÓRIOS, 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

      KOHAYAKAWA, Yoshiharu; SCHACHT, Mathias; MOTA, Guilherme Oliveira. Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, Cambridge, v. 166, n. 1, p. 191-208, 2019. Disponível em: < https://dx.doi.org/10.1017/S0305004117000846 > DOI: 10.1017/S0305004117000846.
    • APA

      Kohayakawa, Y., Schacht, M., & Mota, G. O. (2019). Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 166( 1), 191-208. doi:10.1017/S0305004117000846
    • NLM

      Kohayakawa Y, Schacht M, Mota GO. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.Available from: https://dx.doi.org/10.1017/S0305004117000846
    • Vancouver

      Kohayakawa Y, Schacht M, Mota GO. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.Available from: https://dx.doi.org/10.1017/S0305004117000846

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