On the public citation graph
p-box: a new graph model
0 signed · 32 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/11561071_73openalex-snapshot
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
inferredcites →https://doi.org/10.1007/978-3-642-54423-1_4openalex-snapshot
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line
inferredcites →https://doi.org/10.1007/bf00390110openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1007/s11276-007-0045-6openalex-snapshot
Ad hoc networks beyond unit disk graphs
inferredcites →https://doi.org/10.1016/0020-0190(91)90245-dopenalex-snapshot
An optimal greedy heuristic to color interval graphs
inferredcites →https://doi.org/10.1016/0095-8956(72)90019-6openalex-snapshot
A structure theorem for the consecutive 1's property
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1016/0095-8956(84)90039-xopenalex-snapshot
A minimax theorem on intervals
inferredcites →https://doi.org/10.1016/0095-8956(91)90073-sopenalex-snapshot
A weighted min-max relation for intervals
inferredcites →https://doi.org/10.1016/s0012-365x(00)00204-1openalex-snapshot
Representing graphs by disks and balls (a survey of recognition-complexity results)
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1049/ip-e.1992.0021openalex-snapshot
Embedding graphs in books: a survey
inferredcites →https://doi.org/10.1137/1.9780898719802openalex-snapshot
Topics in Intersection Graph Theory
inferredcites →https://doi.org/10.1145/1597036.1597040openalex-snapshot
Bootstrapping a hop-optimal network in the weak sensor model
inferredcites →https://doi.org/10.4064/fm-33-1-303-307openalex-snapshot
Sur deux propriétés des classes d'ensembles
inferredcites →https://doi.org/10.4153/cjm-1966-014-3openalex-snapshot
The Representation of a Graph by Set Intersections
inferredcites →https://doi.org/10.5555/1109557.1109649openalex-snapshot
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition
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-030-04414-5_21openalex-snapshot
Recognition and Drawing of Stick Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39479-0_1openalex-snapshot
Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains
inferred← citeshttps://doi.org/10.1007/s11083-017-9437-0openalex-snapshot
Grid Intersection Graphs and Order Dimension
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.013openalex-snapshot
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.018openalex-snapshot
Recognition and drawing of stick graphs
inferred← citeshttps://doi.org/10.1080/09728600.2023.2245430openalex-snapshot
On characterizing proper max-point-tolerance graphs
inferred← citeshttps://doi.org/10.1137/19m1280399openalex-snapshot
Graph Classes and Forbidden Patterns on Three Vertices
inferred← citeshttps://doi.org/10.14279/depositonce-5580openalex-snapshot
Intersection graphs and geometric objects in the plane
inferred← citeshttps://doi.org/10.37236/8096openalex-snapshot
On Grounded L-Graphs and their Relatives
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00629openalex-snapshot
Classifying grounded intersection graphs via ordered forbidden patterns
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.