Pages that link to "Item:Q2462322"

The following pages link to Polyominoes with minimum site-perimeter and full set achievement games (Q2462322):

Displaying 10 items.

• Exhaustive generation of gominoes (Q391401) (← links)
• Planar lattice subsets with minimal vertex boundary (Q820851) (← links)
• On isoperimetrically optimal polyforms (Q952470) (← links)
• The site-perimeter of compositions (Q2088717) (← links)
• Minimum-perimeter lattice animals and the constant-isomer conjecture (Q2170800) (← links)
• Rectangular polyomino set weak \((1,2)\)-achievement games (Q2378512) (← links)
• Algorithms for counting minimum-perimeter lattice animals (Q2700382) (← links)
• (Q5088997) (← links)
• The site-perimeter of words (Q5134537) (← links)
• Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami (Q6169891) (← links)