ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Transversals of longest paths (2017)
Cerioli, Márcia R; Fernandes, Cristina Gomes ; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma T
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERIOLI, Márcia R et al. Transversals of longest paths. 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.2017.10.024. Acesso em: 11 out. 2024. , 2017
APA
Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez, J., & Lima, P. T. (2017). Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.024
NLM
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Vancouver
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Trabalho de evento-anais periodico
Strong intractability of generalized convex recoloring problems (2017)
Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. 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.2017.10.017. Acesso em: 11 out. 2024. , 2017
APA
Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.017
NLM
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Vancouver
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Trabalho de evento-anais periodico
Decompositions of highly connected graphs into paths of length five (2015)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
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
BOTLER, Fábio Happ et al. Decompositions of highly connected graphs into paths of length five. 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.036. Acesso em: 11 out. 2024. , 2015
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of length five. 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.036
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
Trabalho de evento-anais periodico
Decompositions of highly connected graphs into paths of any given length (2015)
Botler, F; Mota, G. O; Oshiro, Marcio Takashi Iura; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. 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
BOTLER, F et al. Decompositions of highly connected graphs into paths of any given length. 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.06.107. Acesso em: 11 out. 2024. , 2015
APA
Botler, F., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of any given length. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.107
NLM
Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of any given length [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
Vancouver
Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of any given length [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
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
On minimum bisection and related partition problems in graphs with bounded tree width (2015)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications -EuroComb. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. On minimum bisection and related partition problems in graphs with 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/j.endm.2015.06.067. Acesso em: 11 out. 2024. , 2015
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). On minimum bisection and related partition problems in graphs with bounded tree width. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.067
NLM
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. On minimum bisection and related partition problems in graphs with bounded tree width [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015 481-488.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.067
Trabalho de evento-anais periodico
The k-hop connected dominating set problem: hardness and polyhedra (2015)
Coelho, Rafael S; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COELHO, Rafael S e MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: hardness and polyhedra. 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.011. Acesso em: 11 out. 2024. , 2015
APA
Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2015). The k-hop connected dominating set problem: hardness and polyhedra. 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.011
NLM
Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: hardness and polyhedra [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 59-64.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011
Vancouver
Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: hardness and polyhedra [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 59-64.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.011
Trabalho de evento-anais periodico
Path decompositions of regular graphs with prescribed girth (2015)
Botler, F; Mota, G. O; Oshiro, Marcio Takashi Iura; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. 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
BOTLER, F et al. Path decompositions of regular graphs with prescribed girth. 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.06.085. Acesso em: 11 out. 2024. , 2015
APA
Botler, F., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Path decompositions of regular graphs with prescribed girth. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.085
NLM
Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Path decompositions of regular graphs with prescribed girth [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
Vancouver
Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Path decompositions of regular graphs with prescribed girth [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.06.085
Trabalho de evento-anais periodico
Trajectory clustering of points in R (2015)
Fernandes, Cristina Gomes ; Oshiro, Marcio Takashi Iura
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: ALGORITMOS E ESTRUTURAS DE DADOS, ALGORITMOS GEOMÉTRICOS, CINÉTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e OSHIRO, Marcio Takashi Iura. Trajectory clustering of points in R. 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.010. Acesso em: 11 out. 2024. , 2015
APA
Fernandes, C. G., & Oshiro, M. T. I. (2015). Trajectory clustering of points in R. 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.010
NLM
Fernandes CG, Oshiro MTI. Trajectory clustering of points in R [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 53-58.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.010
Vancouver
Fernandes CG, Oshiro MTI. Trajectory clustering of points in R [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 53-58.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2015.07.010
Trabalho de evento-anais periodico
Polyhedral studies on the convex recoloring problem (2013)
Campêlo, Manoel; Lima, Karla Roberta Pereira Sampaio; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidades: EACH, IME
Subjects: ALGORITMOS, POLIEDROS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPÊLO, Manoel et al. Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.036. Acesso em: 11 out. 2024. , 2013
APA
Campêlo, M., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2013). Polyhedral studies on the convex recoloring problem. Electronic Notes in Discrete Mathematics. Amsterdam: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.036
NLM
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
Vancouver
Campêlo M, Lima KRPS, Moura PFS, Wakabayashi Y. Polyhedral studies on the convex recoloring problem [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; no 2013 233-238.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2013.10.036
Trabalho de evento-anais periodico
Intersection of longest paths in a graph (2011)
Rezende, Susanna F. de; Fernandes, Cristina Gomes ; Martin, Daniel M.; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REZENDE, Susanna F. de et al. Intersection of longest paths in a graph. 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.2011.10.024. Acesso em: 11 out. 2024. , 2011
APA
Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2011). Intersection of longest paths in a graph. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.10.024
NLM
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
Vancouver
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersection of longest paths in a graph [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 38 743-748.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.10.024
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
Stability in geodesics for memoryless binary long-lived consensus (2011)
Fernandes, Cristina Gomes ; Stein, Maya
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e STEIN, Maya. Stability in geodesics for memoryless binary long-lived consensus. 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.2011.05.060. Acesso em: 11 out. 2024. , 2011
APA
Fernandes, C. G., & Stein, M. (2011). Stability in geodesics for memoryless binary long-lived consensus. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.05.060
NLM
Fernandes CG, Stein M. Stability in geodesics for memoryless binary long-lived consensus [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 351-356.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.060
Vancouver
Fernandes CG, Stein M. Stability in geodesics for memoryless binary long-lived consensus [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 351-356.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.060
Trabalho de evento-anais periodico
Convex recoloring of paths (2011)
Lima, Karla Roberta; 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
LIMA, Karla Roberta e WAKABAYASHI, Yoshiko. Convex recoloring of paths. 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.2011.05.029. Acesso em: 11 out. 2024. , 2011
APA
Lima, K. R., & Wakabayashi, Y. (2011). Convex recoloring of paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2011.05.029
NLM
Lima KR, Wakabayashi Y. Convex recoloring of paths [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 165-170.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.029
Vancouver
Lima KR, Wakabayashi Y. Convex recoloring of paths [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 165-170.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2011.05.029
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
A concurrent implementation of skip graphs (2009)
Mendes, Hammurabi; Fernandes, Cristina Gomes
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MENDES, Hammurabi e FERNANDES, Cristina Gomes. A concurrent implementation of skip graphs. 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.2009.11.043. Acesso em: 11 out. 2024. , 2009
APA
Mendes, H., & Fernandes, C. G. (2009). A concurrent implementation of skip graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2009.11.043
NLM
Mendes H, Fernandes CG. A concurrent implementation of skip graphs [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 263-268.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2009.11.043
Vancouver
Mendes H, Fernandes CG. A concurrent implementation of skip graphs [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 263-268.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2009.11.043
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
Approximation algorithms and hardness results for the clique packing problem (2007)
Chataigner, Frederic; Manic, Gordana; Wakabayashi, Yoshiko ; Yuster, Raphael
Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHATAIGNER, Frederic et al. Approximation algorithms and hardness results for the clique packing 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.2007.07.065. Acesso em: 11 out. 2024. , 2007
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2007). Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2007.07.065
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Electronic Notes in Discrete Mathematics. 2007 ; 29 397-401.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.endm.2007.07.065

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Conference titles

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration