On the public citation graph
Isohedral Polyomino Tiling of the Plane
0 signed · 29 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.1006/jcta.1997.2730openalex-snapshot
Packing Rectangles with Congruent Polyominoes
inferredcites →https://doi.org/10.1007/978-94-009-2356-0_10openalex-snapshot
Games, Logic and Computers
inferredcites →https://doi.org/10.1007/bf02574705openalex-snapshot
On translating one polyomino to tile the plane
inferredcites →https://doi.org/10.1016/0097-3165(89)90082-4openalex-snapshot
Polyominoes which tile rectangles
inferredcites →https://doi.org/10.1016/0097-3165(92)90058-3openalex-snapshot
Polyominoes of order 3 do not exist
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.1016/s0021-9800(69)80044-xopenalex-snapshot
Packing a rectangle with congruent N-ominoes
inferredcites →https://doi.org/10.1016/s0021-9800(70)80055-2openalex-snapshot
Tiling with sets of polyominoes
inferredcites →https://doi.org/10.1038/scientificamerican1165-98openalex-snapshot
Games, Logic and Computers
inferredcites →https://doi.org/10.2307/j.ctv10vm1sc.12openalex-snapshot
Tiling Rectangles with Polyominoes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.2000.3171openalex-snapshot
Polyomino Convolutions and Tiling Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-33394-2_18openalex-snapshot
An Integer Programming Approach to the Irregular Polyomino Tiling Problem
inferred← citeshttps://doi.org/10.1007/s00454-001-0047-6openalex-snapshot
Hard Tiling Problems with Simple Tiles
inferred← citeshttps://doi.org/10.1007/s10851-007-0013-xopenalex-snapshot
Computing the Discrete Fourier Transform on a Hexagonal Lattice
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.10.010openalex-snapshot
A new approach towards the Golomb–Welch conjecture
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.jfa.2004.04.007openalex-snapshot
On characterizations of spectra 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.1080/00029890.1998.12004895openalex-snapshot
Which Coronas Are Simple?
inferred← citeshttps://doi.org/10.1103/physreve.82.016108openalex-snapshot
Geographical networks stochastically constructed by a self-similar tiling according to population
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.3390/sym3040828openalex-snapshot
Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings with Rotational Symmetry
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.48550/arxiv.math/0003039openalex-snapshot
Hard Tiling Problems with Simple Tiles
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.