Filtros : "Electronic Notes in Discrete Mathematics" "IME" Removidos: "Mota, Guilherme Oliveira" "Queiroz, Marcelo Gomes de" "IFSC-FCM" Limpar

Filtros



Refine with date range


  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Discrete Mathematics Days 2018. 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 e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2018.06.038. Acesso em: 11 out. 2024. , 2018
    • APA

      Han, J., Kohayakawa, Y., & Person, Y. (2018). Near-perfect clique-factors in sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2018.06.038
    • NLM

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2018 ; 68 221-226.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2018.06.038
    • Vancouver

      Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2018 ; 68 221-226.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2018.06.038
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME

    Subjects: OTIMIZAÇÃ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

      CERIOLI, Márcia R et al. Transversals of longest paths. 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.2017.10.024. Acesso em: 11 out. 2024. , 2017
    • APA

      Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez, J., & Lima, P. T. (2017). Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.024
    • NLM

      Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
    • Vancouver

      Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME

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

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

      MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. 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.2017.10.017. Acesso em: 11 out. 2024. , 2017
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.017
    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME

    Subjects: MATEMÁTICA DISCRETA, 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, M. et al. On the number of r-transitive orientations of G (n, p). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.06.046. Acesso em: 11 out. 2024. , 2017
    • APA

      Collares, M., Kohayakawa, Y., Morris, R., & Mota, G. O. (2017). On the number of r-transitive orientations of G (n, p). Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.06.046
    • NLM

      Collares M, Kohayakawa Y, Morris R, Mota GO. On the number of r-transitive orientations of G (n, p) [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 255-261.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.06.046
    • Vancouver

      Collares M, Kohayakawa Y, Morris R, Mota GO. On the number of r-transitive orientations of G (n, p) [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 255-261.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.06.046
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB'17. Unidade: IME

    Assunto: MATEMÁTICA DISCRETA

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

      HOPPEN, Carlos et al. Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2017.07.014. Acesso em: 11 out. 2024. , 2017
    • APA

      Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2017). Estimating the distance to a hereditary graph property. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2017.07.014
    • NLM

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014
    • Vancouver

      Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating the distance to a hereditary graph property [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; 61 607-613.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.07.014
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA

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

      ALLEN, Peter et al. Triangle-free subgraphs of random graphs. 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.055. Acesso em: 11 out. 2024. , 2015
    • APA

      Allen, P., Bottcher, J., Roberts, B., & Kohayakawa, Y. (2015). Triangle-free subgraphs of random graphs. 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.055
    • NLM

      Allen P, Bottcher J, Roberts B, Kohayakawa Y. Triangle-free subgraphs of random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.055
    • Vancouver

      Allen P, Bottcher J, Roberts B, Kohayakawa Y. Triangle-free subgraphs of random graphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.055
  • 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

    Acesso à fonteDOIHow to cite
    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: 11 out. 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 out. 11 ] 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 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    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: 11 out. 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 out. 11 ] 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 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.019
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    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: 11 out. 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 out. 11 ] 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 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
  • 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

    Acesso à fonteDOIHow to cite
    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: 11 out. 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 out. 11 ] 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 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011
  • 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

    Acesso à fonteDOIHow to cite
    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: 11 out. 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 out. 11 ] 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 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS GEOMÉTRICOS, CINÉTICA

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

      FERNANDES, Cristina Gomes e OSHIRO, Marcio Takashi Iura. Trajectory clustering of points in R. 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.010. Acesso em: 11 out. 2024. , 2015
    • APA

      Fernandes, C. G., & Oshiro, M. T. I. (2015). Trajectory clustering of points in R. 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.010
    • NLM

      Fernandes CG, Oshiro MTI. Trajectory clustering of points in R [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 53-58.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.010
    • Vancouver

      Fernandes CG, Oshiro MTI. Trajectory clustering of points in R [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 53-58.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.010
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. 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

      ALLEN, Peter et al. An approximate blow-up lemma for sparse pseudorandom graphs. 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.2013.10.061. Acesso em: 11 out. 2024. , 2013
    • APA

      Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2013). An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.061
    • NLM

      Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. An approximate blow-up lemma for sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 44 393-398.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061
    • Vancouver

      Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. An approximate blow-up lemma for sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 44 393-398.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidades: EACH, IME

    Subjects: ALGORITMOS, POLIEDROS

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

      CAMPÊLO, Manoel et al. Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.036. Acesso em: 11 out. 2024. , 2013
    • APA

      Campêlo, M., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2013). Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.036
    • NLM

      Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
    • Vancouver

      Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Subjects: COMBINATÓRIA, PERMUTAÇÕES

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

      BASTOS, Antonio Josefran de Oliveira et al. Every hereditary permutation property is testable. 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.2011.09.021. Acesso em: 11 out. 2024. , 2011
    • APA

      Bastos, A. J. de O., Hoppen, C., Kohayakawa, Y., & Sampaio, R. M. (2011). Every hereditary permutation property is testable. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.09.021
    • NLM

      Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021
    • Vancouver

      Bastos AJ de O, Hoppen C, Kohayakawa Y, Sampaio RM. Every hereditary permutation property is testable [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 123-128.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.09.021
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      REZENDE, Susanna F. de et al. Intersection of longest paths in a graph. 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.2011.10.024. Acesso em: 11 out. 2024. , 2011
    • APA

      Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2011). Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.10.024
    • NLM

      Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
    • Vancouver

      Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: ALGORITMOS

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

      FERNANDES, Cristina Gomes et al. Selfish square packing. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2011.05.063. Acesso em: 11 out. 2024. , 2011
    • APA

      Fernandes, C. G., Ferreira, C. E., Miyazawa, F. K., & Wakabayashi, Y. (2011). Selfish square packing. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2011.05.063
    • NLM

      Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Selfish square packing [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 369-374.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.063
    • Vancouver

      Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Selfish square packing [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 369-374.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.063
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: LAGOS'11 – VI Latin-American Algorithms, Graphs and Optimization Symposium. Unidade: IME

    Assunto: PROGRAMAÇÃO DINÂMICA

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

      FERREIRA, Carlos Eduardo e FREIRE, A. S. e PUGLIA, G. A. A dynamic programming algorithm for the tree mapping problem. Electronic Notes in Discrete Mathematics, v. 37, p. 147-152, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.endm.2011.05.026. Acesso em: 11 out. 2024.
    • APA

      Ferreira, C. E., Freire, A. S., & Puglia, G. A. (2011). A dynamic programming algorithm for the tree mapping problem. Electronic Notes in Discrete Mathematics, 37, 147-152. doi:10.1016/j.endm.2011.05.026
    • NLM

      Ferreira CE, Freire AS, Puglia GA. A dynamic programming algorithm for the tree mapping problem [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 147-152.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.026
    • Vancouver

      Ferreira CE, Freire AS, Puglia GA. A dynamic programming algorithm for the tree mapping problem [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 147-152.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.026
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: OTIMIZAÇÃO COMBINATÓRIA

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

      FERNANDES, Cristina Gomes e STEIN, Maya. Stability in geodesics for memoryless binary long-lived consensus. 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.2011.05.060. Acesso em: 11 out. 2024. , 2011
    • APA

      Fernandes, C. G., & Stein, M. (2011). Stability in geodesics for memoryless binary long-lived consensus. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.05.060
    • NLM

      Fernandes CG, Stein M. Stability in geodesics for memoryless binary long-lived consensus [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 351-356.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.060
    • Vancouver

      Fernandes CG, Stein M. Stability in geodesics for memoryless binary long-lived consensus [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 351-356.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.060
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: ALGORITMOS

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

      LIMA, Karla Roberta e WAKABAYASHI, Yoshiko. Convex recoloring of paths. 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.2011.05.029. Acesso em: 11 out. 2024. , 2011
    • APA

      Lima, K. R., & Wakabayashi, Y. (2011). Convex recoloring of paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.05.029
    • NLM

      Lima KR, Wakabayashi Y. Convex recoloring of paths [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 165-170.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.029
    • Vancouver

      Lima KR, Wakabayashi Y. Convex recoloring of paths [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 165-170.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.029

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