Tile-based knot assembly with celtic!

DOI10.1007/S00236-026-00533-2MaRDI QIDQ7309115zbMATH OpenFDO

Authors Ryan Knobel, Juan Manuel Pérez, Rene Reyes, Ramiro Santos, Tim Wylie

Publication date 4 August 2026

Published in Acta Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/S00236-026-00533-2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
• Games, puzzles, and computation
• scientific article; zbMATH DE number 2143606 (Why is no real title available?)
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• New mathematical pastimes.
• Tetravex is NP-complete
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• The undecidability of the domino problem
• Tile-based knot assembly with Celtic!

This page was built for publication: Tile-based knot assembly with celtic!

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309115)