The following pages link to (Q4313096):
Displayed 38 items.
- Helly numbers of polyominoes (Q367067) (← links)
- Packing polyominoes clumsily (Q390365) (← links)
- Exhaustive generation of gominoes (Q391401) (← links)
- Combinatorial properties of double square tiles (Q391406) (← links)
- Many L-shaped polyominoes have odd rectangular packings (Q404475) (← links)
- Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737) (← links)
- Minimal non-convex words (Q544886) (← links)
- Self-affine convex polygons (Q622549) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- Mirror-curves and knot mosaics (Q692286) (← links)
- On the table and the chair (Q698678) (← links)
- Families of irreptiles (Q835324) (← links)
- A generalization of the pentomino exclusion problem: dislocation of graphs (Q864131) (← links)
- On the tiling by translation problem (Q1003706) (← links)
- Tetris and decidability (Q1029095) (← links)
- Gray codes for column-convex polyominoes and a new class of distributive lattices (Q1044890) (← links)
- Enumeration of symmetry classes of convex polyominoes in the square lattice (Q1271866) (← links)
- Tiling rectangles and half strips with congruent polyominoes (Q1369734) (← links)
- The site-perimeter of bargraphs (Q1408282) (← links)
- Solomon Golomb -- some personal reflections plus random biographical and bibliographical notes (Q1570077) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- A bijection for the total area of parallelogram polyominoes (Q1765238) (← links)
- Combinatorial aspects of \(L\)-convex polyominoes (Q2372433) (← links)
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445) (← links)
- A method to generate polyominoes and polyiamonds for tilings with rotational symmetry (Q2373935) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- The number of Z-convex polyominoes (Q2474263) (← links)
- Hinged dissection of polyominoes and polyforms (Q2486086) (← links)
- The discrete Green theorem and some applications in discrete geometry (Q2581344) (← links)
- Regular Geometrical Languages and Tiling the Plane (Q3073623) (← links)
- Tiling a Manhattan Polyomino with Bars (Q3438939) (← links)
- Perfect Matchings of the Small Polyominoes (Q3439310) (← links)
- (Q4461636) (← links)
- (Q4461637) (← links)
- Geometrical Regular Languages and Linear Diophantine Equations (Q5200085) (← links)
- An algorithm for deciding if a polyomino tiles the plane (Q5441544) (← links)
- Polyomino convolutions and tiling problems (Q5947369) (← links)
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets (Q5955123) (← links)