On the public citation graph
On translating one polyomino to tile the plane
0 signed · 107 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-94-009-2356-0_10openalex-snapshot
Games, Logic and Computers
inferredcites →https://doi.org/10.1007/bf01418780openalex-snapshot
Undecidability and nonperiodicity for tilings of the plane
inferredcites →https://doi.org/10.1016/s0019-9958(84)80007-8openalex-snapshot
Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
inferredcites →https://doi.org/10.1038/scientificamerican1165-98openalex-snapshot
Games, Logic and Computers
inferredcites →https://doi.org/10.1109/tc.1978.1675122openalex-snapshot
Theoretical Limitations on the Efficient Use of Parallel Memories
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199812)29:4<263::aid-jgt5>3.0.co;2-vopenalex-snapshot
Graph labeling and radio channel assignment
inferred← citeshttps://doi.org/10.1007/11809678_44openalex-snapshot
Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
inferred← citeshttps://doi.org/10.1007/11907350_34openalex-snapshot
An Optimal Algorithm for Detecting Pseudo-squares
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_10openalex-snapshot
ECO Method and the Exhaustive Generation of Convex Polyominoes
inferred← citeshttps://doi.org/10.1007/3-540-58265-7_14openalex-snapshot
Periodicity of one-dimensional tilings
inferred← citeshttps://doi.org/10.1007/3-540-62005-2_1openalex-snapshot
On recent trends in discrete geometry in computer science
inferred← citeshttps://doi.org/10.1007/978-3-031-19897-7_12openalex-snapshot
On the Decomposability of Homogeneous Binary Planar Configurations with Respect to a Given Exact Polyomino
inferred← citeshttps://doi.org/10.1007/978-3-032-09544-2_7openalex-snapshot
Exact Polyominoes and Non-decomposability
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_16openalex-snapshot
On the Arithmetics of Discrete Figures
inferred← citeshttps://doi.org/10.1007/978-3-319-07148-0_6openalex-snapshot
An Efficient Algorithm for the Generation of Z-Convex Polyominoes
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_3openalex-snapshot
An Algebraic Geometric Approach to Multidimensional Words
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_17openalex-snapshot
Parallelogram Morphisms and Circular Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_6openalex-snapshot
Some Open Problems in Polyomino Tilings
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_18openalex-snapshot
Periodicity and Almost-Periodicity
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_54openalex-snapshot
Tiling the Plane with a Fixed Number of Polyominoes
inferred← citeshttps://doi.org/10.1007/978-3-642-04397-0_1openalex-snapshot
Arithmetic Discrete Planes Are Quasicrystals
inferred← citeshttps://doi.org/10.1007/978-3-642-04397-0_7openalex-snapshot
Christoffel and Fibonacci Tiles
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_6openalex-snapshot
A Minimal Periods Algorithm with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_8openalex-snapshot
Regular Geometrical Languages and Tiling the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-21073-0_25openalex-snapshot
Planar Configurations Induced by Exact Polyominoes
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_22openalex-snapshot
An Algebraic Geometric Approach to Nivat’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_1openalex-snapshot
An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
inferred← citeshttps://doi.org/10.1007/bf02574004openalex-snapshot
Residual finiteness of surface groups via tessellations
inferred← citeshttps://doi.org/10.1007/bfb0023815openalex-snapshot
A decidability result about convex polyominoes
inferred← citeshttps://doi.org/10.1007/pl00009442openalex-snapshot
Isohedral Polyomino Tiling of the Plane
inferred← citeshttps://doi.org/10.1007/s00454-001-0047-6openalex-snapshot
Hard Tiling Problems with Simple Tiles
inferred← citeshttps://doi.org/10.1007/s00454-022-00405-9openalex-snapshot
Smooth Column Convex Polyominoes
inferred← citeshttps://doi.org/10.1007/s00454-022-00426-4openalex-snapshot
Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile
inferred← citeshttps://doi.org/10.1007/s00454-024-00706-1openalex-snapshot
Translational Tiling with 8 Polyominoes is Undecidable
inferred← citeshttps://doi.org/10.1007/s11425-024-2365-2openalex-snapshot
Undecidability of translational tiling of the 4-dimensional space with a set of 4 polyhypercubes
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00040-2openalex-snapshot
Applications quasi affines: pavages par images réciproques
inferred← citeshttps://doi.org/10.1016/j.aam.2026.103080openalex-snapshot
Christoffel and Fibonacci tiles are prime double squares
inferred← citeshttps://doi.org/10.1016/j.aim.2023.109400openalex-snapshot
Integer superharmonic matrices on the F-lattice
inferred← citeshttps://doi.org/10.1016/j.cviu.2012.09.009openalex-snapshot
A decomposition theorem for homogeneous sets with respect to diamond probes
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.026openalex-snapshot
On the tiling by translation problem
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.023openalex-snapshot
A parallelogram tile fills the plane by translation in at most two distinct ways
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.034openalex-snapshot
On the shape of permutomino tiles
inferred← citeshttps://doi.org/10.1016/j.dam.2024.02.022openalex-snapshot
Proving a conjecture on prime double square tiles
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.023openalex-snapshot
Self-avoiding closed curves in the regular and semiregular grids
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.05.009openalex-snapshot
Complexity of cutting words on regular tilings
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.03.008openalex-snapshot
Rectangular tileability and complementary tileability are undecidable
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105455openalex-snapshot
On the generation and enumeration of prime double square polyominoes
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.05.001openalex-snapshot
Coverability and multi-scale coverability on infinite pictures
inferred← citeshttps://doi.org/10.1016/j.jfa.2004.04.007openalex-snapshot
On characterizations of spectra and tilings
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.031openalex-snapshot
Enumeration of L-convex polyominoes
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.016openalex-snapshot
Scanning integer matrices by means of two rectangular windows
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.07.005openalex-snapshot
Equations on palindromes and circular words
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.034openalex-snapshot
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.014openalex-snapshot
About thin arithmetic discrete planes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.012openalex-snapshot
Polyominoes simulating arbitrary-neighborhood zippers and tilings
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.014openalex-snapshot
Non-lattice-periodic tilings of R3 by single polycubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.032openalex-snapshot
Exhaustive generation of gominoes
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.040openalex-snapshot
Combinatorial properties of double square tiles
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.003openalex-snapshot
A generalization of the Fibonacci word fractal and the Fibonacci snowflake
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.021openalex-snapshot
Leader election on two-dimensional periodic cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.012openalex-snapshot
Balancedness and coboundaries in symbolic systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.015openalex-snapshot
On generalized Lyndon words
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.001openalex-snapshot
Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00006-2openalex-snapshot
Applications quasi-affines et pavages du plan discret
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00018-xopenalex-snapshot
De la logique aux pavages
inferred← citeshttps://doi.org/10.1051/ita:2007012openalex-snapshot
An algorithm for deciding if a polyomino tiles the plane
inferred← citeshttps://doi.org/10.1080/00150517.2022.12427440openalex-snapshot
Polyominoes and Graphs Built From Fibonacci Words
inferred← citeshttps://doi.org/10.1090/proc/17186openalex-snapshot
Undecidability of translational tiling of the 3-dimensional space with a set of 6 polycubes
inferred← citeshttps://doi.org/10.1137/25m1801694openalex-snapshot
Translational Tilings: Structured or Wild?
inferred← citeshttps://doi.org/10.1142/s0129626410000028openalex-snapshot
SCHEDULING SENSORS BY TILING LATTICES
inferred← citeshttps://doi.org/10.1142/s0218195909002927openalex-snapshot
COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
inferred← citeshttps://doi.org/10.1142/s0218195919400016openalex-snapshot
On the Number of p4-Tilings by an n-Omino
inferred← citeshttps://doi.org/10.1142/s0218348x99000037openalex-snapshot
DISCLIKE LATTICE REPTILES INDUCED BY EXACT POLYOMINOES
inferred← citeshttps://doi.org/10.1145/3597932openalex-snapshot
Tiling with Squares and Packing Dominos in Polynomial Time
inferred← citeshttps://doi.org/10.1353/ajm.2020.0006openalex-snapshot
Periodicity and decidability of tilings of ℤ2
inferred← citeshttps://doi.org/10.22405/2226-8383-2024-25-1-138-154openalex-snapshot
On the number of isohedral polyominoes
inferred← citeshttps://doi.org/10.3233/fi-2014-1112openalex-snapshot
Reconstructing Words from a σ-palindromic Language
inferred← citeshttps://doi.org/10.3233/fi-2016-1381openalex-snapshot
Tiling the Space by Polycube Analogues of Fedorov’s Polyhedra
inferred← citeshttps://doi.org/10.37236/1041openalex-snapshot
Tilings by Translation: Enumeration by a Rational Language Approach
inferred← citeshttps://doi.org/10.37236/1813openalex-snapshot
On the Generation and Enumeration of some Classes of Convex Polyominoes
inferred← citeshttps://doi.org/10.37236/686openalex-snapshot
How many Faces can the Polycubes of Lattice Tilings by Translation of ${\mathbb R}^3$ have?
inferred← citeshttps://doi.org/10.4007/annals.2024.200.1.5openalex-snapshot
A counterexample to the periodic tiling conjecture
inferred← citeshttps://doi.org/10.4204/eptcs.63.1openalex-snapshot
Interactions between Digital Geometry and Combinatorics on Words
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.50openalex-snapshot
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
inferred← citeshttps://doi.org/10.4310/maa.2006.v13.n4.a3openalex-snapshot
On Disk-like Self-affine Tiles Arising from Polyominoes
inferred← citeshttps://doi.org/10.46298/dmtcs.2307openalex-snapshot
Enumeration of convex polyominoes using the ECO method
inferred← citeshttps://doi.org/10.46298/dmtcs.2868openalex-snapshot
Combinatorial aspects of Escher tilings
inferred← citeshttps://doi.org/10.46298/dmtcs.366openalex-snapshot
Tiling Z² with translations of one set
inferred← citeshttps://doi.org/10.48550/arxiv.0806.1271openalex-snapshot
Scheduling Sensors by Tiling Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1002.3769openalex-snapshot
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
inferred← citeshttps://doi.org/10.48550/arxiv.1504.07883openalex-snapshot
An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
inferred← citeshttps://doi.org/10.48550/arxiv.1909.03880openalex-snapshot
Connected Assembly and Reconfiguration by Finite Automata
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11615openalex-snapshot
Intensive use of computing resources for dominations in grids and other combinatorial problems
inferred← citeshttps://doi.org/10.48550/arxiv.2109.14179openalex-snapshot
A Periodicity Result for Tilings of $\mathbb Z^3$ by Clusters of Prime-Squared Cardinality
inferred← citeshttps://doi.org/10.48550/arxiv.math/0003039openalex-snapshot
Hard Tiling Problems with Simple Tiles
inferred← citeshttps://doi.org/10.5772/58577openalex-snapshot
From Tilings to Fibers – Bio-mathematical Aspects of Fold Plasticity
inferred← citeshttps://doi.org/10.5772/58631openalex-snapshot
Characterization of Some Periodic Tiles by Contour Words
inferred← citeshttps://doi.org/10.70675/c11727e1zb28az437bzac5fz93a61a8b621aopenalex-snapshot
Intensive use of computing resources for dominations in grids and other combinatorial problems
inferred← citeshttps://doi.org/10.70675/d1ed6f08z1af9z410bzb56bz9edd52f845dfopenalex-snapshot
Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.