On the public citation graph

Lower Bounds on the Obstacle Number of Graphs

https://doi.org/10.37236/2380
0 signed · 27 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-642-16926-7_27openalex-snapshot
Graphs with Large Obstacle Numbers
inferredcites →https://doi.org/10.1007/bf02187696openalex-snapshot
Upper bounds for configurations and polytopes inR d
inferredcites →https://doi.org/10.1007/bf02574043openalex-snapshot
Arrangements of segments that share endpoints: Single face results
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1007/s00373-011-1027-0openalex-snapshot
On the Structure of Graphs with Low Obstacle Number
inferredcites →https://doi.org/10.1007/s00454-009-9185-zopenalex-snapshot
Blocking Visibility for Points in General Position
inferredcites →https://doi.org/10.1007/s00454-009-9233-8openalex-snapshot
Obstacle Numbers of Graphs
inferredcites →https://doi.org/10.1016/b978-044482537-7/50023-1openalex-snapshot
Art Gallery and Illumination Problems
inferredcites →https://doi.org/10.1016/s0012-365x(01)00441-1openalex-snapshot
Planar sets containing no three collinear points and non-averaging sets of integers
inferredcites →https://doi.org/10.1016/s0195-6698(83)80036-5openalex-snapshot
A Combinatorial Distinction Between the Euclidean and Projective Planes
inferredcites →https://doi.org/10.1016/s0898-1221(98)90095-5openalex-snapshot
Computational geometry: Algorithms and applications
inferredcites →https://doi.org/10.1017/cbo9780511543340openalex-snapshot
Visibility Algorithms in the Plane
inferredcites →https://doi.org/10.1090/conm/223/03140openalex-snapshot
Open problems in the combinatorics of visibility and illumination
inferredcites →https://doi.org/10.1201/9781420035315openalex-snapshot
Handbook of Discrete and Computational Geometry, Second Edition
inferredcites →https://doi.org/10.20382/jocg.v1i1a3openalex-snapshot
On Visibility and Blockers
inferredcites →https://doi.org/10.48550/arxiv.1002.0190openalex-snapshot
Blocking Coloured Point Sets
inferredcites →https://doi.org/10.5860/choice.33-5161openalex-snapshot
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/978-3-031-22203-0_3openalex-snapshot
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_26openalex-snapshot
Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_30openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_23openalex-snapshot
Obstructing Visibilities with One Obstacle
inferred← citeshttps://doi.org/10.1007/s00454-017-9919-2openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101946openalex-snapshot
Geodesic obstacle representation of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.09.027openalex-snapshot
Grid obstacle representation of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114115openalex-snapshot
Mutual witness Gabriel drawings of complete bipartite graphs
inferred← citeshttps://doi.org/10.1137/23m1585088openalex-snapshot
Bounding and Computing Obstacle Numbers of Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00452openalex-snapshot
Graphs with Obstacle Number Greater than One
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.