Checker Boards and Polyominoes
From MaRDI portal
Cited in
(80)- The PI index of polyomino chains
- On the tiling by translation problem
- Tromino tilings of domino-deficient rectangles
- All solutions of the Soma cube puzzle
- Tiling complexity of small n-ominoes \((N<10)\)
- Tilings of lattice points in Euclidean n-space
- Counting polyominoes: yet another attack
- Maximal superpositions of horizontally convex polyominoes
- Frontier between decidability and undecidability: A survey
- From Tetris to polyominoes generation
- On tiling the integers with 4-sets of the same gap sequence
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Parallelogram polyominos with border and Bessel functions
- Tiling with polyominoes and combinatorial group theory
- On column-convex and convex Carlitz polyominoes
- Automatic generation of formulae for polyominoes with a fixed perimeter defect
- A decomposition of column-convex polyominoes and two vertex statistics
- High-dimensional holeyominoes
- Smooth column convex polyominoes
- Partially directed animals with a bounded number of holes
- On the generation of convex polyominoes
- The number of directed \(k\)-convex polyominoes
- Combinatorial aspects of \(L\)-convex polyominoes
- On the enumeration of \(k\)-omino towers
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
- The number of Z-convex polyominoes
- A reconstruction algorithm for L-convex polyominoes.
- On directed-convex polyominoes in a rectangle
- Geometric properties of matrices induced by pattern avoidance
- Packing cube nets into rectangles with O(1) holes
- Algorithms for counting minimum-perimeter lattice animals
- Permutation classes and polyomino classes with excluded submatrices
- A new mathematical model for tiling finite regions of the plane with polyominoes
- I-tromino tilings of holey squares
- Recognizable Picture Languages and Polyominoes
- History and introduction to polygon models and polyominoes
- Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
- A Partition Theory of Planar Animals
- Exhaustive generation of gominoes
- Counting k-convex polyominoes
- Non-lattice-periodic tilings of R^3 by single polycubes
- Ribbon tile invariants
- Tiling Squares with Big Holes with L-trominoes
- Tiling One-Deficient Rectangular Solids with Trominoes in Three and Higher Dimensions
- On computing the degree of convexity of polyominoes
- Restricted Lego towers
- On Wiener index and Wiener polarity index of some polyomino chains
- Properties of minimal-perimeter polyominoes (multimedia exposition)
- More Fun with L-Trominoes in Three and Higher Dimensions
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- A Dynamical System Approach to Polyominoes Generation*
- On the exhaustive generation of \(k\)-convex polyominoes
- The estimation of the number of p2-tilings of a plane on a polyomino of given area
- Homology of polyomino tilings on flat surfaces
- Tiling with Squares and Packing Dominos in Polynomial Time
- An integer linear programming approach to solving the Eternity puzzle
- Enumeration of polyominoes inscribed in a rectangle
- Computing forgotten topological index of extremal cactus chains
- On the number of isohedral polyominoes
- On the tiling system recognizability of various classes of convex polyominoes
- Tile invariants for tackling tiling questions
- Restricted bargraphs and unimodal compositions
- Exterior corners on bargraphs of Motzkin words
- Reconstructing convex polyominoes from horizontal and vertical projections
- Uniform sampling of fixed size polyominoes
- Smooth convex polyiamonds
- Enumeration of parallelogram polycubes
- Efficient counting of k-convex polyominoes
- Zagreb connection indices on polyomino chains and random polyomino chains
- Complexity of chess domination problems
- Counting of descents in a bargraph and barpolyiamond
- Resistance distances in the linear polyomino chain
- Prime factorization of meanders
- Tiling Deficient Staircase Regions with L -trominoes
- Constructive upper bounds on the rectangle eliminating number in grid graphs
- Centered ascending polyominoes
- On the rectangle eliminating number of grid graphs
- Rectangular tileability and complementary tileability are undecidable
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets
- The PI index of polyomino chains of \(4k\)-cycles
This page was built for publication: Checker Boards and Polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5829800)
