On the public citation graph

Spring algorithms and symmetry

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.1002/spe.4380211102openalex-snapshot
Graph drawing by force‐directed placement
inferredcites →https://doi.org/10.1006/jvlc.1995.1013openalex-snapshot
Graph Drawing by the Magnetic Spring Model
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-1-4612-5680-9openalex-snapshot
Transformation Geometry: An Introduction to Symmetry
inferredcites →https://doi.org/10.1007/978-1-4612-5680-9_1openalex-snapshot
Introduction
inferredcites →https://doi.org/10.1016/0020-0190(89)90102-6openalex-snapshot
An algorithm for drawing general undirected graphs
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1112/plms/s3-13.1.743openalex-snapshot
How to Draw a Graph
inferredcites →https://doi.org/10.1137/0216061openalex-snapshot
On the Optimal Layout of Planar Graphs with Fixed Boundary
inferredcites →https://doi.org/10.1145/323233.323254openalex-snapshot
A method for drawing graphs
inferredcites →https://doi.org/10.2307/2314023openalex-snapshot
Finite Permutation Groups.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-37623-2_15openalex-snapshot
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_28openalex-snapshot
Improved Force-Directed Layouts
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_23openalex-snapshot
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_34openalex-snapshot
An Algorithm for Finding Three Dimensional Symmetry in Trees
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_35openalex-snapshot
On Maximum Symmetric Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-48086-2_4openalex-snapshot
Visualization of Automorphisms and Vertex-Symmetry
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_30openalex-snapshot
Finding Planar Geometric Automorphisms in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_38openalex-snapshot
3D Visualization of Semantic Metadata Models and Ontologies
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.01.005openalex-snapshot
Improved algorithm for the symmetry number problem on trees
inferred← citeshttps://doi.org/10.1016/j.jvlc.2009.04.007openalex-snapshot
Node overlap removal in clustered directed acyclic graphs
inferred← citeshttps://doi.org/10.1109/pacificvis.2012.6183576openalex-snapshot
A maxent-stress model for graph layout
inferred← citeshttps://doi.org/10.1109/tvcg.2012.299openalex-snapshot
A Maxent-Stress Model for Graph Layout
inferred← citeshttps://doi.org/10.1145/1529282.1529685openalex-snapshot
Visualization of clustered directed acyclic graphs with node interleaving
inferred← citeshttps://doi.org/10.12785/amis/080145openalex-snapshot
Scalable Visualization of Semantic Nets using Power-Law Graphs
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.