On the public citation graph

Graph sketches

0 signed · 28 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-44541-2_20openalex-snapshot
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
inferredcites →https://doi.org/10.1007/3-540-62495-3_42openalex-snapshot
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
inferredcites →https://doi.org/10.1007/3-540-68530-8_28openalex-snapshot
A Functional Approach to External Graph Algorithms
inferredcites →https://doi.org/10.1007/978-1-4757-3145-3_1openalex-snapshot
Navigating Graph Surfaces
inferredcites →https://doi.org/10.1016/j.comgeo.2004.03.014openalex-snapshot
A multi-dimensional approach to force-directed layouts of large graphs
inferredcites →https://doi.org/10.1016/s1389-1286(00)00083-9openalex-snapshot
Graph structure in the Web
inferredcites →https://doi.org/10.1090/dimacs/050openalex-snapshot
External Memory Algorithms
inferredcites →https://doi.org/10.1109/21.108304openalex-snapshot
Visualization of structural information: automatic drawing of compound digraphs
inferredcites →https://doi.org/10.1109/infvis.2000.885089openalex-snapshot
Visualizing massive multi-digraphs
inferredcites →https://doi.org/10.1109/spdp.1996.570330openalex-snapshot
Improved algorithms and data structures for solving graph problems in external memory
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/316194.316229openalex-snapshot
On power-law relationships of the Internet topology

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-540-31843-9_44openalex-snapshot
Visualizing Large Graphs with Compound-Fisheye Views and Treemaps
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_18openalex-snapshot
Generalizing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_36openalex-snapshot
StreamEB: Stream Edge Bundling.
inferred← citeshttps://doi.org/10.1016/j.cag.2004.03.012openalex-snapshot
Hierarchical graph maps
inferred← citeshttps://doi.org/10.1016/j.ijhcs.2011.02.007openalex-snapshot
The notion of overview in information visualization
inferred← citeshttps://doi.org/10.1109/2945.981849openalex-snapshot
MGV: a system for visualizing massive multidigraphs
inferred← citeshttps://doi.org/10.1109/apvis.2007.329289openalex-snapshot
A comparison of vertex ordering algorithms for large graph visualization
inferred← citeshttps://doi.org/10.1109/iv.2006.130openalex-snapshot
Visualizing Graphs - A Generalized View
inferred← citeshttps://doi.org/10.1109/nss.2009.37openalex-snapshot
Visualizing Global Patterns in Huge Digraphs
inferred← citeshttps://doi.org/10.1109/tvcg.2006.107openalex-snapshot
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction
inferred← citeshttps://doi.org/10.1109/vis.2005.25openalex-snapshot
Effectively Visualizing Large Networks Through Sampling
inferred← citeshttps://doi.org/10.1109/vis60296.2025.00027openalex-snapshot
Visual Fingerprints for Detecting Data Characteristics
inferred← citeshttps://doi.org/10.1109/visual.2005.1532819openalex-snapshot
Effectively Visualizing Large Networks Through Sampling
inferred← citeshttps://doi.org/10.1145/1556262.1556308openalex-snapshot
Navigating Giga-Graphs
inferred← citeshttps://doi.org/10.1145/2755573.2755586openalex-snapshot
Access to Data and Number of Iterations
inferred← citeshttps://doi.org/10.1145/956863.956948openalex-snapshot
Hierarchical graph indexing
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.