ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Two-and three-dimensional parametric packing (2005)
Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Subjects: COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Two-and three-dimensional parametric 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/j.cor.2005.10.001. Acesso em: 19 abr. 2024. , 2005
APA
Miyazawa, F. K., & Wakabayashi, Y. (2005). Two-and three-dimensional parametric packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.cor.2005.10.001
NLM
Miyazawa FK, Wakabayashi Y. Two-and three-dimensional parametric packing [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 313-319.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Vancouver
Miyazawa FK, Wakabayashi Y. Two-and three-dimensional parametric packing [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 313-319.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Trabalho de evento-anais periodico
The 3-colored Ramsey number of odd cycles (2005)
Kohayakawa, Yoshiharu ; Simonovits, Maklós; Skokan, Jozef
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e SIMONOVITS, Maklós e SKOKAN, Jozef. The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.053. Acesso em: 19 abr. 2024. , 2005
APA
Kohayakawa, Y., Simonovits, M., & Skokan, J. (2005). The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.053
NLM
Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053
Vancouver
Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053
Editor de periodico
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics (2005)
Feofiloff, Paulo (Editor) ; Figueiredo, Celina Miraglia Herrera de (Editor); Wakabayashi, Yoshiko (Editor)
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C. Acesso em: 19 abr. 2024. , 2005
APA
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. (2005). Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
NLM
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-416.[citado 2024 abr. 19 ] Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
Vancouver
Proceedings of GRACO 2005: the 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 1-416.[citado 2024 abr. 19 ] Available from: https://www.sciencedirect.com/journal/electronic-notes-in-discrete-mathematics/vol/19/suppl/C
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
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: 19 abr. 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 abr. 19 ] 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 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.002
Editor de periodico
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics (2008)
Feofiloff, Paulo (Editor) ; Figueiredo, Celina Miraglia Herrera de (Editor); Wakabayashi, Yoshiko (Editor)
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7. Acesso em: 19 abr. 2024. , 2008
APA
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. (2008). GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Discrete Applied Mathematics. Amsterdam: Elsevier. Recuperado de https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
NLM
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.[citado 2024 abr. 19 ] Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
Vancouver
GRACO 2005: 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985-1180.[citado 2024 abr. 19 ] Available from: https://www.sciencedirect.com/journal/discrete-applied-mathematics/vol/156/issue/7
Trabalho de evento-anais periodico
Bounds for optimal coverings (2004)
Moreira, Carlos Gustavo Tamm de Araujo; Kohayakawa, Yoshiharu
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: COMBINATÓRIA
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. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/S0166-218X(03)00372-X. Acesso em: 19 abr. 2024. , 2004
APA
Moreira, C. G. T. de A., & Kohayakawa, Y. (2004). Bounds for optimal coverings. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S0166-218X(03)00372-X
NLM
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 263-276.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/S0166-218X(03)00372-X
Vancouver
Moreira CGT de A, Kohayakawa Y. Bounds for optimal coverings [Internet]. Discrete Applied Mathematics. 2004 ; 141( 1-3): 263-276.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/S0166-218X(03)00372-X
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2008)
Alves, C. E. R.; Cáceres, Edson Norberto; Song, Siang Wun
Source: Discrete Applied Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, C. E. R. e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2007.05.056. Acesso em: 19 abr. 2024. , 2008
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2008). An all-substrings common subsequence algorithm. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2007.05.056
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 1025-1035.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.dam.2007.05.056
Trabalho de evento-anais periodico
An all-substrings common subsequence algorithm (2005)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.019. Acesso em: 19 abr. 2024. , 2005
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2005). An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.019
NLM
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019
Vancouver
Alves CER, Cáceres EN, Song SW. An all-substrings common subsequence algorithm [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 133-139.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.019

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation