1 citations · 1 across the 3 of their papers we have counts for
3 papers
Approximation and parameterized algorithms to find balanced connected partitions of graphs
Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi
Partitioning a connected graph into ~vertex-disjoint connected subgraphs of similar (or given) orders is a classical problem that has been intensively investigated since late se…
Integer Programming Approaches to Balanced Connected -Partition
Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota +1
We address the problem of partitioning a vertex-weighted connected graph into connected subgraphs that have similar weights, for a fixed integer . This problem, known…
Prices of anarchy of selfish 2D bin packing games
Cristina G. Fernandes, Carlos E. Ferreira, Flávio K. Miyazawa +1
We consider a game-theoretical problem called selfish 2-dimensional bin packing game, a generalization of the 1-dimensional case already treated in the literature. In this game, th…