15 citations · 28 across the 14 of their papers we have counts for
14 papers
Improved Upper Bounds for Dynamic Bin Packing of General, Unit-Fraction, and Power-Fraction Squares
Miguel A. Mini, Flávio K. Miyazawa, Gabriel M. Silva +1
This paper presents significant upper-bound improvements for dynamic 2D square bin packing, where square items arrive and depart over time and the objective is to minimize the peak…
The complexity of minimum-density locating-dominating set in infinite periodic graphs
Arthur C. Gomes, Yoshiko Wakabayashi
A dominating set of a graph is a locating-dominating set (LDS) if, for each pair of distinct vertices not in~, their neighbourhoods in are distinct. Finding a minimu…
Optimal and quasi-optimal locating-dominating densities in the infinite hexagonal grid with a finite number of rows
Arthur C. Gomes, Yoshiko Wakabayashi
A set of vertices of a graph is locating-dominating if is dominating and, for each pair of distinct vertices not in , their neighborhoods in are distinct. We pre…
On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture
F. Botler, A. Jiménez, M. Sambinelli +1
The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph with vertices of degree 2 an…
Boundedness for proper conflict-free and odd colorings
Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer +7
The proper conflict-free chromatic number, , of a graph is the least such that has a proper -coloring in which for each non-isolated vertex there is a co…
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…
A tight lower bound for the online bounded space hypercube bin packing problem
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
In the -dimensional hypercube bin packing problem, a given list of -dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SI…
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…
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
We prove a tight lower bound on the asymptotic performance ratio of the bounded space online -hypercube bin packing problem, solving an open question raised in 2005. In the…
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…
Decomposing highly edge-connected graphs into paths of any given length
Fabio Botler, Guilherme O. Mota, Marcio T. I. Oshiro +1
In 2006, Barát and Thomassen posed the following conjecture: for each tree , there exists a natural number such that, if is a -edge-connected graph and i…
Decompositions of highly connected graphs into paths of length five
Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro +1
We study the Decomposition Conjecture posed by Barát and Thomassen (2006), which states that for every tree there exists a natural number such that, if is a -edg…
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery +2
We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augme…
On path-cycle decompositions of triangle-free graphs
Andrea Jiménez, Yoshiko Wakabayashi
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given…