Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
From MaRDI portal
Publication:2373445
Recommendations
- Approximability of Edge Matching Puzzles
- On the exact complexity of polyomino packing
- On the exact complexity of polyomino packing
- Puzzles and polytope isomorphisms
- Solving jigsaw puzzles by the graph connection Laplacian
- A global approach for solving edge-matching puzzles
- scientific article; zbMATH DE number 687006
Cites work
- A global approach to automatic solution of jigsaw puzzles
- Average Case Complete Problems
- Backtrack programming techniques
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Hard tiling problems with simple tiles
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 3217981 (Why is no real title available?)
- scientific article; zbMATH DE number 3238325 (Why is no real title available?)
- On packing squares with equal squares
- On the dissection of rectangles into right-angled isosceles triangles
- Online square and cube packing
- Packing unit squares in squares: A survey and new results
- Simple perfect squared square of lowest order
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- Squaring the Square
- The dissection of rectangles into squares
- The optimality of a certain purely recursive dissection for a sequentially n-divisible square
- The Quest of the Perfect Square
- The undecidability of the domino problem
Cited in
(33)- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- Hierarchical fragmented image reassembly using a bundle-of-superpixel representation
- On the exact complexity of polyomino packing
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
- Symmetric assembly puzzles are hard, beyond a few pieces
- Wooden geometric puzzles: Design and hardness proofs
- On the hardness of solving edge matching puzzles as SAT or CSP problems
- No easy puzzles: hardness results for jigsaw puzzles
- Small polyomino packing
- Spherical quadratic equations in free metabelian groups.
- Variations on instant insanity
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Dissection with the fewest pieces is hard, even to approximate
- Symmetric assembly puzzles are hard, beyond a few pieces
- Edge-matching problems with rotations
- On the exact complexity of polyomino packing
- Approximability of Edge Matching Puzzles
- Computational complexity of cast puzzles
- Games, Puzzles and Treewidth
- Solving jigsaw puzzles by the graph connection Laplacian
- A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles
- A global approach for solving edge-matching puzzles
- Wooden Geometric Puzzles: Design and Hardness Proofs
- HIROIMONO Is NP-Complete
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
- Mathematical characterizations and computational complexity of anti-slide puzzles
- Hard and easy instances of L-tromino tilings
- A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
- An integer linear programming approach to solving the Eternity puzzle
- Rectangle packing with additional restrictions
- Computational complexity of puzzles and related topics
- Comprehensive survey of the solving puzzle problems
- Tile-based knot assembly with Celtic!
This page was built for publication: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373445)
