57 citations · 83 across the 11 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CC2013
Domino Tatami Covering is NP-complete
Alejandro Erickson, Frank Ruskey
A covering with dominoes of a rectilinear region is called \emph{tatami} if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering.…
math.CO2013★ 2 cited
Enumerating maximal tatami mat coverings of square grids with vertical dominoes
Alejandro Erickson, Frank Ruskey
We enumerate a certain class of monomino-domino coverings of square grids, which conform to the \emph{tatami} restriction; no four tiles meet. Let be the set of mon…
math.CO2013
Tatami Maker: A combinatorially rich mechanical game board
Alejandro Erickson
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectil…