On the public citation graph

Vertex splitting and tension-free layout

https://doi.org/10.1007/bfb0021804
0 signed · 25 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.1016/0020-0190(89)90102-6openalex-snapshot
An algorithm for drawing general undirected graphs
inferredcites →https://doi.org/10.1142/0922openalex-snapshot
Visualizing Abstract Objects and Relations
inferredcites →https://doi.org/10.14264/66a9237openalex-snapshot
Analysis of algorithms for drawing 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/10692760_23openalex-snapshot
Splitting Number is NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_12openalex-snapshot
(k, p)-Planarity: A Relaxation of Hybrid Planarity
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_17openalex-snapshot
Planarizing Graphs and Their Drawings by Vertex Splitting
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_19openalex-snapshot
An FPT Algorithm for Bipartite Vertex Splitting
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_14openalex-snapshot
Visualization of Bipartite Graphs in Limited Window Size
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_22openalex-snapshot
Overlapping Biclustering
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_41openalex-snapshot
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
inferred← citeshttps://doi.org/10.1007/bfb0054317openalex-snapshot
The splitting number of the 4-cube
inferred← citeshttps://doi.org/10.1007/s00236-025-00483-1openalex-snapshot
Visualization of bipartite graphs in limited window size
inferred← citeshttps://doi.org/10.1016/j.cag.2023.09.010openalex-snapshot
Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.044openalex-snapshot
(k,p)-planarity: A relaxation of hybrid planarity
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00220-1openalex-snapshot
splitting number is NP-complete
inferred← citeshttps://doi.org/10.1109/aiccsa.2005.1387012openalex-snapshot
Consistent graph layout for weighted graphs
inferred← citeshttps://doi.org/10.1109/mcg.2023.3264244openalex-snapshot
Splitting Vertices in 2-Layer Graph Drawings
inferred← citeshttps://doi.org/10.1109/tvcg.2008.141openalex-snapshot
Improving the Readability of Clustered Social Networks using Node Duplication
inferred← citeshttps://doi.org/10.1109/tvcg.2020.3016055openalex-snapshot
Hybrid Graph Visualizations With ChordLink: Algorithms, Experiments, and Applications
inferred← citeshttps://doi.org/10.1142/s0218194003001196openalex-snapshot
ON-LINE VISUALIZATION AND NAVIGATION OF THE GLOBAL WEB STRUCTURE
inferred← citeshttps://doi.org/10.1145/2492517.2492636openalex-snapshot
An interactive visualization interface for studying egocentric, categorical, contact diary datasets
inferred← citeshttps://doi.org/10.1186/1756-0500-6-179openalex-snapshot
What google maps can do for biomedical data dissemination: examples and a design study
inferred← citeshttps://doi.org/10.47749/t/unicamp.1999.182802openalex-snapshot
Invariantes de planaridade
inferred← citeshttps://doi.org/10.5964/bioling.9793openalex-snapshot
The search for Minimal Search: A graph-theoretic approach
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
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.