Exhaustive and Semi-Exhaustive Procedural Content Generation. - Nathan R. Sturtevant; Matheus Jun Ota (AIIDE, 2018)

Integer Programming Approaches to Balanced Connected k-Partition. - Flávio Keidi Miyazawa; Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (CoRR, 2019)

Cut and Flow Formulations for the Balanced Connected k-Partition Problem. - Flávio Keidi Miyazawa; Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (ISCO, 2020)

Approximation and parameterized algorithms to find balanced connected partitions of graphs. - Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (CoRR, 2021)

Partitioning a graph into balanced connected classes: Formulations, separation and experiments. - Flávio Keidi Miyazawa; Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (Eur. J. Oper. Res., 2021)

Approximation and Parameterized Algorithms for Balanced Connected Partition Problems. - Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (CALDAM, 2022)

Balanced connected partitions of graphs: approximation, parameterization and lower bounds. - Phablo F. S. Moura; Matheus Jun Ota; Yoshiko Wakabayashi (J. Comb. Optim., 2023)

Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios. - Matheus Jun Ota; Ricardo Fukasawa (Oper. Res., 2025)