5 citations · 5 across the 1 of their papers we have counts for
2 papers
cs.DS2020
Tromino Tilings with Pegs via Flow Networks
Javier T. Akagi, Eduardo A. Canale, Marcos Villagra
A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using tromin…
cs.CC2017★ 5 cited
Hard and Easy Instances of L-Tromino Tilings
Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza +2
We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, no…