by A. Spillner
Preprint series: 04-10, Reports on Computer Science
Abstract: We study the problem of tiling a polyomino \(P\) with
squares such that every square in the tiling has a
nonempty intersection with the boundary of \(P\).
We are especially interested in tilings with a minimum
number of squares and in efficient algorithms to find
Keywords: polyomino, tiling