On the public citation graph

A combinatorial result about points and balls in euclidean space

https://doi.org/10.1007/bf02187727
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.1112/s0025579300005751openalex-snapshot
Primitive Radon partitions
inferredcites →https://doi.org/10.1112/s0025579300008238openalex-snapshot
Neighbourliness and Radon's theorem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45995-2_4openalex-snapshot
Open Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_36openalex-snapshot
On Center Regions and Balls Containing Many Points
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_11openalex-snapshot
Partial Orders and Euclidean Geometry
inferred← citeshttps://doi.org/10.1007/bf00181432openalex-snapshot
Circles through two points that always enclose many points
inferred← citeshttps://doi.org/10.1007/bf01758770openalex-snapshot
Randomized incremental construction of Delaunay and Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf01787813openalex-snapshot
Containment problems in high-dimensional spaces
inferred← citeshttps://doi.org/10.1007/bf02187726openalex-snapshot
Some extremal results on circles containing points
inferred← citeshttps://doi.org/10.1007/bf02187728openalex-snapshot
A note on the circle containment problem
inferred← citeshttps://doi.org/10.1007/bf02187798openalex-snapshot
A combinatorial property of points and ellipsoids
inferred← citeshttps://doi.org/10.1007/bfb0032048openalex-snapshot
Randomized incremental construction of delaunay and Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/pl00009296openalex-snapshot
A combinatorial property of convex sets
inferred← citeshttps://doi.org/10.1007/s00454-007-9003-4openalex-snapshot
A Combinatorial Property of Points and Balls, a Colored Version
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.07.001openalex-snapshot
Depth of segments and circles through points enclosing many points: a note
inferred← citeshttps://doi.org/10.1016/j.disc.2019.03.003openalex-snapshot
Matching points with disks with a common intersection
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112541openalex-snapshot
On circles enclosing many points
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.318openalex-snapshot
Computational aspects of disks enclosing many points
inferred← citeshttps://doi.org/10.1145/220279.220287openalex-snapshot
Voronoi diagrams and containment of families of convex sets on the plane
inferred← citeshttps://doi.org/10.3929/ethz-a-007143531openalex-snapshot
Depth, crossings and conflicts in discrete geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1902.08427openalex-snapshot
Matching points with disks with a common intersection
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.