| Partitioning a graph into balanced connected classes: Formulations, separation and experiments FK Miyazawa, PFS Moura, MJ Ota, Y Wakabayashi European journal of operational research 293 (3), 826-836, 2021 | 27 | 2021 |
| Exhaustive and semi-exhaustive procedural content generation N Sturtevant, M Ota Proceedings of the AAAI Conference on Artificial Intelligence and …, 2018 | 20 | 2018 |
| Cut and Flow Formulations for the Balanced Connected k-Partition Problem FK Miyazawa, PFS Moura, MJ Ota, Y Wakabayashi International Symposium on Combinatorial Optimization, 128-139, 2020 | 11 | 2020 |
| Approximation and parameterized algorithms for balanced connected partition problems PFS Moura, MJ Ota, Y Wakabayashi Conference on Algorithms and Discrete Applied Mathematics, 211-223, 2022 | 3 | 2022 |
| Algoritmo de Branch-Cut-and-Price para o Problema do Roteamento de Veículos Capacitados MJ Ota, FK Miyazawa, R Técnico-IC-PFG, PF de Graduação Revista dos Trabalhos de Iniciação Científica da UNICAMP, 2018 | 2 | 2018 |
| COMBINATORIAL DUAL BOUNDS ON THE LEAST COST INFLUENCE PROBLEM RS Melo, AL Vignatti, FK Miyazawa, MJ Ota Pesquisa Operacional 43, e275468, 2023 | | 2023 |
| Balanced connected partitions of graphs: approximation, parameterization and lower bounds PFS Moura, MJ Ota, Y Wakabayashi Journal of Combinatorial Optimization 45 (5), 127, 2023 | | 2023 |
| The balanced connected k-partition problem: polyhedra and algorithms= O problema da k-partição conexa balanceada: poliedros e algoritmos MJ Ota [sn], 2020 | | 2020 |
Phablo F. S. MouraKU LeuvenVerified email at kuleuven.be
