ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Approximation and parameterized algorithms for balanced connected partition problems (2022)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Fonte: Proceedings. Nome do evento: Conference on Algorithms and Discrete Applied Mathematics - CALDAM. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Approximation and parameterized algorithms for balanced connected partition problems. Proceedings. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-95018-7_17. Acesso em: 08 out. 2025. , 2022
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2022). Approximation and parameterized algorithms for balanced connected partition problems. Proceedings. Cham: Springer. doi:10.1007/978-3-030-95018-7_17
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Approximation and parameterized algorithms for balanced connected partition problems [Internet]. Proceedings. 2022 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Approximation and parameterized algorithms for balanced connected partition problems [Internet]. Proceedings. 2022 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17
Artigo de periodico
Partitioning a graph into balanced connected classes: Formulations, separation and experiments (2021)
Miyazawa, Flavio Keidi ; Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Fonte: European Journal of Operational Research. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi et al. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, v. 293, n. 3, p. 826-836, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.059. Acesso em: 08 out. 2025.
APA
Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, 293( 3), 826-836. doi:10.1016/j.ejor.2020.12.059
NLM
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
Vancouver
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
Artigo de periodico
Nontrivial path covers of graphs: existence, minimization and maximization (2020)
Gómez, Renzo ; Wakabayashi, Yoshiko
Fonte: Journal of Combinatorial Optimization. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e WAKABAYASHI, Yoshiko. Nontrivial path covers of graphs: existence, minimization and maximization. Journal of Combinatorial Optimization, v. 39, n. 2, p. 437-456, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10878-019-00488-w. Acesso em: 08 out. 2025.
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.[citado 2025 out. 08 ] 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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10878-019-00488-w
Trabalho de evento
Cut and flow formulations for the balanced connected k-partition problem (2020)
Miyazawa, Flavio Keidi ; Moura, Phablo Fernando Soares ; Ota, Matheus J; Wakabayashi, Yoshiko
Fonte: Proceedings. Nome do evento: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi et al. Cut and flow formulations for the balanced connected k-partition problem. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-53262-8_11. Acesso em: 08 out. 2025.
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 ;[citado 2025 out. 08 ] 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 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-030-53262-8_11
Trabalho de evento-anais periodico
Strong intractability results for generalized convex recoloring problems (2020)
Moura, Phablo Fernando Soares ; Wakabayashi, Yoshiko
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
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 results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.dam.2019.08.002. Acesso em: 08 out. 2025. , 2020
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.[citado 2025 out. 08 ] Available from: https://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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002
Artigo de periodico
Prices of anarchy of selfish 2D bin packing games (2019)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Fonte: International Journal of Foundations of Computer Science. Unidade: IME
Assunto: TEORIA DOS JOGOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. Prices of anarchy of selfish 2D bin packing games. International Journal of Foundations of Computer Science, v. 30, n. 03, p. 355-374, 2019Tradução . . Disponível em: https://doi.org/10.1142/s0129054119500096. Acesso em: 08 out. 2025.
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.[citado 2025 out. 08 ] Available from: https://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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1142/s0129054119500096
Trabalho de evento
Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (2018)
Gómez, Renzo; Wakabayashi, Yoshiko
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
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e WAKABAYASHI, Yoshiko. Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-030-00256-5_19. Acesso em: 08 out. 2025.
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 ;[citado 2025 out. 08 ] 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 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-030-00256-5_19
Trabalho de evento-anais periodico
Decomposing highly connected graphs into paths of length five (2018)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Fonte: Discrete Applied Mathematics. Nome do evento: Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decomposing highly connected graphs into paths of length five. 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.2016.08.001. Acesso em: 08 out. 2025. , 2018
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. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. 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.[citado 2025 out. 08 ] Available from: https://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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.dam.2016.08.001
Trabalho de evento
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (2018)
Kohayakawa, Yoshiharu ; Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko
Fonte: Proceedings. Nome do evento: Latin American Symposium on Theoretical Informatics - LATIN 2018. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-77404-6_51. Acesso em: 08 out. 2025.
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 ;[citado 2025 out. 08 ] 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 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51
Trabalho de evento-anais periodico
Strong intractability of generalized convex recoloring problems (2017)
Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
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
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: 08 out. 2025. , 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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Trabalho de evento-anais periodico
Decomposing regular graphs with prescribed girth into paths of given length (2017)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Fonte: European Journal of Combinatorics. Nome do evento: Conference on Combinatorics, Graph Theory and Applications - EUROCOMB. Unidade: IME
Assunto: 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. Decomposing regular graphs with prescribed girth into paths of given length. European Journal of Combinatorics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.ejc.2017.06.011. Acesso em: 08 out. 2025. , 2017
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.[citado 2025 out. 08 ] Available from: https://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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1016/j.ejc.2017.06.011
Artigo de periodico
The k-hop connected dominating set problem: approximation and hardness (2017)
Coelho, Rafael S; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Fonte: Journal of Combinatorial Optimization. Unidade: IME
Assuntos: COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
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: approximation and hardness. Journal of Combinatorial Optimization, v. 34, n. 4, p. 1060–1083, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10878-017-0128-y. Acesso em: 08 out. 2025.
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.[citado 2025 out. 08 ] Available from: https://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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s10878-017-0128-y
Artigo de periodico
Polynomial-time approximation schemes for circle and other packing problems (2016)
Miyazawa, Flávio K.; Pedrosa, Lehilton L. C.; Schouery, Rafael Crivellari Saliba; Sviridenko, Maxim; Wakabayashi, Yoshiko
Fonte: Algorithmica. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio K. et al. Polynomial-time approximation schemes for circle and other packing problems. Algorithmica, v. 76, n. 2, p. 536-568, 2016Tradução . . Disponível em: https://doi.org/10.1007/s00453-015-0052-4. Acesso em: 08 out. 2025.
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.[citado 2025 out. 08 ] Available from: https://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.[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/s00453-015-0052-4

Unidades USP

ReP

Filtros

Autores

Autores USP

Ano de publicação

Assuntos

Título da fonte

Nome do evento

Agência de fomento

Afiliação dos autores externos não normalizada