On the public citation graph

Repeated distances in space

https://doi.org/10.1007/bf01864161
0 signed · 21 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.1007/bf02020540openalex-snapshot
Beweis einer Vermutung von A. Vázsonyi
inferredcites →https://doi.org/10.1007/bf02579184openalex-snapshot
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
inferredcites →https://doi.org/10.1080/00029890.1984.11971450openalex-snapshot
The Number of Furthest Neighbour Pairs of a Finite Planar Set
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.4064/cm-3-1-50-57openalex-snapshot
On a problem of K. Zarankiewicz

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_6openalex-snapshot
Distance Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_27openalex-snapshot
Favorite Distances in High Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/bf02122780openalex-snapshot
Variations on the theme of repeated distances
inferred← citeshttps://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferred← citeshttps://doi.org/10.1007/s13366-012-0126-2openalex-snapshot
Large simplices determined by finite point sets
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00177-xopenalex-snapshot
Furthest neighbours in space
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90069-9openalex-snapshot
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50019-1openalex-snapshot
10.1016/b978-044488002-4/50019-1
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00328-8openalex-snapshot
Popular distances in 3-space
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1137/100784424openalex-snapshot
Deriving Finite Sphere Packings
inferred← citeshttps://doi.org/10.37236/8887openalex-snapshot
Favourite Distances in $3$-Space
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.