ReP USP - Resultado da busca

Artigo de periodico
Polynomial algorithms for sparse spanners on subcubic graphs (2024)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GRÁFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Polynomial algorithms for sparse spanners on subcubic graphs. Journal of Combinatorial Optimization, v. 48, n. artigo 11, p. 1-21, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10878-024-01197-9. Acesso em: 23 abr. 2025.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2024). Polynomial algorithms for sparse spanners on subcubic graphs. Journal of Combinatorial Optimization, 48( artigo 11), 1-21. doi:10.1007/s10878-024-01197-9
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Polynomial algorithms for sparse spanners on subcubic graphs [Internet]. Journal of Combinatorial Optimization. 2024 ; 48( artigo 11): 1-21.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/s10878-024-01197-9
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Polynomial algorithms for sparse spanners on subcubic graphs [Internet]. Journal of Combinatorial Optimization. 2024 ; 48( artigo 11): 1-21.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/s10878-024-01197-9
Artigo de periodico
Density of identifying codes of hexagonal grids with finite number of rows (2024)
Sampaio, Rudini Menezes ; Sobral, Gabriel Augusto Gonçalves ; Wakabayashi, Yoshiko
Source: RAIRO - Operations Research. Unidades: IME, Interunidades em Bioinformática
Subjects: TEORIA DA INFORMAÇÃO, TEORIA DA COMUNICAÇÃO, TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAMPAIO, Rudini Menezes e SOBRAL, Gabriel Augusto Gonçalves e WAKABAYASHI, Yoshiko. Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, v. 58, n. 2, p. 1633-1651, 2024Tradução . . Disponível em: https://doi.org/10.1051/ro/2024046. Acesso em: 23 abr. 2025.
APA
Sampaio, R. M., Sobral, G. A. G., & Wakabayashi, Y. (2024). Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, 58( 2), 1633-1651. doi:10.1051/ro/2024046
NLM
Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1051/ro/2024046
Vancouver
Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1051/ro/2024046
Trabalho de evento
An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph (2024)
Azevedo, Gabriel Morete de ; Wakabayashi, Yoshiko
Source: Anais. Conference titles: Encontro de Teori a da Computação - ETC 2024. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AZEVEDO, Gabriel Morete de e WAKABAYASHI, Yoshiko. An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph. 2024, Anais.. Porto Alegre: Instituto de Matemática e Estatística, Universidade de São Paulo, 2024. Disponível em: https://doi.org/10.5753/etc.2024.2500. Acesso em: 23 abr. 2025.
APA
Azevedo, G. M. de, & Wakabayashi, Y. (2024). An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph. In Anais. Porto Alegre: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.5753/etc.2024.2500
NLM
Azevedo GM de, Wakabayashi Y. An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph [Internet]. Anais. 2024 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.5753/etc.2024.2500
Vancouver
Azevedo GM de, Wakabayashi Y. An efficient algorithm to add up-links to a rooted tree to obtain a minimum cost 2-connected graph [Internet]. Anais. 2024 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.5753/etc.2024.2500
Artigo de periodico
Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs (2023)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, v. 947, n. artigo 113691, p. 1-13, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2023.113691. Acesso em: 23 abr. 2025.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2023). Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs. Theoretical Computer Science, 947( artigo 113691), 1-13. doi:10.1016/j.tcs.2023.113691
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Improved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs [Internet]. Theoretical Computer Science. 2023 ; 947( artigo 113691): 1-13.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1016/j.tcs.2023.113691
Artigo de periodico
Balanced connected partitions of graphs: approximation, parameterization and lower bounds (2023)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
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. Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, v. 45, n. artigo 127, p. 1-27, 2023Tradução . . Disponível em: https://doi.org/10.1007/s10878-023-01058-x. Acesso em: 23 abr. 2025.
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2023). Balanced connected partitions of graphs: approximation, parameterization and lower bounds. Journal of Combinatorial Optimization, 45( artigo 127), 1-27. doi:10.1007/s10878-023-01058-x
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Balanced connected partitions of graphs: approximation, parameterization and lower bounds [Internet]. Journal of Combinatorial Optimization. 2023 ; 45( artigo 127): 1-27.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/s10878-023-01058-x
Trabalho de evento
Minimum t-spanners on subcubic graphs (2022)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Conference and Workshops on Algorithms and Computation - WALCOM. Unidade: IME
Subjects: TEORIA DOS GRAFOS, APROXIMAÇÃO POR POLINÔMIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Minimum t-spanners on subcubic graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-96731-4_30. Acesso em: 23 abr. 2025.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Minimum t-spanners on subcubic graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-96731-4_30
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Minimum t-spanners on subcubic graphs [Internet]. Proceedings. 2022 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/978-3-030-96731-4_30
Artigo de periodico
Techniques and results on approximation algorithms for packing circles (2022)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: São Paulo Journal of Mathematical Sciences. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, v. 16, n. 1, p. 585-615, 2022Tradução . . Disponível em: https://doi.org/10.1007/s40863-022-00301-3. Acesso em: 23 abr. 2025.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2022). Techniques and results on approximation algorithms for packing circles. São Paulo Journal of Mathematical Sciences, 16( 1), 585-615. doi:10.1007/s40863-022-00301-3
NLM
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Vancouver
Miyazawa FK, Wakabayashi Y. Techniques and results on approximation algorithms for packing circles [Internet]. São Paulo Journal of Mathematical Sciences. 2022 ; 16( 1): 585-615.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/s40863-022-00301-3
Trabalho de evento
Tree 3-spanners on generalized prisms of graphs (2022)
Gómez, Renzo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American 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
GÓMEZ, Renzo e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Tree 3-spanners on generalized prisms of graphs. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-031-20624-5_34. Acesso em: 23 abr. 2025.
APA
Gómez, R., Miyazawa, F. K., & Wakabayashi, Y. (2022). Tree 3-spanners on generalized prisms of graphs. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-20624-5_34
NLM
Gómez R, Miyazawa FK, Wakabayashi Y. Tree 3-spanners on generalized prisms of graphs [Internet]. Proceedings. 2022 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_34
Vancouver
Gómez R, Miyazawa FK, Wakabayashi Y. Tree 3-spanners on generalized prisms of graphs [Internet]. Proceedings. 2022 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_34
Trabalho de evento
Approximation and parameterized algorithms for balanced connected partition problems (2022)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: 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. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-95018-7_17. Acesso em: 23 abr. 2025.
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2022). Approximation and parameterized algorithms for balanced connected partition problems. In 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17
Trabalho de evento
Minimum density of identifying codes of hexagonal grids with a finite number of rows (2022)
Sampaio, Rudini Menezes ; Sobral, Gabriel A. G.; Wakabayashi, Yoshiko ; Congresso da Sociedade Brasileira de Computação - CSBC
Source: Anais. Conference titles: Encontro de Teoria da Computação - ETC. Unidade: IME
Assunto: COMPUTAÇÃO APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAMPAIO, Rudini Menezes et al. Minimum density of identifying codes of hexagonal grids with a finite number of rows. 2022, Anais.. Porto Alegre: Sociedade Brasileira de Computação, 2022. Disponível em: https://doi.org/10.5753/etc.2022.223348. Acesso em: 23 abr. 2025.
APA
Sampaio, R. M., Sobral, G. A. G., Wakabayashi, Y., & Congresso da Sociedade Brasileira de Computação - CSBC,. (2022). Minimum density of identifying codes of hexagonal grids with a finite number of rows. In Anais. Porto Alegre: Sociedade Brasileira de Computação. doi:10.5753/etc.2022.223348
NLM
Sampaio RM, Sobral GAG, Wakabayashi Y, Congresso da Sociedade Brasileira de Computação - CSBC. Minimum density of identifying codes of hexagonal grids with a finite number of rows [Internet]. Anais. 2022 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.5753/etc.2022.223348
Vancouver
Sampaio RM, Sobral GAG, Wakabayashi Y, Congresso da Sociedade Brasileira de Computação - CSBC. Minimum density of identifying codes of hexagonal grids with a finite number of rows [Internet]. Anais. 2022 ;[citado 2025 abr. 23 ] Available from: https://doi.org/10.5753/etc.2022.223348
Artigo de periodico
A tight lower bound for the online bounded space hypercube bin packing problem (2021)
Kohayakawa, Yoshiharu ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Discrete Mathematics & Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, v. 23, n. 3, p. 1-13, 2021Tradução . . Disponível em: https://doi.org/10.46298/dmtcs.8325. Acesso em: 23 abr. 2025.
APA
Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2021). A tight lower bound for the online bounded space hypercube bin packing problem. Discrete Mathematics & Theoretical Computer Science, 23( 3), 1-13. doi:10.46298/dmtcs.8325
NLM
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2025 abr. 23 ] Available from: https://doi.org/10.46298/dmtcs.8325
Vancouver
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for the online bounded space hypercube bin packing problem [Internet]. Discrete Mathematics & Theoretical Computer Science. 2021 ; 23( 3): 1-13.[citado 2025 abr. 23 ] Available from: https://doi.org/10.46298/dmtcs.8325
Trabalho de evento-anais periodico
The 2-Decomposition Conjecture for a new class of graphs (2021)
Botler, Fábio Happ ; Jiménez, Andrea; Sambinelli, Maycon ; Wakabayashi, Yoshiko
Source: Procedia Computer Science. Conference titles: Latin and 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. The 2-Decomposition Conjecture for a new class of graphs. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.procs.2021.11.044. Acesso em: 23 abr. 2025. , 2021
APA
Botler, F. H., Jiménez, A., Sambinelli, M., & Wakabayashi, Y. (2021). The 2-Decomposition Conjecture for a new class of graphs. Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.procs.2021.11.044
NLM
Botler FH, Jiménez A, Sambinelli M, Wakabayashi Y. The 2-Decomposition Conjecture for a new class of graphs [Internet]. Procedia Computer Science. 2021 ; 195 359-367.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1016/j.procs.2021.11.044
Vancouver
Botler FH, Jiménez A, Sambinelli M, Wakabayashi Y. The 2-Decomposition Conjecture for a new class of graphs [Internet]. Procedia Computer Science. 2021 ; 195 359-367.[citado 2025 abr. 23 ] Available from: https://doi.org/10.1016/j.procs.2021.11.044
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
Source: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059
Artigo de periodico
Partições conexas balanceadas de grafos (2020)
Wakabayashi, Yoshiko
Source: Computação Brasil. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
WAKABAYASHI, Yoshiko. Partições conexas balanceadas de grafos. Computação Brasil, n. 43, p. 39-42, 2020Tradução . . Disponível em: https://doi.org/10.5753/compbr.2020.43.1796. Acesso em: 23 abr. 2025.
APA
Wakabayashi, Y. (2020). Partições conexas balanceadas de grafos. Computação Brasil, ( 43), 39-42. doi:10.5753/compbr.2020.43.1796
NLM
Wakabayashi Y. Partições conexas balanceadas de grafos [Internet]. Computação Brasil. 2020 ;( 43): 39-42.[citado 2025 abr. 23 ] Available from: https://doi.org/10.5753/compbr.2020.43.1796
Vancouver
Wakabayashi Y. Partições conexas balanceadas de grafos [Internet]. Computação Brasil. 2020 ;( 43): 39-42.[citado 2025 abr. 23 ] Available from: https://doi.org/10.5753/compbr.2020.43.1796
Artigo de periodico
Nontrivial path covers of graphs: existence, minimization and maximization (2020)
Gómez, Renzo ; Wakabayashi, Yoshiko
Source: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] 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
Source: Proceedings. Conference titles: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] 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
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
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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002
Trabalho de evento-resumo
Decomposing highly connected graphs into paths on any given length (2019)
Wakabayashi, Yoshiko
Conference titles: Joint Meeting Brazil-France in Mathematics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
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. 2019, Anais.. Rio de Janeiro: Impa, 2019. Disponível em: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf. Acesso em: 23 abr. 2025.
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 ;[citado 2025 abr. 23 ] 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 ;[citado 2025 abr. 23 ] Available from: https://impa.br/wp-content/uploads/2019/07/Book-of-abstracts.pdf
Artigo de periodico
Prices of anarchy of selfish 2D bin packing games (2019)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: 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: 23 abr. 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 abr. 23 ] 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 abr. 23 ] Available from: https://doi.org/10.1142/s0129054119500096
Trabalho de evento-resumo
Grafos e otimização combinatória (2019)
Wakabayashi, Yoshiko
Conference titles: Encontro Brasileiro de Mulheres Matemáticas. Unidade: IME
Assunto: TEORIA DOS GRAFOS
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. 2019, Anais.. Rio de Janeiro: Impa, 2019. Disponível em: https://impa.br/wp-content/uploads/2019/05/EBMM2019-PE_YoshikoWakabayashi-new.pdf. Acesso em: 23 abr. 2025.
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 ;[citado 2025 abr. 23 ] 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 ;[citado 2025 abr. 23 ] Available from: https://impa.br/wp-content/uploads/2019/05/EBMM2019-PE_YoshikoWakabayashi-new.pdf

USP Schools

ReP

Filtros

Document Types

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration