The following pages link to (Q4313096):
Displayed 50 items.
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- 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)
- Code for polyomino and computer search of isospectral polyominoes (Q512885) (← 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)
- Resistance distances in the linear polyomino chain (Q721544) (← 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)
- On tiling the integers with 4-sets of the same gap sequence (Q1699536) (← links)
- A bijection for the total area of parallelogram polyominoes (Q1765238) (← links)
- On Gröbner basis and Cohen-Macaulay property of closed path polyominoes (Q2088696) (← links)
- Polycubes with small perimeter defect (Q2093266) (← links)
- Primality of weakly connected collections of cells and weakly closed path polyominoes (Q2103558) (← links)
- Primality of multiply connected polyominoes (Q2192221) (← links)
- Hilbert series of simple thin polyominoes (Q2240736) (← links)
- Parliament seating assignment problems (Q2242347) (← links)
- Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
- Small polyomino packing (Q2361496) (← 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)
- Conformal mappings of stretched polyominoes onto half-plane (Q2399800) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
- Regularity of binomial edge ideals of certain block graphs (Q2422788) (← 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)
- Hilbert series of parallelogram polyominoes (Q2671740) (← links)
- On degree-based topological indices of random polyomino chains (Q2688570) (← links)
- Covering rectangles by few monotonous polyominoes (Q2694864) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Packing cube nets into rectangles with \(O(1)\) holes (Q2695481) (← links)