On the public citation graph

On sets having finitely many points of local nonconvexity and propertyP m

https://doi.org/10.1007/bf02771570
0 signed · 16 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/978-3-662-41914-4openalex-snapshot
Linear Topological Spaces
inferredcites →https://doi.org/10.1007/bf02771549openalex-snapshot
Convexity and a certain propertyP m
inferredcites →https://doi.org/10.1017/s0013091500025931openalex-snapshot
J. L. Kelley, I. Namioka and others, Linear Topological Spaces (University Series in Higher Mathematics, D. van Nostrand Co. Ltd., 1963)
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0185510-6openalex-snapshot
Local convexity and 𝐿_{𝑛} sets
inferredcites →https://doi.org/10.2140/pjm.1957.7.1227openalex-snapshot
A three point convexity property

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00147413openalex-snapshot
Covering and guarding polygons using L k -sets
inferred← citeshttps://doi.org/10.1007/bf00149286openalex-snapshot
�ber eine Verallgemeinerung der Valentineschen P 3-Eigenschaft
inferred← citeshttps://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferred← citeshttps://doi.org/10.1007/bf02239742openalex-snapshot
Hiding people in polygons
inferred← citeshttps://doi.org/10.1007/bf02764626openalex-snapshot
Essential and inessential points of local nonconvexity
inferred← citeshttps://doi.org/10.1007/bf02834753openalex-snapshot
General decomposition theorems form-convex sets in the plane
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00285-5openalex-snapshot
Hiding points in arrangements of segments
inferred← citeshttps://doi.org/10.1017/s0305004100050891openalex-snapshot
The graph-theoretic analogue of Tietze's characterization of a convex set and its generalization
inferred← citeshttps://doi.org/10.1090/s0002-9904-1973-13186-6openalex-snapshot
On the polygonal connectivity of polyhedra and the closure of open connected sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-1973-0341280-4openalex-snapshot
A generalization of Tietze’s theorem on convex sets in 𝑅³
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1985.tb14552.xopenalex-snapshot
GENERALIZATIONS OF TIETZE'S THEOREM ON LOCAL CONVEXITY FOR SETS IN Rd
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.