On the public citation graph

Drawing database schemas

https://doi.org/10.1002/spe.474
0 signed · 41 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-45875-1_24openalex-snapshot
Graph Drawing Algorithm Engineering with AGD
inferredcites →https://doi.org/10.1007/3-540-46648-7_31openalex-snapshot
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size
inferredcites →https://doi.org/10.1007/3-540-48777-8_23openalex-snapshot
Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)
inferredcites →https://doi.org/10.1007/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferredcites →https://doi.org/10.1007/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
inferredcites →https://doi.org/10.1007/3-540-63307-3_72openalex-snapshot
Computing orthogonal drawings with the minimum number of bends
inferredcites →https://doi.org/10.1007/3-540-63938-1_62openalex-snapshot
Pitfalls of using PQ-trees in automatic graph drawing
inferredcites →https://doi.org/10.1007/3-540-63938-1_67openalex-snapshot
Which aesthetic has the greatest effect on human understanding?
inferredcites →https://doi.org/10.1007/978-3-642-59412-0_16openalex-snapshot
A Relational Model of Data for Large Shared Data Banks
inferredcites →https://doi.org/10.1007/bf01188716openalex-snapshot
Upward drawings of triconnected digraphs
inferredcites →https://doi.org/10.1007/bf01940648openalex-snapshot
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
inferredcites →https://doi.org/10.1007/bf02430363openalex-snapshot
Designing and reporting on computational experiments with heuristic methods
inferredcites →https://doi.org/10.1007/bfb0021809openalex-snapshot
Drawing high degree graphs with low bend numbers
inferredcites →https://doi.org/10.1007/bfb0021827openalex-snapshot
Validating graph drawing aesthetics
inferredcites →https://doi.org/10.1007/bfb0054353openalex-snapshot
An approximation scheme for bin packing with conflicts
inferredcites →https://doi.org/10.1007/s00453-001-0083-xopenalex-snapshot
Quasi-Upward Planarity
inferredcites →https://doi.org/10.1016/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
inferredcites →https://doi.org/10.1016/0164-1212(84)90006-2openalex-snapshot
Computer aided layout of entity relationship diagrams
inferredcites →https://doi.org/10.1016/s0925-7721(01)00010-4openalex-snapshot
On the complexity of orthogonal compaction☆☆Research supported in part by the CNR Project “Geometria Computazionale Robusta con Applicazioni alla Grafica ed al CAD”, by the ESPRIT LTR Project 20244 (ALCOM-IT), and by “Progetto Algoritmi per Grandi Insiemi di Dati: Scienza e Ingegneria”, MURST…
inferredcites →https://doi.org/10.1016/s0925-7721(96)00005-3openalex-snapshot
An experimental comparison of four graph drawing algorithms
inferredcites →https://doi.org/10.1016/s0925-7721(99)00054-1openalex-snapshot
Turn-regularity and optimal area drawings of orthogonal representations
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/21.87055openalex-snapshot
Automatic graph drawing and readability of diagrams
inferredcites →https://doi.org/10.1109/tc.1983.1676307openalex-snapshot
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
inferredcites →https://doi.org/10.1109/tse.1986.6312901openalex-snapshot
A layout algorithm for data flow diagrams
inferredcites →https://doi.org/10.1137/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1137/0604033openalex-snapshot
Crossing Number is NP-Complete
inferredcites →https://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks

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-70904-6_14openalex-snapshot
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_16openalex-snapshot
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_11openalex-snapshot
DBdraw — Automatic Layout of Relational Database Schemas
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.001openalex-snapshot
Orthogonal drawings of graphs with vertex and edge labels
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.08.003openalex-snapshot
HV-planarity: Algorithms and complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.004openalex-snapshot
Orthogonal planarity testing of bounded treewidth graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.019openalex-snapshot
Greedy rectilinear drawings
inferred← citeshttps://doi.org/10.1109/tvcg.2026.3677884openalex-snapshot
GD4LLM: How Layout Quality and Prompting Influence LLM Understanding of Graph Drawings
inferred← citeshttps://doi.org/10.1177/14738716211028136openalex-snapshot
CoSEP: A compound spring embedder layout algorithm with support for ports
inferred← citeshttps://doi.org/10.7490/f1000research.1113218.1openalex-snapshot
SNP based literature and data retrieval
inferred← citeshttps://doi.org/10.7842/kigas.2013.17.4.58openalex-snapshot
Study on Production Performance of Shale Gas Reservoir using Production Data Analysis
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.