Filtros : base.keyword"Produção científica" Limpar

Filtros



Limitar por data


  • Fonte: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão AceitaAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      GÓMEZ, Renzo; WAKABAYASHI, Yoshiko. Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, New York, Springer, v. 39, n. 2, p. 437-456, 2020. Disponível em: < https://doi.org/10.1007/s10878-019-00488-w > DOI: 10.1007/s10878-019-00488-w.
    • APA

      Gómez, R., & Wakabayashi, Y. (2020). Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, 39( 2), 437-456. doi:10.1007/s10878-019-00488-w
    • NLM

      Gómez R, Wakabayashi Y. Nontrivial path covers of graphs: existence, minimization and maximization [Internet]. Journal of Combinatorial Optimization. 2020 ; 39( 2): 437-456.Available from: https://doi.org/10.1007/s10878-019-00488-w
    • Vancouver

      Gómez R, Wakabayashi Y. Nontrivial path covers of graphs: existence, minimization and maximization [Internet]. Journal of Combinatorial Optimization. 2020 ; 39( 2): 437-456.Available from: https://doi.org/10.1007/s10878-019-00488-w
  • Fonte: Proceedings. Nome do evento: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Assunto: PROGRAMAÇÃO LINEAR

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flavio Keidi; MOURA, Phablo Fernando Soares; OTA, Matheus J; WAKABAYASHI, Yoshiko. Cut and flow formulations for the balanced connected k-partition problem. Anais.. Cham: Springer, 2020.Disponível em: DOI: 10.1007/978-3-030-53262-8_11.
    • APA

      Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2020). Cut and flow formulations for the balanced connected k-partition problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-53262-8_11
    • NLM

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;Available from: https://doi.org/10.1007/978-3-030-53262-8_11
    • Vancouver

      Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;Available from: https://doi.org/10.1007/978-3-030-53262-8_11
  • Fonte: Discrete Applied Mathematics. Nome do evento: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assuntos: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    Versão AceitaAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics[S.l: s.n.], 2020.Disponível em: DOI: 10.1016/j.dam.2019.08.002.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2020). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2019.08.002
    • NLM

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
    • Vancouver

      Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.Available from: http://dx.doi.org/10.1016/j.dam.2019.08.002
  • Nome do evento: Joint Meeting Brazil-France in Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      WAKABAYASHI, Yoshiko. Decomposing highly connected graphs into paths on any given length. Anais.. Rio de Janeiro: Impa, 2019.Disponível em: .
    • APA

      Wakabayashi, Y. (2019). Decomposing highly connected graphs into paths on any given length. In . Rio de Janeiro: Impa. Recuperado de https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf
    • NLM

      Wakabayashi Y. Decomposing highly connected graphs into paths on any given length [Internet]. 2019 ;Available from: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf
    • Vancouver

      Wakabayashi Y. Decomposing highly connected graphs into paths on any given length [Internet]. 2019 ;Available from: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf
  • Fonte: International Journal of Foundations of Computer Science. Unidade: IME

    Assunto: TEORIA DOS JOGOS

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FERNANDES, Cristina Gomes; FERREIRA, Carlos Eduardo; MIYAZAWA, Flavio Keidi; WAKABAYASHI, Yoshiko. Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, Singapore, World Scientific, v. 30, n. 03, p. 355-374, 2019. Disponível em: < http://dx.doi.org/10.1142/s0129054119500096 > DOI: 10.1142/s0129054119500096.
    • 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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1142/s0129054119500096
  • Nome do evento: Encontro Brasileiro de Mulheres Matemáticas. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      WAKABAYASHI, Yoshiko. Grafos e otimização combinatória. Anais.. Rio de Janeiro: Impa, 2019.Disponível em: .
    • APA

      Wakabayashi, Y. (2019). Grafos e otimização combinatória. In . Rio de Janeiro: Impa. Recuperado de https://impa.br/wp-content/uploads/2019/05/EBMM2019-PE_YoshikoWakabayashi-new.pdf
    • NLM

      Wakabayashi Y. Grafos e otimização combinatória [Internet]. 2019 ;Available from: https://impa.br/wp-content/uploads/2019/05/EBMM2019-PE_YoshikoWakabayashi-new.pdf
    • Vancouver

      Wakabayashi Y. Grafos e otimização combinatória [Internet]. 2019 ;Available from: https://impa.br/wp-content/uploads/2019/05/EBMM2019-PE_YoshikoWakabayashi-new.pdf
  • Fonte: Discrete Applied Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão AceitaAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, Fábio Happ; MOTA, G. O; OSHIRO, Marcio Takashi Iura; WAKABAYASHI, Yoshiko. Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics, Amsterdam, v. 245, p. 128-138, 2018. Disponível em: < https://dx.doi.org/10.1016/j.dam.2016.08.001 > DOI: 10.1016/j.dam.2016.08.001.
    • APA

      Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2018). Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics, 245, 128-138. doi:10.1016/j.dam.2016.08.001
    • NLM

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.Available from: https://dx.doi.org/10.1016/j.dam.2016.08.001
    • Vancouver

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.Available from: https://dx.doi.org/10.1016/j.dam.2016.08.001
  • Fonte: Proceedings. Nome do evento: International Workshop on Graph-Theoretic Concepts in Computer Science - WG. Unidade: IME

    Assuntos: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      GÓMEZ, Renzo; WAKABAYASHI, Yoshiko. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. Anais.. Cham: Springer, 2018.Disponível em: DOI: 10.1007/978-3-030-00256-5_19.
    • APA

      Gómez, R., & Wakabayashi, Y. (2018). Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-00256-5_19
    • NLM

      Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;Available from: https://doi.org/10.1007/978-3-030-00256-5_19
    • Vancouver

      Gómez R, Wakabayashi Y. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization [Internet]. Proceedings. 2018 ;Available from: https://doi.org/10.1007/978-3-030-00256-5_19
  • Fonte: Proceedings. Nome do evento: Latin American Symposium on Theoretical Informatics - LATIN 2018. Unidade: IME

    Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS PARA PROCESSAMENTO

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      KOHAYAKAWA, Yoshiharu; MIYAZAWA, Flávio Keidi; WAKABAYASHI, Yoshiko. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. Anais.. Cham: Springer, 2018.Disponível em: DOI: 10.1007/978-3-319-77404-6_51.
    • APA

      Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2018). A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-77404-6_51
    • NLM

      Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;Available from: https://doi.org/10.1007/978-3-319-77404-6_51
    • Vancouver

      Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;Available from: https://doi.org/10.1007/978-3-319-77404-6_51
  • Fonte: Anais. Nome do evento: Congresso da Sociedade Brasileira de Computação - CSBC. Unidade: IME

    Assunto: ANÁLISE NUMÉRICA APLICADA

    Acesso à fonteComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      WAKABAYASHI, Yoshiko. Selfish 2D bin packing game. Anais.. São Paulo: Sociedade Brasileira de Computação, 2017.Disponível em: .
    • APA

      Wakabayashi, Y. (2017). Selfish 2D bin packing game. In Anais. São Paulo: Sociedade Brasileira de Computação. Recuperado de http://csbc2017.mackenzie.br/anais
    • NLM

      Wakabayashi Y. Selfish 2D bin packing game [Internet]. Anais. 2017 ;Available from: http://csbc2017.mackenzie.br/anais
    • Vancouver

      Wakabayashi Y. Selfish 2D bin packing game [Internet]. Anais. 2017 ;Available from: http://csbc2017.mackenzie.br/anais
  • Fonte: Journal of Combinatorial Theory, Series B. Unidade: IME

    Assuntos: COMBINATÓRIA, TEORIA DOS GRAFOS

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, Fábio Happ; MOTA, G. O.; OSHIRO, M.T.I.; WAKABAYASHI, Yoshiko. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B[S.l.], Elsevier, v. 122, n. , p. 508-542, 2017. Disponível em: < http://dx.doi.org/10.1016/j.jctb.2016.07.010 > DOI: 10.1016/j.jctb.2016.07.010.
    • APA

      Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122( ), 508-542. doi:10.1016/j.jctb.2016.07.010
    • NLM

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122( ): 508-542.Available from: http://dx.doi.org/10.1016/j.jctb.2016.07.010
    • Vancouver

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122( ): 508-542.Available from: http://dx.doi.org/10.1016/j.jctb.2016.07.010
  • Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME

    Assuntos: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics[S.l: s.n.], 2017.Disponível em: DOI: 10.1016/j.endm.2017.10.017.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam. 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.Available from: https://dx.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.Available from: https://dx.doi.org/10.1016/j.endm.2017.10.017
  • Fonte: European Journal of Combinatorics. Unidade: IME

    Assunto: COMBINATÓRIA

    PrivadoAcesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, Fábio Happ; MOTA, G. O; OSHIRO, Marcio Takashi Iura; WAKABAYASHI, Yoshiko. Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics, Amsterdam, Elsevier, v. 66, n. , p. 28-36, 2017. Disponível em: < http://dx.doi.org/10.1016/j.ejc.2017.06.011 > DOI: 10.1016/j.ejc.2017.06.011.
    • APA

      Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics, 66( ), 28-36. doi:10.1016/j.ejc.2017.06.011
    • NLM

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing regular graphs with prescribed girth into paths of given length [Internet]. European Journal of Combinatorics. 2017 ;66( ): 28-36.Available from: http://dx.doi.org/10.1016/j.ejc.2017.06.011
    • Vancouver

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing regular graphs with prescribed girth into paths of given length [Internet]. European Journal of Combinatorics. 2017 ;66( ): 28-36.Available from: http://dx.doi.org/10.1016/j.ejc.2017.06.011
  • Fonte: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: COMBINATÓRIA

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      COELHO, Rafael S; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, Dordrecht, v. 34, n. 4, p. 1060–1083, 2017. Disponível em: < http://dx.doi.org/10.1007/s10878-017-0128-y > DOI: 10.1007/s10878-017-0128-y.
    • APA

      Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2017). The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, 34( 4), 1060–1083. doi:10.1007/s10878-017-0128-y
    • NLM

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.Available from: http://dx.doi.org/10.1007/s10878-017-0128-y
    • Vancouver

      Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.Available from: http://dx.doi.org/10.1007/s10878-017-0128-y
  • Fonte: Discrete Mathematics and Theoretical Computer Science. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Como citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      JIMÉNEZ, Andrea; WAKABAYASHI, Yoshiko. On path-cycle decompositions of triangle-free graphs. Discrete Mathematics and Theoretical Computer Science, Nancy, v. 19, n. 3, p. [21 ], 2017.
    • APA

      Jiménez, A., & Wakabayashi, Y. (2017). On path-cycle decompositions of triangle-free graphs. Discrete Mathematics and Theoretical Computer Science, 19( 3), [21 ].
    • NLM

      Jiménez A, Wakabayashi Y. On path-cycle decompositions of triangle-free graphs. Discrete Mathematics and Theoretical Computer Science. 2017 ; 19( 3): [21 ].
    • Vancouver

      Jiménez A, Wakabayashi Y. On path-cycle decompositions of triangle-free graphs. Discrete Mathematics and Theoretical Computer Science. 2017 ; 19( 3): [21 ].
  • Fonte: Mathematical Programming. Unidades: EACH, IME

    Assuntos: ALGORITMOS, POLIEDROS, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      CAMPÊLO, Manoel; FREIRE, Alexandre S; LIMA, Karla Roberta Pereira Sampaio; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming, Heidelberg, v. 156, n. 1, p. 303-330, 2016. Disponível em: < http://dx.doi.org/10.1007/s10107-015-0880-7 > DOI: 10.1007/s10107-015-0880-7.
    • APA

      Campêlo, M., Freire, A. S., Lima, K. R. P. S., Moura, P. F. S., & Wakabayashi, Y. (2016). The convex recoloring problem: polyhedra, facets and computational experiments. Mathematical Programming, 156( 1), 303-330. doi:10.1007/s10107-015-0880-7
    • NLM

      Campêlo M, Freire AS, Lima KRPS, Moura PFS, Wakabayashi Y. The convex recoloring problem: polyhedra, facets and computational experiments [Internet]. Mathematical Programming. 2016 ; 156( 1): 303-330.Available from: http://dx.doi.org/10.1007/s10107-015-0880-7
    • Vancouver

      Campêlo M, Freire AS, Lima KRPS, Moura PFS, Wakabayashi Y. The convex recoloring problem: polyhedra, facets and computational experiments [Internet]. Mathematical Programming. 2016 ; 156( 1): 303-330.Available from: http://dx.doi.org/10.1007/s10107-015-0880-7
  • Fonte: Algorithmica. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flávio K.; PEDROSA, Lehilton L. C.; SCHOUERY, Rafael C. S.; SVIRIDENKO, Maxim; WAKABAYASHI, Yoshiko. Polynomial-time approximation schemes for circle and other packing problems. Algorithmica, New York, Springer Nature, v. 76, n. 2, p. 536-568, 2016. Disponível em: < http://dx.doi.org/10.1007/s00453-015-0052-4 > DOI: 10.1007/s00453-015-0052-4.
    • APA

      Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M., & Wakabayashi, Y. (2016). Polynomial-time approximation schemes for circle and other packing problems. Algorithmica, 76( 2), 536-568. doi:10.1007/s00453-015-0052-4
    • NLM

      Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle and other packing problems [Internet]. Algorithmica. 2016 ; 76( 2): 536-568.Available from: http://dx.doi.org/10.1007/s00453-015-0052-4
    • Vancouver

      Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle and other packing problems [Internet]. Algorithmica. 2016 ; 76( 2): 536-568.Available from: http://dx.doi.org/10.1007/s00453-015-0052-4
  • Fonte: 4OR - A Quarterly Journal of Operations Research. Unidade: IME

    Assuntos: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA APLICADA

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      QUEIROZ, Thiago Alves de; MIYAZAWA, Flavio Keidi; WAKABAYASHI, Yoshiko. On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR - A Quarterly Journal of Operations Research, Heidelberg, v. 13, n. 2, p. 199-219, 2015. Disponível em: < http://dx.doi.org/10.1007/s10288-014-0274-3 > DOI: 10.1007/s10288-014-0274-3.
    • APA

      Queiroz, T. A. de, Miyazawa, F. K., & Wakabayashi, Y. (2015). On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR - A Quarterly Journal of Operations Research, 13( 2), 199-219. doi:10.1007/s10288-014-0274-3
    • NLM

      Queiroz TA de, Miyazawa FK, Wakabayashi Y. On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns [Internet]. 4OR - A Quarterly Journal of Operations Research. 2015 ; 13( 2): 199-219.Available from: http://dx.doi.org/10.1007/s10288-014-0274-3
    • Vancouver

      Queiroz TA de, Miyazawa FK, Wakabayashi Y. On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns [Internet]. 4OR - A Quarterly Journal of Operations Research. 2015 ; 13( 2): 199-219.Available from: http://dx.doi.org/10.1007/s10288-014-0274-3
  • Fonte: Electronic Notes in Discrete Mathematics. Nome do evento: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assuntos: TEORIA DOS GRAFOS, COMBINATÓRIA

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, F; MOTA, Guilherme Oliveira; OSHIRO, Marcio Takashi Iura; WAKABAYASHI, Yoshiko. Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics[S.l: s.n.], 2015.Disponível em: DOI: 10.1016/j.endm.2015.07.036.
    • APA

      Botler, F., 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. doi:10.1016/j.endm.2015.07.036
    • NLM

      Botler F, 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.Available from: http://dx.doi.org/10.1016/j.endm.2015.07.036
    • Vancouver

      Botler F, 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.Available from: http://dx.doi.org/10.1016/j.endm.2015.07.036
  • Fonte: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteDOIComo citar
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BOTLER, F; MOTA, G. O; WAKABAYASHI, Yoshiko. Decompositions of triangle-free 5-regular graphs into paths of length five. Discrete Mathematics, Amsterdam, v. 338, n. 11, p. 1845–1855, 2015. Disponível em: < http://dx.doi.org/10.1016/j.disc.2015.04.018 > DOI: 10.1016/j.disc.2015.04.018.
    • APA

      Botler, F., Mota, G. O., & Wakabayashi, Y. (2015). Decompositions of triangle-free 5-regular graphs into paths of length five. Discrete Mathematics, 338( 11), 1845–1855. doi:10.1016/j.disc.2015.04.018
    • NLM

      Botler F, Mota GO, Wakabayashi Y. Decompositions of triangle-free 5-regular graphs into paths of length five [Internet]. Discrete Mathematics. 2015 ; 338( 11): 1845–1855.Available from: http://dx.doi.org/10.1016/j.disc.2015.04.018
    • Vancouver

      Botler F, Mota GO, Wakabayashi Y. Decompositions of triangle-free 5-regular graphs into paths of length five [Internet]. Discrete Mathematics. 2015 ; 338( 11): 1845–1855.Available from: http://dx.doi.org/10.1016/j.disc.2015.04.018

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo     2012 - 2020