On the public citation graph
Circles through two points that always enclose many points
0 signed · 39 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/bf02187726openalex-snapshot
Some extremal results on circles containing points
inferredcites →https://doi.org/10.1007/bf02187727openalex-snapshot
A combinatorial result about points and balls in euclidean space
inferredcites →https://doi.org/10.1007/bf02187728openalex-snapshot
A note on the circle containment problem
inferredcites →https://doi.org/10.1016/0012-365x(88)90015-5openalex-snapshot
A combinatorial result on points and circles on the plane
inferredcites →https://doi.org/10.1016/0097-3165(80)90011-4openalex-snapshot
On the combinatorial classification of nondegenerate configurations in the plane
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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/3-540-55488-2_30openalex-snapshot
On spanning trees with low crossing numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_37openalex-snapshot
New Algorithms and Bounds for Halving Pseudolines
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_4openalex-snapshot
Improved Bounds for the Number of (≤ k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n
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/bf01758770openalex-snapshot
Randomized incremental construction of Delaunay and Voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf01759056openalex-snapshot
Order-k voronoi diagrams of sites with additive weights in the plane
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-005-1227-6openalex-snapshot
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
inferred← citeshttps://doi.org/10.1007/s00454-007-1325-8openalex-snapshot
New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn
inferred← citeshttps://doi.org/10.1007/s00454-023-00612-yopenalex-snapshot
Deep Cliques in Point Sets
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.dam.2021.05.029openalex-snapshot
New algorithms and bounds for halving pseudolines
inferred← citeshttps://doi.org/10.1016/j.disc.2015.11.019openalex-snapshot
An optimal generalization of the Colorful Carathéodory theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112541openalex-snapshot
On circles enclosing many points
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.010openalex-snapshot
New results on lower bounds for the number of (≤k) -facets
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.033openalex-snapshot
New results on lower bounds for the number of (⩽ k)-facets
inferred← citeshttps://doi.org/10.1016/j.procs.2025.10.318openalex-snapshot
Computational aspects of disks enclosing many points
inferred← citeshttps://doi.org/10.1142/s0218195909003143openalex-snapshot
ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218195912500112openalex-snapshot
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
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.1145/2261250.2261300openalex-snapshot
A theorem of bárány revisited and extended
inferred← citeshttps://doi.org/10.1145/3448016.3457315openalex-snapshot
Identifying Insufficient Data Coverage for Ordinal Continuous-Valued Attributes
inferred← citeshttps://doi.org/10.1145/3531054openalex-snapshot
On Finding Rank Regret Representatives
inferred← citeshttps://doi.org/10.3929/ethz-a-007143531openalex-snapshot
Depth, crossings and conflicts in discrete geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1912.05102openalex-snapshot
Dimension and structure of higher-order Voronoi cells on discrete sites
inferred← citeshttps://doi.org/10.70675/75f898dfzfaacz4592za6e3z8ee996f080b5openalex-snapshot
K-set Polygons and Centroid Triangulations
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.