Pages that link to "Item:Q2255820"
From MaRDI portal
The following pages link to On the generation of convex polyominoes (Q2255820):
Displaying 18 items.
- On computing the degree of convexity of polyominoes (Q490307) (← links)
- Code for polyomino and computer search of isospectral polyominoes (Q512885) (← links)
- On the exhaustive generation of \(k\)-convex polyominoes (Q517034) (← links)
- On the generation of 2-polyominoes (Q777992) (← links)
- The generating function of convex polyominoes: The resolution of a \(q\)- differential system (Q1343776) (← links)
- From Tetris to polyominoes generation (Q1687782) (← links)
- On the generation and enumeration of some classes of convex polyominoes (Q1883680) (← links)
- Generating convex polyominoes at random (Q1917521) (← links)
- Partially directed animals with a bounded number of holes (Q2232260) (← links)
- On the generation of convex polyominoes (Q2255820) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- Random generation of \(Q\)-convex sets (Q2576884) (← links)
- (Q3077258) (← links)
- Generation of Polyiamonds for p6 Tiling by the Reverse Search (Q3098073) (← links)
- Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams (Q3111657) (← links)
- (Q3622253) (← links)
- A Dynamical System Approach to Polyominoes Generation* (Q5164875) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901273) (← links)