ReP USP - Resultado da busca

Trabalho de evento
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (2015)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Fonte: Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Nome do evento: International Conference on Algorithms and Discrete Applied Mathematics - CALDAM. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-14974-5_2. Acesso em: 24 set. 2024.
APA
Ravelo, S. V., & Ferreira, C. E. (2015). A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. In Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-14974-5_2
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. 2015 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. 2015 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2
Trabalho de evento
PTAS’s for some metric p-source communication spanning tree problems (2015)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Fonte: Proceedings. Nome do evento: International Workshop on Algorithms and Computation - WALCOM. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. PTAS’s for some metric p-source communication spanning tree problems. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-15612-5_13. Acesso em: 24 set. 2024.
APA
Ravelo, S. V., & Ferreira, C. E. (2015). PTAS’s for some metric p-source communication spanning tree problems. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-15612-5_13
NLM
Ravelo SV, Ferreira CE. PTAS’s for some metric p-source communication spanning tree problems [Internet]. Proceedings. 2015 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
Vancouver
Ravelo SV, Ferreira CE. PTAS’s for some metric p-source communication spanning tree problems [Internet]. Proceedings. 2015 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
Trabalho de evento
The envy-free pricing problem and unit-demand markets (2014)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira; Schouery, Rafael Crivellari Saliba
Fonte: Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. Nome do evento: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, ALGORITMOS, REDES DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. The envy-free pricing problem and unit-demand markets. 2014, Anais.. Cham: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-319-09174-7_20. Acesso em: 24 set. 2024.
APA
Fernandes, C. G., Ferreira, C. E., Franco, Á. J. P., & Schouery, R. C. S. (2014). The envy-free pricing problem and unit-demand markets. In Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. Cham: Springer. doi:10.1007/978-3-319-09174-7_20
NLM
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem and unit-demand markets [Internet]. Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. 2014 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-319-09174-7_20
Vancouver
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem and unit-demand markets [Internet]. Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. 2014 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-319-09174-7_20
Parte de monografia/livro
Algorithms for junctions in acyclic digraphs (2013)
Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira
Fonte: Facets of combinatorial optimization. Unidade: IME
Assunto: OTIMIZAÇÃO 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. Algorithms for junctions in acyclic digraphs. Facets of combinatorial optimization. Tradução . Berlin: Springer, 2013. . Disponível em: https://doi.org/10.1007/978-3-642-38189-8_8. Acesso em: 24 set. 2024.
APA
Ferreira, C. E., & Franco, Á. J. P. (2013). Algorithms for junctions in acyclic digraphs. In Facets of combinatorial optimization. Berlin: Springer. doi:10.1007/978-3-642-38189-8_8
NLM
Ferreira CE, Franco ÁJP. Algorithms for junctions in acyclic digraphs [Internet]. In: Facets of combinatorial optimization. Berlin: Springer; 2013. [citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-642-38189-8_8
Vancouver
Ferreira CE, Franco ÁJP. Algorithms for junctions in acyclic digraphs [Internet]. In: Facets of combinatorial optimization. Berlin: Springer; 2013. [citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-642-38189-8_8
Trabalho de evento
Minimum ratio cover of matrix columns by extreme rays of its induced cone (2012)
Freire, Alexandre da Silva; Acuña, Vicente; Crescenzi, Pierluigi; Ferreira, Carlos Eduardo ; Lacroix, Vincent; Milreu, P. V; Moreno, E; Sagot, Marie-France
Fonte: Proceedings. Nome do evento: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FREIRE, Alexandre da Silva et al. Minimum ratio cover of matrix columns by extreme rays of its induced cone. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-32147-4_16. Acesso em: 24 set. 2024.
APA
Freire, A. da S., Acuña, V., Crescenzi, P., Ferreira, C. E., Lacroix, V., Milreu, P. V., et al. (2012). Minimum ratio cover of matrix columns by extreme rays of its induced cone. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-32147-4_16
NLM
Freire A da S, Acuña V, Crescenzi P, Ferreira CE, Lacroix V, Milreu PV, Moreno E, Sagot M-F. Minimum ratio cover of matrix columns by extreme rays of its induced cone [Internet]. Proceedings. 2012 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-642-32147-4_16
Vancouver
Freire A da S, Acuña V, Crescenzi P, Ferreira CE, Lacroix V, Milreu PV, Moreno E, Sagot M-F. Minimum ratio cover of matrix columns by extreme rays of its induced cone [Internet]. Proceedings. 2012 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-642-32147-4_16
Monografia/livro-ed/org
Advances in bioinformatics and computational biology (2010)
Ferreira, Carlos Eduardo (Editor) ; Miyano, Satoru (Editor); Stadler, Peter F. (Editor)
Nome do evento: Brazilian Symposium on Bioinformatics- BSB. Unidade: IME
Assuntos: INTELIGÊNCIA ARTIFICIAL, BIOINFORMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Advances in bioinformatics and computational biology. . Berlin: Springer. Disponível em: https://doi.org/10.1007/978-3-642-15060-9. Acesso em: 24 set. 2024. , 2010
APA
Advances in bioinformatics and computational biology. (2010). Advances in bioinformatics and computational biology. Berlin: Springer. doi:10.1007/978-3-642-15060-9
NLM
Advances in bioinformatics and computational biology [Internet]. 2010 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-642-15060-9
Vancouver
Advances in bioinformatics and computational biology [Internet]. 2010 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-642-15060-9
Trabalho de evento
A polyhedral investigation of the LCS problem and a repetition-free variant (2008)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko
Fonte: Proceedings. Nome do evento: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assuntos: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. A polyhedral investigation of the LCS problem and a repetition-free variant. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-78773-0_29. Acesso em: 24 set. 2024.
APA
Fernandes, C. G., Ferreira, C. E., Tjandraatmadja, C., & Wakabayashi, Y. (2008). A polyhedral investigation of the LCS problem and a repetition-free variant. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-78773-0_29
NLM
Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29
Vancouver
Fernandes CG, Ferreira CE, Tjandraatmadja C, Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant [Internet]. Proceedings. 2008 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29
Trabalho de evento
Gene prediction by syntenic alignment (2005)
Adi, Said Sadique ; Ferreira, Carlos Eduardo
Fonte: Proceedings. Nome do evento: Brazilian Symposium on Bioinformatics - BSB. Unidade: IME
Assuntos: SEQUENCIAMENTO GENÉTICO, COMPUTAÇÃO APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ADI, Said Sadique e FERREIRA, Carlos Eduardo. Gene prediction by syntenic alignment. 2005, Anais.. Berlin: Springer, 2005. Disponível em: https://doi.org/10.1007/11532323_34. Acesso em: 24 set. 2024.
APA
Adi, S. S., & Ferreira, C. E. (2005). Gene prediction by syntenic alignment. In Proceedings. Berlin: Springer. doi:10.1007/11532323_34
NLM
Adi SS, Ferreira CE. Gene prediction by syntenic alignment [Internet]. Proceedings. 2005 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/11532323_34
Vancouver
Adi SS, Ferreira CE. Gene prediction by syntenic alignment [Internet]. Proceedings. 2005 ;[citado 2024 set. 24 ] Available from: https://doi.org/10.1007/11532323_34

Unidades USP

ReP

Filtros

Autores

Autores USP

Ano de publicação

Assuntos

Nome do evento

Agência de fomento

Afiliação dos autores externos não normalizada

País das instituições de afiliação dos autores externos