Menu

Filtros : "IME" "Electronic Notes in Discrete Mathematics" Removidos: "FFLCH-FLL" "Canadá" "Financiado pela Russian Science Foundation" Limpar

Filtros

Refine with date range

41 - 48 (48 records)

  • Artigo de periodico-apres/intr

    Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface] (2005)

    Feofiloff, Paulo ; Figueiredo, Celina Miraglia Herrera de; Wakabayashi, Yoshiko

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

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

    • ABNT

      FEOFILOFF, Paulo e FIGUEIREDO, Celina Miraglia Herrera de e WAKABAYASHI, Yoshiko. Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface]. 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.2005.05.002. Acesso em: 20 jun. 2024. , 2005

    • APA

      Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2005). Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface]. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2005.05.002

    • NLM

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface] [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-7.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/j.endm.2005.05.002

    • Vancouver

      Feofiloff P, Figueiredo CMH de, Wakabayashi Y. Proceedings of GRACO 2005 the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. [Preface] [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-7.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/j.endm.2005.05.002

  • Trabalho de evento-anais periodico

    Approximation results on balanced connected partitions of graphs (2004)

    Salgado, Liliane Rose Benning; Wakabayashi, Yoshiko

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Conference on Combinatorics,Graphs and Applications. 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

      SALGADO, Liliane Rose Benning e WAKABAYASHI, Yoshiko. Approximation results on balanced connected partitions of 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.2004.06.033. Acesso em: 20 jun. 2024. , 2004

    • APA

      Salgado, L. R. B., & Wakabayashi, Y. (2004). Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2004.06.033

    • NLM

      Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033

    • Vancouver

      Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033

  • 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

    Acesso à fonteHow to cite
    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: 20 jun. 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 jun. 20 ] 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 jun. 20 ] Available from: https://ac.els-cdn.com/S1571065304010777/1-s2.0-S1571065304010777-main.pdf?_tid=1046cc39-8b62-42ac-8c82-0d12a4a3b60a&acdnat=1550077205_9203d72abd9919df0e4031f52940c0a3

  • Trabalho de evento-anais periodico

    Multidimensional cube packing (2001)

    Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Raghavan, Prabhakar; Wakabayashi, Yoshiko

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, 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

      KOHAYAKAWA, Yoshiharu et al. Multidimensional cube packing. 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/S1571-0653(04)00237-9. Acesso em: 20 jun. 2024. , 2001

    • APA

      Kohayakawa, Y., Miyazawa, F. K., Raghavan, P., & Wakabayashi, Y. (2001). Multidimensional cube packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00237-9

    • NLM

      Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9

    • Vancouver

      Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9

  • Trabalho de evento-anais periodico

    Scheduling with duplication on m processors with small communication delays (2001)

    Goldman, Alfredo ; Rapine, Christophe

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME

    Assunto: SCHEDULING

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

    • ABNT

      GOLDMAN, Alfredo e RAPINE, Christophe. Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/S1571-0653(04)00255-0. Acesso em: 20 jun. 2024. , 2001

    • APA

      Goldman, A., & Rapine, C. (2001). Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/S1571-0653(04)00255-0

    • NLM

      Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0

    • Vancouver

      Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0

  • Trabalho de evento-anais periodico

    Bounds for optimal coverings (2001)

    Moreira, Carlos Gustavo Tamm de Araujo; Kohayakawa, Yoshiharu

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME

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

    PrivadoAcesso à fonteDOIHow to cite
    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. 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/S1571-0653(04)00225-2. Acesso em: 20 jun. 2024. , 2001

    • APA

      Moreira, C. G. T. de A., & Kohayakawa, Y. (2001). Bounds for optimal coverings. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00225-2

    • NLM

      Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 62-65.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00225-2

    • Vancouver

      Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 62-65.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00225-2

  • Trabalho de evento-anais periodico

    Multicuts in unweighted digraphs with bounded degree and bounded tree-width (2001)

    Calinescu, Gruia ; Fernandes, Cristina Gomes

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME

    Assunto: ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      CALINESCU, Gruia e FERNANDES, Cristina Gomes. Multicuts in unweighted digraphs with bounded degree and 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/S1571-0653(04)00258-6. Acesso em: 20 jun. 2024. , 2001

    • APA

      Calinescu, G., & Fernandes, C. G. (2001). Multicuts in unweighted digraphs with bounded degree and bounded tree-width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00258-6

    • NLM

      Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6

    • Vancouver

      Calinescu G, Fernandes CG. Multicuts in unweighted digraphs with bounded degree and bounded tree-width [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 194-197.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00258-6

  • Trabalho de evento-anais periodico

    DNA fragments assembly programs: a comparative study (2001)

    Adi, Said Sadique ; Ferreira, Carlos Eduardo

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME

    Subjects: BIOINFORMÁTICA, DNA

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

    • ABNT

      ADI, Said Sadique e FERREIRA, Carlos Eduardo. DNA fragments assembly programs: a comparative study. 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/S1571-0653(04)00249-5. Acesso em: 20 jun. 2024. , 2001

    • APA

      Adi, S. S., & Ferreira, C. E. (2001). DNA fragments assembly programs: a comparative study. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00249-5

    • NLM

      Adi SS, Ferreira CE. DNA fragments assembly programs: a comparative study [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 158-161.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00249-5

    • Vancouver

      Adi SS, Ferreira CE. DNA fragments assembly programs: a comparative study [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 158-161.[citado 2024 jun. 20 ] Available from: https://doi.org/10.1016/S1571-0653(04)00249-5

41 - 48 (48 records)

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