On the public citation graph
A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs
0 signed · 39 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.1002/spe.4380211102openalex-snapshot
Graph drawing by force‐directed placement
inferredcites →https://doi.org/10.1006/jvlc.1995.1014openalex-snapshot
Randomized Graph Drawing with Heavy-Duty Preprocessing
inferredcites →https://doi.org/10.1007/3-540-58950-3_351openalex-snapshot
Three-dimensional graph drawing
inferredcites →https://doi.org/10.1007/3-540-58950-3_383openalex-snapshot
Molecular graph eigenvectors for molecular coordinates
inferredcites →https://doi.org/10.1007/978-3-642-46787-5_2openalex-snapshot
Problem Independent Distributed Simulated Annealing and its Applications
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.1109/21.278993openalex-snapshot
Automating the layout of network diagrams with specified visual organization
inferredcites →https://doi.org/10.1142/9789814434478_0005openalex-snapshot
AN ALGORITHM FOR DRAWING GENERAL UNDIRECTED GRAPHS
inferredcites →https://doi.org/10.1145/234535.234538openalex-snapshot
Drawing graphs nicely using simulated annealing
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
inferredcites →https://doi.org/10.1287/opre.39.3.378openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
inferredcites →https://doi.org/10.5445/ir/268794openalex-snapshot
A fast adaptive layout algorithm for undirected graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.1149openalex-snapshot
Parallel global optimization with the particle swarm algorithm
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_5openalex-snapshot
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_7openalex-snapshot
A Split&Push Approach to 3D Orthogonal Drawing
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_20openalex-snapshot
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_48openalex-snapshot
GIOTTO3D: A system for visualizing hierarchical structures in 3D
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_70openalex-snapshot
3DCube: A tool for three dimensional graph drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_18openalex-snapshot
Three-Dimensional Grid Drawings with Sub-quadratic Volume
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_15openalex-snapshot
Layouts of Graph Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-642-14619-0_15openalex-snapshot
Simulated Annealing in Finding Optimum Groups of Learners of UML
inferred← citeshttps://doi.org/10.1007/bfb0021794openalex-snapshot
Fast interactive 3-D graph visualization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.03.014openalex-snapshot
A multi-dimensional approach to force-directed layouts of large graphs
inferred← citeshttps://doi.org/10.1109/hcw.1997.581407openalex-snapshot
The MOL project: an open, extensible metacomputer
inferred← citeshttps://doi.org/10.1109/iicpe.2018.8709469openalex-snapshot
A Simulation Study of Parallel Particle Swarm Optimization Algorithm for Proportional Integral Derivative Controller Tuning
inferred← citeshttps://doi.org/10.1111/cgf.15077openalex-snapshot
An Experimental Evaluation of Viewpoint‐Based 3D Graph Drawing
inferred← citeshttps://doi.org/10.1111/cgf.70127openalex-snapshot
Viewpoint Optimization for 3D Graph Drawings
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.3233/idt-2012-0125openalex-snapshot
An intelligent recommender system for trainers and trainees in a collaborative learning environment for UML
inferred← citeshttps://doi.org/10.46298/dmtcs.346openalex-snapshot
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
inferred← citeshttps://doi.org/10.7155/jgaa.00027openalex-snapshot
A Split&Push Approach to 3D Orthogonal Drawing
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.