Filtros : "Wakabayashi, Yoshiko" Limpar

Filtros



Refine with date range


  • Source: European Journal of Operational Research. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Disponível em 2023-01-05Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MIYAZAWA, Flavio Keidi; MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko; OTA, Matheus Jun. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, Amsterdam, 2021. Disponível em: < https://doi.org/10.1016/j.ejor.2020.12.059 > DOI: 10.1016/j.ejor.2020.12.059.
    • APA

      Miyazawa, F. K., Moura, P. F. S., Wakabayashi, Y., & Ota, M. J. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research. doi:10.1016/j.ejor.2020.12.059
    • NLM

      Miyazawa FK, Moura PFS, Wakabayashi Y, Ota MJ. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ;Available from: https://doi.org/10.1016/j.ejor.2020.12.059
    • Vancouver

      Miyazawa FK, Moura PFS, Wakabayashi Y, Ota MJ. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ;Available from: https://doi.org/10.1016/j.ejor.2020.12.059
  • Source: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão AceitaAcesso à fonteDOIHow to cite
    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, 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
  • Source: Proceedings. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Assunto: PROGRAMAÇÃO LINEAR

    PrivadoAcesso à fonteDOIHow to cite
    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
  • Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

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

    Versão AceitaAcesso à fonteDOIHow to cite
    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
  • Conference titles: Joint Meeting Brazil-France in Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteHow to cite
    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
  • Source: International Journal of Foundations of Computer Science. Unidade: IME

    Assunto: TEORIA DOS JOGOS

    PrivadoAcesso à fonteDOIHow to cite
    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, 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
  • Unidade: IME

    Assunto: CIENCIA DA COMPUTACAO

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

      GÓMEZ DIAZ, Renzo Gonzalo; WAKABAYASHI, Yoshiko. Covering graphs by nontrivial paths. 2019.Universidade de São Paulo, São Paulo, 2019. Disponível em: < http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08112019-153707/ >.
    • APA

      Gómez Diaz, R. G., & Wakabayashi, Y. (2019). Covering graphs by nontrivial paths. Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08112019-153707/
    • NLM

      Gómez Diaz RG, Wakabayashi Y. Covering graphs by nontrivial paths [Internet]. 2019 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08112019-153707/
    • Vancouver

      Gómez Diaz RG, Wakabayashi Y. Covering graphs by nontrivial paths [Internet]. 2019 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-08112019-153707/
  • Conference titles: Encontro Brasileiro de Mulheres Matemáticas. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteHow to cite
    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
  • Unidade: IME

    Assunto: CIENCIA DA COMPUTACAO

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

      BRAGA, Hugo Vinicius Vaz; WAKABAYASHI, Yoshiko. Algoritmos exatos para problemas de spanner em grafos. 2018.Universidade de São Paulo, São Paulo, 2018. Disponível em: < http://www.teses.usp.br/teses/disponiveis/45/45134/tde-01042019-093402/ >.
    • APA

      Braga, H. V. V., & Wakabayashi, Y. (2018). Algoritmos exatos para problemas de spanner em grafos. Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-01042019-093402/
    • NLM

      Braga HVV, Wakabayashi Y. Algoritmos exatos para problemas de spanner em grafos [Internet]. 2018 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-01042019-093402/
    • Vancouver

      Braga HVV, Wakabayashi Y. Algoritmos exatos para problemas de spanner em grafos [Internet]. 2018 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-01042019-093402/
  • Source: Discrete Applied Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      BOTLER, Fábio Happ; MOTA, Guilherme Oliveira; 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
  • Source: Proceedings. Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG. Unidade: IME

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

    PrivadoAcesso à fonteDOIHow to cite
    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
  • Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN 2018. Unidade: IME

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

    PrivadoAcesso à fonteDOIHow to cite
    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
  • Source: Anais. Conference titles: Congresso da Sociedade Brasileira de Computação - CSBC. Unidade: IME

    Assunto: ANÁLISE NUMÉRICA APLICADA

    Acesso à fonteHow to cite
    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
  • 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

    Acesso à fonteDOIHow to cite
    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
  • Source: Journal of Combinatorial Theory, Series B. Unidade: IME

    Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS

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

      BOTLER, Fábio Happ; MOTA, Guilherme Oliveira; OSHIRO, Marcio Takashi Iura; WAKABAYASHI, Yoshiko. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B[S.l.], 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
  • Source: European Journal of Combinatorics. Conference titles: Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME

    Assunto: COMBINATÓRIA

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

      BOTLER, Fábio Happ; MOTA, Guilherme Oliveira; OSHIRO, Marcio Takashi Iura; WAKABAYASHI, Yoshiko. Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics[S.l: s.n.], 2017.Disponível em: 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. Amsterdam: Elsevier. 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
  • Unidade: IME

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

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

      COELHO, Rafael Santos; WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: approximation algorithms and hardness results. 2017.Universidade de São Paulo, São Paulo, 2017. Disponível em: < http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/ >.
    • APA

      Coelho, R. S., & Wakabayashi, Y. (2017). The k-hop connected dominating set problem: approximation algorithms and hardness results. Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/
    • NLM

      Coelho RS, Wakabayashi Y. The k-hop connected dominating set problem: approximation algorithms and hardness results [Internet]. 2017 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/
    • Vancouver

      Coelho RS, Wakabayashi Y. The k-hop connected dominating set problem: approximation algorithms and hardness results [Internet]. 2017 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/
  • Unidade: IME

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

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

      MOURA, Phablo Fernando Soares; WAKABAYASHI, Yoshiko. Graph colorings and digraph subdivisions. 2017.Universidade de São Paulo, São Paulo, 2017. Disponível em: < http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/ >.
    • APA

      Moura, P. F. S., & Wakabayashi, Y. (2017). Graph colorings and digraph subdivisions. Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/
    • NLM

      Moura PFS, Wakabayashi Y. Graph colorings and digraph subdivisions [Internet]. 2017 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/
    • Vancouver

      Moura PFS, Wakabayashi Y. Graph colorings and digraph subdivisions [Internet]. 2017 ;Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-23052017-100619/
  • Source: Journal of Combinatorial Optimization. Unidade: IME

    Assunto: COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    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
  • Source: Discrete Mathematics and Theoretical Computer Science. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    How to cite
    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 ].

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2021