Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes that tile the plane by translation: a polyomino tiles the plane by translation...
Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laur...
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...