The following pages link to Checker Boards and Polyominoes (Q5829800):
Displaying 50 items.
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections (Q387855) (← links)
- Exhaustive generation of gominoes (Q391401) (← links)
- Counting \(k\)-convex polyominoes (Q396773) (← links)
- Non-lattice-periodic tilings of \(\mathbb R^3\) by single polycubes (Q428854) (← links)
- On computing the degree of convexity of polyominoes (Q490307) (← links)
- On the exhaustive generation of \(k\)-convex polyominoes (Q517034) (← links)
- Enumeration of polyominoes inscribed in a rectangle (Q608292) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- Resistance distances in the linear polyomino chain (Q721544) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets (Q967404) (← links)
- The PI index of polyomino chains of \(4k\)-cycles (Q973773) (← links)
- The PI index of polyomino chains (Q1003555) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- Tromino tilings of domino-deficient rectangles (Q1011730) (← links)
- All solutions of the Soma cube puzzle (Q1066811) (← links)
- Tiling complexity of small n-ominoes \((N<10)\) (Q1114701) (← links)
- Tilings of lattice points in Euclidean n-space (Q1149473) (← links)
- Counting polyominoes: yet another attack (Q1155065) (← links)
- Maximal superpositions of horizontally convex polyominoes (Q1292298) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- From Tetris to polyominoes generation (Q1687782) (← links)
- On tiling the integers with 4-sets of the same gap sequence (Q1699536) (← links)
- Bond incident degree (BID) indices of polyomino chains: a unified approach (Q1733541) (← links)
- Parallelogram polyominos with border and Bessel functions (Q1801701) (← links)
- Tiling with polyominoes and combinatorial group theory (Q1812887) (← links)
- On column-convex and convex Carlitz polyominoes (Q2071544) (← links)
- Automatic generation of formulae for polyominoes with a fixed perimeter defect (Q2088891) (← links)
- A decomposition of column-convex polyominoes and two vertex statistics (Q2155173) (← links)
- High-dimensional holeyominoes (Q2161201) (← links)
- Smooth column convex polyominoes (Q2167315) (← links)
- Partially directed animals with a bounded number of holes (Q2232260) (← links)
- On the generation of convex polyominoes (Q2255820) (← links)
- The number of directed \(k\)-convex polyominoes (Q2286592) (← links)
- Combinatorial aspects of \(L\)-convex polyominoes (Q2372433) (← links)
- On the enumeration of \(k\)-omino towers (Q2400563) (← links)
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses (Q2422035) (← links)
- The number of Z-convex polyominoes (Q2474263) (← links)
- A reconstruction algorithm for L-convex polyominoes. (Q2490808) (← links)
- On directed-convex polyominoes in a rectangle (Q2566276) (← links)
- Packing cube nets into rectangles with \(O(1)\) holes (Q2695481) (← links)
- Algorithms for counting minimum-perimeter lattice animals (Q2700382) (← links)
- Permutation classes and polyomino classes with excluded submatrices (Q2971061) (← links)
- A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
- I-tromino tilings of holey squares (Q3382166) (← links)
- Recognizable Picture Languages and Polyominoes (Q3522865) (← links)
- History and Introduction to Polygon Models and Polyominoes (Q3651678) (← links)
- A Partition Theory of Planar Animals (Q3887481) (← links)
