ReP USP - Resultado da busca

Trabalho de evento-anais periodico
A min-max relation in flowgraphs (2015)
Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
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
Trabalho de evento-anais periodico
Selfish square packing (2011)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Miyazawa, Flavio Keidi; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: ALGORITMOS
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
Artigo de periodico
A dynamic programming algorithm for the tree mapping problem (2011)
Ferreira, Carlos Eduardo ; Freire, A. S.; Puglia, G. A.
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
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
Trabalho de evento-anais periodico
A branch-and-cut approach to the repetition-free longest common subsequence problem (2010)
Ferreira, Carlos Eduardo ; Tjandraatmadja, Christian
Source: Electronic Notes in Discrete Mathematics. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e TJANDRAATMADJA, Christian. A branch-and-cut approach to the repetition-free longest common subsequence problem. 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.2010.05.067. Acesso em: 11 out. 2024. , 2010
APA
Ferreira, C. E., & Tjandraatmadja, C. (2010). A branch-and-cut approach to the repetition-free longest common subsequence problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2010.05.067
NLM
Ferreira CE, Tjandraatmadja C. A branch-and-cut approach to the repetition-free longest common subsequence problem [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 527-534.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2010.05.067
Vancouver
Ferreira CE, Tjandraatmadja C. A branch-and-cut approach to the repetition-free longest common subsequence problem [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 527-534.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2010.05.067
Trabalho de evento-anais periodico
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (2010)
Acuña, V.; Ferreira, Carlos Eduardo ; Freire, A. S.; Moreno, Eduardo
Source: Electronic Notes in Discrete Mathematics. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ACUÑA, V. et al. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. 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.2010.05.021. Acesso em: 11 out. 2024. , 2010
APA
Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2010). The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2010.05.021
NLM
Acuña V, Ferreira CE, Freire AS, Moreno E. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 159-166.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2010.05.021
Vancouver
Acuña V, Ferreira CE, Freire AS, Moreno E. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 159-166.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2010.05.021
Trabalho de evento-anais periodico
Repetition-free longest common subsequence (2008)
Adi, Said Sadique ; Braga, Marilia D. V. ; Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Martinez, Fábio Henrique Viduani ; Sagot, Marie France ; Stefanes, Marco Aurélio ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ADI, Said Sadique et al. Repetition-free longest common subsequence. 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.2008.01.042. Acesso em: 11 out. 2024. , 2008
APA
Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. F., et al. (2008). Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2008.01.042
NLM
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot MF, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Electronic Notes in Discrete Mathematics. 2008 ; 30 243-248.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2008.01.042
Vancouver
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot MF, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Electronic Notes in Discrete Mathematics. 2008 ; 30 243-248.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2008.01.042
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
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: 11 out. 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 out. 11 ] 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 out. 11 ] 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
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: 11 out. 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 out. 11 ] 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 out. 11 ] Available from: https://doi.org/10.1016/S1571-0653(04)00249-5

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Conference titles

Funding Agencies

Non normalized affiliation