Optimal Partial Tiling of Manhattan Polyominoes
From MaRDI portal
Optimal Partial Tiling of Manhattan Polyominoes
Recommendations
- An optimal algorithm for tiling the plane with a translated polyomino
- Some open problems in polyomino tilings
- Minimum boundary touching tilings of polyominoes
- Tiling the Plane with a Fixed Number of Polyominoes
- scientific article; zbMATH DE number 797900
- Polyomino convolutions and tiling problems
- Variations on tilings in the Manhattan metric
- Tiling with Squares and Packing Dominos in Polynomial Time
Cites work
- A note on tiling with integer-sided rectangles
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An O(n n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
- Conway's Tiling Groups
- Domino tilings on planar regions
- Faster Scaling Algorithms for Network Problems
- scientific article; zbMATH DE number 69340 (Why is no real title available?)
- Maximal Flow Through a Network
- Planar Dimer Tilings
- The lattice structure of the set of domino tilings of a polygon
- Tiling pictures of the plane with dominoes
- Tiling with polyominoes and combinatorial group theory
Cited in
(3)
This page was built for publication: Optimal Partial Tiling of Manhattan Polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648774)
