On the public citation graph

An Optimal Algorithm for Detecting Pseudo-squares

0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/gmip.1999.0488openalex-snapshot
Euclidean Paths: A New Representation of Boundary of Discrete Regions
inferredcites →https://doi.org/10.1007/11505877_17openalex-snapshot
A Note on a Result of Daurat and Nivat
inferredcites →https://doi.org/10.1007/3-540-46011-xopenalex-snapshot
Developments in Language Theory
inferredcites →https://doi.org/10.1007/bf02574705openalex-snapshot
On translating one polyomino to tile the plane
inferredcites →https://doi.org/10.1016/0019-1035(71)90136-9openalex-snapshot
Picture processing and psychopictorics
inferredcites →https://doi.org/10.1016/j.jcss.2004.03.004openalex-snapshot
Linear time algorithms for finding and representing all the tandem repeats in a string
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/s1571-0653(04)00487-1openalex-snapshot
Salient and Reentrant Points of Discrete Sets
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1017/cbo9781107341005openalex-snapshot
Applied Combinatorics on Words
inferredcites →https://doi.org/10.1051/ita:2007012openalex-snapshot
An algorithm for deciding if a polyomino tiles the plane
inferredcites →https://doi.org/10.1109/tec.1961.5219197openalex-snapshot
On the Encoding of Arbitrary Geometric Configurations
inferredcites →https://doi.org/10.2307/3225418openalex-snapshot
Picture Processing and Psychopictorics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-79126-3_7openalex-snapshot
Combinatorial View of Digital Convexity
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-21073-0_25openalex-snapshot
Planar Configurations Induced by Exact Polyominoes
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.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.patcog.2008.11.010openalex-snapshot
Lyndon Christoffel digitally convex
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.1142/s0218195919400016openalex-snapshot
On the Number of p4-Tilings by an n-Omino
inferred← citeshttps://doi.org/10.3233/fi-2014-1112openalex-snapshot
Reconstructing Words from a σ-palindromic Language
inferred← citeshttps://doi.org/10.4204/eptcs.63.1openalex-snapshot
Interactions between Digital Geometry and Combinatorics on Words
inferred← citeshttps://doi.org/10.46298/dmtcs.2868openalex-snapshot
Combinatorial aspects of Escher tilings
inferred← citeshttps://doi.org/10.48550/arxiv.1504.07883openalex-snapshot
An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
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.