The following pages link to Tiling with sets of polyominoes (Q4081272):
Displaying 22 items.
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- Spotlight tiling (Q659609) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- Polyominoes which tile rectangles (Q757389) (← links)
- Tiling complexity of small n-ominoes \((N<10)\) (Q1114701) (← links)
- A characterization of recognizable picture languages by tilings by finite sets (Q1292300) (← links)
- A linear algorithm to tile the trapezes with \(h_ m\) and \(v_ n\) (Q1314412) (← links)
- \(q\)-enumeration of convex polyominoes (Q1318368) (← links)
- Polyominoes defined by two vectors (Q1325843) (← links)
- Tiling figures of the plane with two bars (Q1346250) (← links)
- Tiling rectangles with polyominoes (Q1361145) (← links)
- Tiling rectangles and half strips with congruent polyominoes (Q1369734) (← links)
- A codicity undecidable problem in the plane. (Q1401375) (← links)
- Tiling with arbitrary tiles (Q3186407) (← links)
- A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
- Tiling the Plane with a Fixed Number of Polyominoes (Q3618618) (← links)
- A neural network approach to tiling problems (Q4328848) (← links)
- TILING WITH PUNCTURED INTERVALS (Q4962532) (← links)
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES (Q5322313) (← links)
- Homology of polyomino tilings on flat surfaces (Q5866243) (← links)
- Undecidable translational tilings with only two tiles, or one nonabelian tile (Q6142360) (← links)
