ReP USP - Resultado da busca

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
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: 06 nov. 2025. , 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 2025 nov. 06 ] 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 2025 nov. 06 ] 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
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: 06 nov. 2025. , 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 2025 nov. 06 ] 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 2025 nov. 06 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0
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
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: 06 nov. 2025. , 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 2025 nov. 06 ] 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 2025 nov. 06 ] 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
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: 06 nov. 2025. , 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 2025 nov. 06 ] 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 2025 nov. 06 ] Available from: https://doi.org/10.1016/S1571-0653(04)00249-5

USP Schools

ReP

Filtros

Authors

USP affiliated authors