ReP USP - Resultado da busca

Artigo de periodico-carta/editorial
Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial] (2023)
Ferreira, Carlos Eduardo ; Miyazawa, Flavio Keidi ; Lee, Orlando
Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e MIYAZAWA, Flavio Keidi e LEE, Orlando. Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial]. 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.2023.08.024. Acesso em: 03 jun. 2024. , 2023
APA
Ferreira, C. E., Miyazawa, F. K., & Lee, O. (2023). Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2023.08.024
NLM
Ferreira CE, Miyazawa FK, Lee O. Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial] [Internet]. Discrete Applied Mathematics. 2023 ; 341 393.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2023.08.024
Vancouver
Ferreira CE, Miyazawa FK, Lee O. Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial] [Internet]. Discrete Applied Mathematics. 2023 ; 341 393.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2023.08.024
Editor de periodico
Procedia Computer Science (2021)
Ferreira, Carlos Eduardo (Editor) ; Lee, Orlando (Editor) ; Miyazawa, Flavio Keidi (Editor)
Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Procedia Computer Science. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C. Acesso em: 03 jun. 2024. , 2021
APA
Procedia Computer Science. (2021). Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C
NLM
Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2024 jun. 03 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C
Vancouver
Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2024 jun. 03 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C
Artigo de periodico-apres/intr
Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial] (2021)
Ferreira, Carlos Eduardo ; Lee, Orlando ; Miyazawa, Flavio Keidi (Editor)
Source: Procedia Computer Science. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e LEE, Orlando. Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial]. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2021.11.005. Acesso em: 03 jun. 2024. , 2021
APA
Ferreira, C. E., & Lee, O. (2021). Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial]. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.005
NLM
Ferreira CE, Lee O. Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial] [Internet]. Procedia Computer Science. 2021 ; 195 5-11.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.procs.2021.11.005
Vancouver
Ferreira CE, Lee O. Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial] [Internet]. Procedia Computer Science. 2021 ; 195 5-11.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.procs.2021.11.005
Artigo de periodico
An efficient, parallelized algorithm for optimal conditional entropy-based feature selection (2020)
Estrela, Gustavo ; Gubitoso, Marco Dimas ; Ferreira, Carlos Eduardo ; Barrera, Júnior; Reis, Marcelo da Silva
Source: Entropy. Unidade: IME
Assunto: TEORIA DA INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ESTRELA, Gustavo et al. An efficient, parallelized algorithm for optimal conditional entropy-based feature selection. Entropy, v. 22, n. 4, p. 1-20, 2020Tradução . . Disponível em: https://doi.org/10.3390/e22040492. Acesso em: 03 jun. 2024.
APA
Estrela, G., Gubitoso, M. D., Ferreira, C. E., Barrera, J., & Reis, M. da S. (2020). An efficient, parallelized algorithm for optimal conditional entropy-based feature selection. Entropy, 22( 4), 1-20. doi:10.3390/e22040492
NLM
Estrela G, Gubitoso MD, Ferreira CE, Barrera J, Reis M da S. An efficient, parallelized algorithm for optimal conditional entropy-based feature selection [Internet]. Entropy. 2020 ; 22( 4): 1-20.[citado 2024 jun. 03 ] Available from: https://doi.org/10.3390/e22040492
Vancouver
Estrela G, Gubitoso MD, Ferreira CE, Barrera J, Reis M da S. An efficient, parallelized algorithm for optimal conditional entropy-based feature selection [Internet]. Entropy. 2020 ; 22( 4): 1-20.[citado 2024 jun. 03 ] Available from: https://doi.org/10.3390/e22040492
Artigo de periodico
Optimal Boolean lattice-based algorithms for the U-curve optimization problem (2019)
Reis, Marcelo da Silva ; Estrela, Gustavo; Ferreira, Carlos Eduardo ; Barrera, Junior
Source: Information Sciences. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REIS, Marcelo da Silva et al. Optimal Boolean lattice-based algorithms for the U-curve optimization problem. Information Sciences, v. 471, p. 97-114, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ins.2018.08.060. Acesso em: 03 jun. 2024.
APA
Reis, M. da S., Estrela, G., Ferreira, C. E., & Barrera, J. (2019). Optimal Boolean lattice-based algorithms for the U-curve optimization problem. Information Sciences, 471, 97-114. doi:10.1016/j.ins.2018.08.060
NLM
Reis M da S, Estrela G, Ferreira CE, Barrera J. Optimal Boolean lattice-based algorithms for the U-curve optimization problem [Internet]. Information Sciences. 2019 ; 471 97-114.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.ins.2018.08.060
Vancouver
Reis M da S, Estrela G, Ferreira CE, Barrera J. Optimal Boolean lattice-based algorithms for the U-curve optimization problem [Internet]. Information Sciences. 2019 ; 471 97-114.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.ins.2018.08.060
Artigo de periodico
A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem (2019)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
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 optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, v. 771, p. 9-22, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2018.11.008. Acesso em: 03 jun. 2024.
APA
Ravelo, S. V., & Ferreira, C. E. (2019). A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, 771, 9-22. doi:10.1016/j.tcs.2018.11.008
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008
Artigo de periodico
Prices of anarchy of selfish 2D bin packing games (2019)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: International Journal of Foundations of Computer Science. Unidade: IME
Assunto: TEORIA DOS JOGOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, v. 30, n. 03, p. 355-374, 2019Tradução . . Disponível em: https://doi.org/10.1142/s0129054119500096. Acesso em: 03 jun. 2024.
APA
Fernandes, C. G., Ferreira, C. E., Miyazawa, F. K., & Wakabayashi, Y. (2019). Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, 30( 03), 355-374. doi:10.1142/s0129054119500096
NLM
Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Prices of anarchy of selfish 2D bin packing games [Internet]. International Journal of Foundations of Computer Science. 2019 ; 30( 03): 355-374.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1142/s0129054119500096
Vancouver
Fernandes CG, Ferreira CE, Miyazawa FK, Wakabayashi Y. Prices of anarchy of selfish 2D bin packing games [Internet]. International Journal of Foundations of Computer Science. 2019 ; 30( 03): 355-374.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1142/s0129054119500096
Trabalho de evento-anais periodico
A min–max relation in flowgraphs and some applications (2018)
Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira
Source: Discrete Applied 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 and some applications. 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.2017.04.038. Acesso em: 03 jun. 2024. , 2018
APA
Ferreira, C. E., & Franco, Á. J. P. (2018). A min–max relation in flowgraphs and some applications. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2017.04.038
NLM
Ferreira CE, Franco ÁJP. A min–max relation in flowgraphs and some applications [Internet]. Discrete Applied Mathematics. 2018 ; 245 65-76.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2017.04.038
Vancouver
Ferreira CE, Franco ÁJP. A min–max relation in flowgraphs and some applications [Internet]. Discrete Applied Mathematics. 2018 ; 245 65-76.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2017.04.038
Trabalho de evento-anais periodico
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (2017)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Source: Discrete Applied Mathematics. Conference titles: International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2015). Unidade: IME
Subjects: ALGORITMOS GRÁFICOS, PROGRAMAÇÃO MATEMÁTICA
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. 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.2016.09.031. Acesso em: 03 jun. 2024. , 2017
APA
Ravelo, S. V., & Ferreira, C. E. (2017). A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2016.09.031
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Discrete Applied Mathematics. 2017 ; 228 158-175.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2016.09.031
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Discrete Applied Mathematics. 2017 ; 228 158-175.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2016.09.031
Artigo de periodico
featsel: a framework for benchmarking of feature selection algorithms and cost functions (2017)
Reis, Marcelo da Silva ; Estrela, Gustavo; Ferreira, Carlos Eduardo ; Barrera, Júnior
Source: SoftwareX. Unidade: IME
Assunto: ÁLGEBRAS DE BOOLE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REIS, Marcelo da Silva et al. featsel: a framework for benchmarking of feature selection algorithms and cost functions. SoftwareX, v. 6, p. 193-197, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.softx.2017.07.005. Acesso em: 03 jun. 2024.
APA
Reis, M. da S., Estrela, G., Ferreira, C. E., & Barrera, J. (2017). featsel: a framework for benchmarking of feature selection algorithms and cost functions. SoftwareX, 6, 193-197. doi:10.1016/j.softx.2017.07.005
NLM
Reis M da S, Estrela G, Ferreira CE, Barrera J. featsel: a framework for benchmarking of feature selection algorithms and cost functions [Internet]. SoftwareX. 2017 ; 6 193-197.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.softx.2017.07.005
Vancouver
Reis M da S, Estrela G, Ferreira CE, Barrera J. featsel: a framework for benchmarking of feature selection algorithms and cost functions [Internet]. SoftwareX. 2017 ; 6 193-197.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.softx.2017.07.005
Parte de monografia/livro
Statistical methods in graphs: parameter estimation, model selection, and hypothesis test (2016)
Santos, Suzana de Siqueira; Takahashi, Daniel Yasumasa; Sato, João Ricardo; Ferreira, Carlos Eduardo ; Fujita, André
Source: Mathematical foundations and applications of graph entropy. Unidade: IME
Subjects: TEORIA DOS GRAFOS, PROBABILIDADE, ESTIMAÇÃO PARAMÉTRICA, TESTES DE HIPÓTESES, SELEÇÃO DE MODELOS, BIOESTATÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Suzana de Siqueira et al. Statistical methods in graphs: parameter estimation, model selection, and hypothesis test. Mathematical foundations and applications of graph entropy. Tradução . Weinheim: Wiley-VCH, 2016. . Disponível em: https://doi.org/10.1002/9783527693245.ch6. Acesso em: 03 jun. 2024.
APA
Santos, S. de S., Takahashi, D. Y., Sato, J. R., Ferreira, C. E., & Fujita, A. (2016). Statistical methods in graphs: parameter estimation, model selection, and hypothesis test. In Mathematical foundations and applications of graph entropy. Weinheim: Wiley-VCH. doi:10.1002/9783527693245.ch6
NLM
Santos S de S, Takahashi DY, Sato JR, Ferreira CE, Fujita A. Statistical methods in graphs: parameter estimation, model selection, and hypothesis test [Internet]. In: Mathematical foundations and applications of graph entropy. Weinheim: Wiley-VCH; 2016. [citado 2024 jun. 03 ] Available from: https://doi.org/10.1002/9783527693245.ch6
Vancouver
Santos S de S, Takahashi DY, Sato JR, Ferreira CE, Fujita A. Statistical methods in graphs: parameter estimation, model selection, and hypothesis test [Internet]. In: Mathematical foundations and applications of graph entropy. Weinheim: Wiley-VCH; 2016. [citado 2024 jun. 03 ] Available from: https://doi.org/10.1002/9783527693245.ch6
Artigo de periodico
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (2016)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira; Schouery, Rafael Crivellari Saliba
Source: Discrete Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, TEORIA DOS JOGOS
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, unit-demand markets and connections with the network pricing problem. Discrete Optimization, v. 22, p. 141-191, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.disopt.2015.09.003. Acesso em: 03 jun. 2024.
APA
Fernandes, C. G., Ferreira, C. E., Franco, Á. J. P., & Schouery, R. C. S. (2016). The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discrete Optimization, 22, 141-191. doi:10.1016/j.disopt.2015.09.003
NLM
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem [Internet]. Discrete Optimization. 2016 ; 22 141-191.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.disopt.2015.09.003
Vancouver
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem [Internet]. Discrete Optimization. 2016 ; 22 141-191.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.disopt.2015.09.003
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
Source: Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Conference titles: International Conference on Algorithms and Discrete Applied Mathematics - CALDAM. Unidade: IME
Subjects: 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: 03 jun. 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 jun. 03 ] 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 jun. 03 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2
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: 03 jun. 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 jun. 03 ] 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 jun. 03 ] Available from: https://doi.org/10.1016/j.endm.2015.07.019
Trabalho de evento
PTAS’s for some metric p-source communication spanning tree problems (2015)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo
Source: Proceedings. Conference titles: International Workshop on Algorithms and Computation - WALCOM. Unidade: IME
Subjects: 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: 03 jun. 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 jun. 03 ] 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 jun. 03 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
Trabalho de evento-anais periodico
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (2014)
Acuña, Vicente; Ferreira, Carlos Eduardo ; Freire, Alexandre S; Moreno, Eduardo
Source: Discrete Applied Mathematics. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ACUÑA, Vicente et al. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. 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.2011.09.019. Acesso em: 03 jun. 2024. , 2014
APA
Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2014). Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2011.09.019
NLM
Acuña V, Ferreira CE, Freire AS, Moreno E. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs [Internet]. Discrete Applied Mathematics. 2014 ; 164 2-12.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2011.09.019
Vancouver
Acuña V, Ferreira CE, Freire AS, Moreno E. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs [Internet]. Discrete Applied Mathematics. 2014 ; 164 2-12.[citado 2024 jun. 03 ] Available from: https://doi.org/10.1016/j.dam.2011.09.019
Trabalho de evento
Finding matrimonial circuits in some Amerindian kinship networks: an experimental study (2014)
Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira; Silva, Márcio Ferreira da
Source: Proceedings. Conference titles: IEEE International Conference on e-Science - e-Science. Unidades: IME, FFLCH
Subjects: TEORIA DOS GRAFOS, ANTROPOLOGIA
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 e SILVA, Márcio Ferreira da. Finding matrimonial circuits in some Amerindian kinship networks: an experimental study. 2014, Anais.. Los Alamitos: IEEE, 2014. Disponível em: https://doi.org/10.1109/eScience.2014.12. Acesso em: 03 jun. 2024.
APA
Ferreira, C. E., Franco, Á. J. P., & Silva, M. F. da. (2014). Finding matrimonial circuits in some Amerindian kinship networks: an experimental study. In Proceedings. Los Alamitos: IEEE. doi:10.1109/eScience.2014.12
NLM
Ferreira CE, Franco ÁJP, Silva MF da. Finding matrimonial circuits in some Amerindian kinship networks: an experimental study [Internet]. Proceedings. 2014 ;[citado 2024 jun. 03 ] Available from: https://doi.org/10.1109/eScience.2014.12
Vancouver
Ferreira CE, Franco ÁJP, Silva MF da. Finding matrimonial circuits in some Amerindian kinship networks: an experimental study [Internet]. Proceedings. 2014 ;[citado 2024 jun. 03 ] Available from: https://doi.org/10.1109/eScience.2014.12
Parte de monografia/livro-apres/pref/posf
eScience 2014 volume 1. [Prefácio] (2014)
César Júnior, Roberto Marcondes ; Oliveira, Maria Cristina Ferreira de ; Medeiros, Claudia Bauzer ; Ferreira, Carlos Eduardo ; Ferreira, João Eduardo
Source: Proceedings. Conference titles: IEEE International Conference on eScience - eScience. Unidades: IME, ICMC
Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, PROCESSAMENTO DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÉSAR JÚNIOR, Roberto Marcondes et al. eScience 2014 volume 1. [Prefácio]. Proceedings. Piscataway: IEEE. Disponível em: https://doi.org/10.1109/eScience.2014.4. Acesso em: 03 jun. 2024. , 2014
APA
César Júnior, R. M., Oliveira, M. C. F. de, Medeiros, C. B., Ferreira, C. E., & Ferreira, J. E. (2014). eScience 2014 volume 1. [Prefácio]. Proceedings. Piscataway: IEEE. doi:10.1109/eScience.2014.4
NLM
César Júnior RM, Oliveira MCF de, Medeiros CB, Ferreira CE, Ferreira JE. eScience 2014 volume 1. [Prefácio] [Internet]. Proceedings. 2014 ;[citado 2024 jun. 03 ] Available from: https://doi.org/10.1109/eScience.2014.4
Vancouver
César Júnior RM, Oliveira MCF de, Medeiros CB, Ferreira CE, Ferreira JE. eScience 2014 volume 1. [Prefácio] [Internet]. Proceedings. 2014 ;[citado 2024 jun. 03 ] Available from: https://doi.org/10.1109/eScience.2014.4
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
Source: Combinatorial optimization: Third International Symposium, ISCO 2014 Lisbon, Portugal, March 5–7, 2014, revised selected papers. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Subjects: 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: 03 jun. 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 jun. 03 ] 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 jun. 03 ] 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
Source: 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: 03 jun. 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 jun. 03 ] 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 jun. 03 ] Available from: https://doi.org/10.1007/978-3-642-38189-8_8

USP Schools

ReP

Filtros

Document Types

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration