On the public citation graph

A new necessary condition for the vertex visibility graphs of simple polygons

https://doi.org/10.1007/bf02574366
0 signed · 13 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/3-540-19487-8_10openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferredcites →https://doi.org/10.1007/978-1-4612-3894-2openalex-snapshot
Statistical Information and Likelihood
inferredcites →https://doi.org/10.1145/109648.109681openalex-snapshot
Distance visibility graphs

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-662-48350-3_51openalex-snapshot
A Characterization of Visibility Graphs for Pseudo-polygons
inferred← citeshttps://doi.org/10.1007/bf02770871openalex-snapshot
On recognizing and characterizing visibility graphs of simple polygons
inferred← citeshttps://doi.org/10.1007/s00454-003-2773-4openalex-snapshot
A General Notion of Visibility Graphs
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00391-1openalex-snapshot
Disproving a conjecture on planar visibility graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00208-0openalex-snapshot
A necessary condition for a graph to be the visibility graph of a simple polygon
inferred← citeshttps://doi.org/10.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a5openalex-snapshot
On characterizing terrain visibility graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.911592openalex-snapshot
Sobre a caracterização de grafos de visibilidade de leques convexos
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5187openalex-snapshot
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
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.