Pages that link to "Item:Q6051995"
From MaRDI portal
The following pages link to Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995):
Displaying 8 items.
- Packing polyominoes clumsily (Q390365) (← links)
- The complexity of generalized domino tilings (Q396923) (← links)
- Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion (Q1366534) (← links)
- Tile complexity of approximate squares (Q1949754) (← links)
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino (Q3132886) (← links)
- Optimal Partial Tiling of Manhattan Polyominoes (Q3648774) (← links)
- (Q4850437) (← links)
- (Q5144727) (← links)