On the public citation graph

Generating customized layouts

https://doi.org/10.1007/bfb0021835
0 signed · 52 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.1010openalex-snapshot
Layout Adjustment and the Mental Map
inferredcites →https://doi.org/10.1007/3-540-58950-3_391openalex-snapshot
A simple and unified method for drawing graphs: Magnetic-spring algorithm
inferredcites →https://doi.org/10.1007/3-540-58950-3_392openalex-snapshot
Integration of declarative and algorithmic approaches for layout creation
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.1109/vl.1993.269619openalex-snapshot
Constraint-driven diagram layout
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.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/scj.1078openalex-snapshot
Introducing the fisheye view into graph drawing algorithm
inferred← citeshttps://doi.org/10.1007/11555261_67openalex-snapshot
Multilevel Compound Tree – Construction Visualization and Interaction
inferred← citeshttps://doi.org/10.1007/11618058_31openalex-snapshot
Drawing Graphs Using Modular Decomposition
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_28openalex-snapshot
Improved Force-Directed Layouts
inferred← citeshttps://doi.org/10.1007/3-540-44969-8_11openalex-snapshot
Software Packages
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_3openalex-snapshot
Node Overlap Removal by Growing a Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_40openalex-snapshot
An Energy Model for Visual Graph Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_15openalex-snapshot
Completely Connected Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_26openalex-snapshot
Multi-circular Layout of Micro/Macro Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_20openalex-snapshot
Efficient Node Overlap Removal Using a Proximity Stress Model
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_16openalex-snapshot
Group-Level Analysis and Visualization of Social Networks
inferred← citeshttps://doi.org/10.1007/978-90-481-8776-8_10openalex-snapshot
Macro Cell Placement: Based on a Force Directed Flow
inferred← citeshttps://doi.org/10.1007/s10618-012-0286-6openalex-snapshot
A regularized graph layout framework for dynamic network visualization
inferred← citeshttps://doi.org/10.1016/j.ins.2004.11.006openalex-snapshot
A layout algorithm for signaling pathways
inferred← citeshttps://doi.org/10.1016/j.ins.2008.11.017openalex-snapshot
A layout algorithm for undirected compound graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.002openalex-snapshot
Completely connected clustered graphs
inferred← citeshttps://doi.org/10.1016/j.jvlc.2007.07.006openalex-snapshot
MOVIS: A system for visualizing distributed mobile object environments
inferred← citeshttps://doi.org/10.1109/infovis.2004.18openalex-snapshot
Dynamic Drawing of Clustered Graphs
inferred← citeshttps://doi.org/10.1109/infvis.2004.18openalex-snapshot
Dynamic Drawing of Clustered Graphs
inferred← citeshttps://doi.org/10.1109/isscs.2009.5206087openalex-snapshot
Graph drawing alogorithms based module placement
inferred← citeshttps://doi.org/10.1109/iv.2005.65openalex-snapshot
Interactive Refinement of Multi-scale Network Clusterings
inferred← citeshttps://doi.org/10.1109/iv.2007.65openalex-snapshot
How to Draw ClusteredWeighted Graphs using a Multilevel Force-Directed Graph Drawing Algorithm
inferred← citeshttps://doi.org/10.1109/iv.2019.00065openalex-snapshot
The Compound Graph: A Case Study for Community Visualisation in Social Networks
inferred← citeshttps://doi.org/10.1109/pacificvis.2008.4475481openalex-snapshot
A Treemap Based Method for Rapid Layout of Large Graphs
inferred← citeshttps://doi.org/10.1109/pacificvis53943.2022.00015openalex-snapshot
UNICON: A UNIform CONstraint Based Graph Layout Framework
inferred← citeshttps://doi.org/10.1109/rcis.2014.6861028openalex-snapshot
An energy-based model to optimize cluster visualization
inferred← citeshttps://doi.org/10.1109/rme.2009.5201342openalex-snapshot
Development of a force directed module placement tool
inferred← citeshttps://doi.org/10.1109/tvcg.2006.156openalex-snapshot
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs
inferred← citeshttps://doi.org/10.1109/tvcg.2012.178openalex-snapshot
CiSE: A Circular Spring Embedder Layout Algorithm
inferred← citeshttps://doi.org/10.1109/tvcg.2013.232openalex-snapshot
Visualizing Fuzzy Overlapping Communities in Networks
inferred← citeshttps://doi.org/10.1109/tvcg.2017.2745919openalex-snapshot
Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3095303openalex-snapshot
fCoSE: A Fast Compound Graph Layout Algorithm with Constraint Support
inferred← citeshttps://doi.org/10.1145/1056018.1056040openalex-snapshot
A space of layout styles for hierarchical graph models of software systems
inferred← citeshttps://doi.org/10.1145/1556262.1556288openalex-snapshot
Drawing graphs with non-uniform vertices
inferred← citeshttps://doi.org/10.1515/jib-2019-0026openalex-snapshot
Mental-Map Preserving Visualisation of Partitioned Networks in Vanted
inferred← citeshttps://doi.org/10.21941/kcss/2018/1openalex-snapshot
Sugiyama Layouts for Prescribed Drawing Areas
inferred← citeshttps://doi.org/10.26686/wgtn.17008228openalex-snapshot
An Empirical Evaluation of Force-Directed Graph Layout
inferred← citeshttps://doi.org/10.26686/wgtn.17008228.v1openalex-snapshot
An Empirical Evaluation of Force-Directed Graph Layout
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0626openalex-snapshot
Visualizing Graphs with Node and Edge Labels
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02653openalex-snapshot
Node Overlap Removal by Growing a Tree
inferred← citeshttps://doi.org/10.7155/jgaa.00198openalex-snapshot
Efficient, Proximity-Preserving Node Overlap Removal
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.