ReP USP - Resultado da busca

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: 18 out. 2024.
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 2024 out. 18 ] 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 2024 out. 18 ] Available from: https://doi.org/10.1007/s10107-010-0364-8
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: 18 out. 2024.
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 2024 out. 18 ] 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 2024 out. 18 ] 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: 18 out. 2024.
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 2024 out. 18 ] 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 2024 out. 18 ] 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: 18 out. 2024.
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 2024 out. 18 ] 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 2024 out. 18 ] Available from: https://doi.org/10.1016/j.cor.2008.12.015
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
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Subjects: 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: 18 out. 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 out. 18 ] 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 out. 18 ] Available from: https://doi.org/10.1007/978-3-540-78773-0_29
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: 18 out. 2024.
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 2024 out. 18 ] 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 2024 out. 18 ] 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: 18 out. 2024. , 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 2024 out. 18 ] 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 2024 out. 18 ] Available from: https://doi.org/10.1016/j.disc.2007.07.100
Artigo de periodico
A note on the approximability of cutting stock problems (2007)
Cintra, Glauber Ferreira ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko ; Xavier, Eduardo C
Source: European Journal of Operational Research. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira et al. A note on the approximability of cutting stock problems. European Journal of Operational Research, v. 183, n. 3, p. 1328-1332, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2005.09.053. Acesso em: 18 out. 2024.
APA
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2007). A note on the approximability of cutting stock problems. European Journal of Operational Research, 183( 3), 1328-1332. doi:10.1016/j.ejor.2005.09.053
NLM
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. A note on the approximability of cutting stock problems [Internet]. European Journal of Operational Research. 2007 ; 183( 3): 1328-1332.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
Vancouver
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. A note on the approximability of cutting stock problems [Internet]. European Journal of Operational Research. 2007 ; 183( 3): 1328-1332.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/j.ejor.2005.09.053
Artigo de periodico
Two- and three-dimensional parametric packing (2007)
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. Two- and three-dimensional parametric packing. Computers & Operations Research, v. 34, n. 9, p. 2589-2603, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2005.10.001. Acesso em: 18 out. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2007). Two- and three-dimensional parametric packing. Computers & Operations Research, 34( 9), 2589-2603. doi:10.1016/j.cor.2005.10.001
NLM
Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing [Internet]. Computers & Operations Research. 2007 ; 34( 9): 2589-2603.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Vancouver
Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing [Internet]. Computers & Operations Research. 2007 ; 34( 9): 2589-2603.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/j.cor.2005.10.001
Trabalho de evento
Packing problems with orthogonal rotations (2004)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. 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. Packing problems with orthogonal rotations. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_40. Acesso em: 18 out. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2004). Packing problems with orthogonal rotations. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_40
NLM
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Vancouver
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Trabalho de evento
Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems (2004)
Cintra, Glauber Ferreira ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. Unidade: IME
Subjects: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira e WAKABAYASHI, Yoshiko. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_13. Acesso em: 18 out. 2024.
APA
Cintra, G. F., & Wakabayashi, Y. (2004). Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_13
NLM
Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13
Vancouver
Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13
Trabalho de evento-anais periodico
Approximation results on balanced connected partitions of graphs (2004)
Salgado, Liliane Rose Benning; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Conference on Combinatorics,Graphs and Applications. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SALGADO, Liliane Rose Benning e WAKABAYASHI, Yoshiko. Approximation results on balanced connected partitions of 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.2004.06.033. Acesso em: 18 out. 2024. , 2004
APA
Salgado, L. R. B., & Wakabayashi, Y. (2004). Approximation results on balanced connected partitions of graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2004.06.033
NLM
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033
Vancouver
Salgado LRB, Wakabayashi Y. Approximation results on balanced connected partitions of graphs [Internet]. Electronic Notes in Discrete Mathematics. 2004 ; 18 207-212.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/j.endm.2004.06.033
Parte de monografia/livro
Pattern inference under many guises (2003)
Sagot, Marie France; Wakabayashi, Yoshiko
Source: Recent advances in algorithms and combinatorics. Unidade: IME
Assunto: ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAGOT, Marie France e WAKABAYASHI, Yoshiko. Pattern inference under many guises. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi.org/10.1007/0-387-22444-0_8. Acesso em: 18 out. 2024.
APA
Sagot, M. F., & Wakabayashi, Y. (2003). Pattern inference under many guises. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_8
NLM
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 out. 18 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Vancouver
Sagot MF, Wakabayashi Y. Pattern inference under many guises [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 out. 18 ] Available from: https://doi.org/10.1007/0-387-22444-0_8
Artigo de periodico
Parametric on-line algorithms for packing rectangles and boxes (2003)
Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Source: European Journal of Operational Research. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, v. 150, n. 2, p. 281-292, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0377-2217(02)00539-8. Acesso em: 18 out. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2003). Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research, 150( 2), 281-292. doi:10.1016/s0377-2217(02)00539-8
NLM
Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8
Vancouver
Miyazawa FK, Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes [Internet]. European Journal of Operational Research. 2003 ; 150( 2): 281-292.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/s0377-2217(02)00539-8
Artigo de periodico
Cube packing (2003)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Cube packing. Theoretical Computer Science, v. 297, n. 1/3, p. 355-366, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0304-3975(02)00647-3. Acesso em: 18 out. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2003). Cube packing. Theoretical Computer Science, 297( 1/3), 355-366. doi:10.1016/s0304-3975(02)00647-3
NLM
Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Theoretical Computer Science. 2003 ; 297( 1/3): 355-366.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/s0304-3975(02)00647-3
Vancouver
Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Theoretical Computer Science. 2003 ; 297( 1/3): 355-366.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/s0304-3975(02)00647-3
Trabalho de evento-anais periodico
Multidimensional cube packing (2001)
Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Raghavan, Prabhakar; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Multidimensional cube packing. 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)00237-9. Acesso em: 18 out. 2024. , 2001
APA
Kohayakawa, Y., Miyazawa, F. K., Raghavan, P., & Wakabayashi, Y. (2001). Multidimensional cube packing. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/S1571-0653(04)00237-9
NLM
Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9
Vancouver
Kohayakawa Y, Miyazawa FK, Raghavan P, Wakabayashi Y. Multidimensional cube packing [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 110-113.[citado 2024 out. 18 ] Available from: https://doi.org/10.1016/S1571-0653(04)00237-9
Artigo de periodico
Note on a min-max conjecture of Woodall (2001)
Lee, Orlando; Wakabayashi, Yoshiko
Source: Journal of Graph Theory. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEE, Orlando e WAKABAYASHI, Yoshiko. Note on a min-max conjecture of Woodall. Journal of Graph Theory, v. 38, n. 1, p. 36-41, 2001Tradução . . Disponível em: https://doi.org/10.1002/jgt.1022. Acesso em: 18 out. 2024.
APA
Lee, O., & Wakabayashi, Y. (2001). Note on a min-max conjecture of Woodall. Journal of Graph Theory, 38( 1), 36-41. doi:10.1002/jgt.1022
NLM
Lee O, Wakabayashi Y. Note on a min-max conjecture of Woodall [Internet]. Journal of Graph Theory. 2001 ; 38( 1): 36-41.[citado 2024 out. 18 ] Available from: https://doi.org/10.1002/jgt.1022
Vancouver
Lee O, Wakabayashi Y. Note on a min-max conjecture of Woodall [Internet]. Journal of Graph Theory. 2001 ; 38( 1): 36-41.[citado 2024 out. 18 ] Available from: https://doi.org/10.1002/jgt.1022
Trabalho de evento
Cube packing (2000)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Cube packing. 2000, Anais.. Berlin: Springer, 2000. Disponível em: https://doi.org/10.1007/10719839_6. Acesso em: 18 out. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2000). Cube packing. In Proceedings. Berlin: Springer. doi:10.1007/10719839_6
NLM
Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Proceedings. 2000 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/10719839_6
Vancouver
Miyazawa FK, Wakabayashi Y. Cube packing [Internet]. Proceedings. 2000 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/10719839_6
Trabalho de evento
Circuit covers in series-parallel mixed graphs (1998)
Lee, Orlando; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEE, Orlando e WAKABAYASHI, Yoshiko. Circuit covers in series-parallel mixed graphs. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/BFb0054324. Acesso em: 18 out. 2024.
APA
Lee, O., & Wakabayashi, Y. (1998). Circuit covers in series-parallel mixed graphs. In Proceedings. Berlin: Springer. doi:10.1007/BFb0054324
NLM
Lee O, Wakabayashi Y. Circuit covers in series-parallel mixed graphs [Internet]. Proceedings. 1998 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/BFb0054324
Vancouver
Lee O, Wakabayashi Y. Circuit covers in series-parallel mixed graphs [Internet]. Proceedings. 1998 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/BFb0054324

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Funding Agencies

Non normalized affiliation