ReP USP - Resultado da busca

Artigo de periodico
Intersecting longest paths (2013)
Rezende, Susanna F. de; Fernandes, Cristina Gomes ; Martin, Daniel M; Wakabayashi, Yoshiko
Source: Discrete Mathematics. 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. Intersecting longest paths. Discrete Mathematics, v. 313, n. 12, p. 1401-1408, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2013.02.016. Acesso em: 04 dez. 2025.
APA
Rezende, S. F. de, Fernandes, C. G., Martin, D. M., & Wakabayashi, Y. (2013). Intersecting longest paths. Discrete Mathematics, 313( 12), 1401-1408. doi:10.1016/j.disc.2013.02.016
NLM
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersecting longest paths [Internet]. Discrete Mathematics. 2013 ; 313( 12): 1401-1408.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.disc.2013.02.016
Vancouver
Rezende SF de, Fernandes CG, Martin DM, Wakabayashi Y. Intersecting longest paths [Internet]. Discrete Mathematics. 2013 ; 313( 12): 1401-1408.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.disc.2013.02.016
Artigo de periodico
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (2012)
Queiroz, Thomaz A; Miyazawa, Flavio Keidi; Wakabayashi, Yoshiko ; Xavier, Eduardo C
Source: Computers & Operations Research. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
QUEIROZ, Thomaz A et al. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, v. 39, n. 2, p. 200-212, 2012Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2011.03.011. Acesso em: 04 dez. 2025.
APA
Queiroz, T. A., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39( 2), 200-212. doi:10.1016/j.cor.2011.03.011
NLM
Queiroz TA, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing [Internet]. Computers & Operations Research. 2012 ; 39( 2): 200-212.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.cor.2011.03.011
Vancouver
Queiroz TA, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing [Internet]. Computers & Operations Research. 2012 ; 39( 2): 200-212.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.cor.2011.03.011
Artigo de periodico
Approximating a class of combinatorial problems with rational objective function (2010)
Correa, J. R.; Fernandes, Cristina Gomes ; Wakabayashi, Yoshiko
Source: Mathematical Programming. Unidade: IME
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORREA, J. R. e FERNANDES, Cristina Gomes e WAKABAYASHI, Yoshiko. Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, v. 124, n. 1-2, p. 255-269, 2010Tradução . . Disponível em: https://doi.org/10.1007/s10107-010-0364-8. Acesso em: 04 dez. 2025.
APA
Correa, J. R., Fernandes, C. G., & Wakabayashi, Y. (2010). Approximating a class of combinatorial problems with rational objective function. Mathematical Programming, 124( 1-2), 255-269. doi:10.1007/s10107-010-0364-8
NLM
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Vancouver
Correa JR, Fernandes CG, Wakabayashi Y. Approximating a class of combinatorial problems with rational objective function [Internet]. Mathematical Programming. 2010 ; 124( 1-2): 255-269.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
Trabalho de evento-anais periodico
Repetition-free longest common subsequence (2010)
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: Discrete Applied 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. 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.2009.04.023. Acesso em: 04 dez. 2025. , 2010
APA
Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. -F., et al. (2010). Repetition-free longest common subsequence. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2009.04.023
NLM
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12): 1315-1324.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2009.04.023
Vancouver
Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12): 1315-1324.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2009.04.023
Artigo de periodico
Approximation algorithms and hardness results for the clique packing problem (2009)
Chataigner, Frederic; Manic, Gerhard; Wakabayashi, Yoshiko ; Yuster, R
Source: Discrete Applied Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
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. Discrete Applied Mathematics, v. 157, n. 7, p. 1396-1406, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2008.10.017. Acesso em: 04 dez. 2025.
APA
Chataigner, F., Manic, G., Wakabayashi, Y., & Yuster, R. (2009). Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157( 7), 1396-1406. doi:10.1016/j.dam.2008.10.017
NLM
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Vancouver
Chataigner F, Manic G, Wakabayashi Y, Yuster R. Approximation algorithms and hardness results for the clique packing problem [Internet]. Discrete Applied Mathematics. 2009 ; 157( 7): 1396-1406.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2008.10.017
Artigo de periodico
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width (2009)
Fernandes, Cristina Gomes ; Lee, Orlando; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. 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 LEE, Orlando e WAKABAYASHI, Yoshiko. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, n. 2, p. 272-279, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2007.10.032. Acesso em: 04 dez. 2025.
APA
Fernandes, C. G., Lee, O., & Wakabayashi, Y. (2009). Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Applied Mathematics, ( 2), 272-279. doi:10.1016/j.dam.2007.10.032
NLM
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032
Vancouver
Fernandes CG, Lee O, Wakabayashi Y. Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width [Internet]. Discrete Applied Mathematics. 2009 ;( 2): 272-279.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2007.10.032
Artigo de periodico
Three-dimensional packings with rotations (2009)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Computers & Operations Research. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Three-dimensional packings with rotations. Computers & Operations Research, v. 36, n. 10, p. 2801-2815, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2008.12.015. Acesso em: 04 dez. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2009). Three-dimensional packings with rotations. Computers & Operations Research, 36( 10), 2801-2815. doi:10.1016/j.cor.2008.12.015
NLM
Miyazawa FK, Wakabayashi Y. Three-dimensional packings with rotations [Internet]. Computers & Operations Research. 2009 ; 36( 10): 2801-2815.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Vancouver
Miyazawa FK, Wakabayashi Y. Three-dimensional packings with rotations [Internet]. Computers & Operations Research. 2009 ; 36( 10): 2801-2815.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
Artigo de periodico
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (2008)
Cintra, Glauber Ferreira ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko ; Xavier, Eduardo C
Source: European Journal of Operational Research. Unidades: IME, EACH
Subjects: PROGRAMAÇÃO DINÂMICA, ALGORITMOS, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira et al. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, v. 191, n. 1, p. 61-85, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.08.007. Acesso em: 04 dez. 2025.
APA
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191( 1), 61-85. doi:10.1016/j.ejor.2007.08.007
NLM
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Vancouver
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007
Trabalho de evento-anais periodico
Packing triangles in low degree graphs and indifference graphs (2008)
Manic, Gordana; Wakabayashi, Yoshiko
Source: Discrete Mathematics. Conference titles: European Conference on Combinatorics - EuroComb. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MANIC, Gordana e WAKABAYASHI, Yoshiko. Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.disc.2007.07.100. Acesso em: 04 dez. 2025. , 2008
APA
Manic, G., & Wakabayashi, Y. (2008). Packing triangles in low degree graphs and indifference graphs. Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.disc.2007.07.100
NLM
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Vancouver
Manic G, Wakabayashi Y. Packing triangles in low degree graphs and indifference graphs [Internet]. Discrete Mathematics. 2008 ; 308( 8): 1455-1471.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Artigo de periodico-apres/intr
This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics... [Apresentação] (2008)
Feofiloff, Paulo ; Figueiredo, Celina Miraglia Herrera de; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. 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
FEOFILOFF, Paulo e FIGUEIREDO, Celina Miraglia Herrera de e WAKABAYASHI, Yoshiko. This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação]. 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.07.017. Acesso em: 04 dez. 2025. , 2008
APA
Feofiloff, P., Figueiredo, C. M. H. de, & Wakabayashi, Y. (2008). This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação]. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2007.07.017
NLM
Feofiloff P, Figueiredo CMH de, Wakabayashi Y. This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação] [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2007.07.017
Vancouver
Feofiloff P, Figueiredo CMH de, Wakabayashi Y. This special issue of Discrete Applied Mathematics is dedicated to the Second Brazilian Symposium on Graphs, Algorithms and Combinatorics.. [Apresentação] [Internet]. Discrete Applied Mathematics. 2008 ; 156( 7): 985.[citado 2025 dez. 04 ] Available from: https://doi.org/10.1016/j.dam.2007.07.017

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies

Non normalized affiliation