On the public citation graph

Dig-CoLa: directed graph layout through constrained energy minimization

https://doi.org/10.1109/infvis.2005.1532130

0 signed · 40 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/1097-024x(200009)30:11<1203::aid-spe338>3.0.co;2-nopenalex-snapshot

An open graph visualization system and its applications to software engineering

inferredcites →https://doi.org/10.1002/9781118723203openalex-snapshot

Practical Methods of Optimization

inferredcites →https://doi.org/10.1007/11618058_14openalex-snapshot

Stress Majorization with Orthogonal Ordering Constraints

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/978-1-4757-2711-1openalex-snapshot

Modern Multidimensional Scaling

inferredcites →https://doi.org/10.1007/978-1-5041-2940-4_9openalex-snapshot

Matrix Market: a web resource for test matrix collections

inferredcites →https://doi.org/10.1007/978-3-540-31843-9_25openalex-snapshot

Graph Drawing by Stress Majorization

inferredcites →https://doi.org/10.1007/bfb0021817openalex-snapshot

Exact and heuristic algorithms for 2-layer straightline crossing minimization

inferredcites →https://doi.org/10.1007/bfb0021818openalex-snapshot

Constraint-based spring-model algorithm for graph layout

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/0377-2217(82)90093-5openalex-snapshot

Practical optimization

inferredcites →https://doi.org/10.1016/s0304-3975(99)00239-xopenalex-snapshot

Spring algorithms and symmetry

inferredcites →https://doi.org/10.1023/a:1009771921595openalex-snapshot

Constrained Graph Layout

inferredcites →https://doi.org/10.1109/32.221135openalex-snapshot

A technique for drawing directed graphs

inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot

Methods for Visual Understanding of Hierarchical System Structures

inferredcites →https://doi.org/10.1109/tvcg.2004.1260757openalex-snapshot

Combining hierarchy and energy for drawing directed graphs

inferredcites →https://doi.org/10.1145/264645.264657openalex-snapshot

Drawing graphs to convey proximity

inferredcites →https://doi.org/10.1145/641876.641880openalex-snapshot

Object-oriented software for quadratic programming

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-319-06793-3_3openalex-snapshot

Multivariate Social Network Visual Analytics

inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_16openalex-snapshot

A Generalization of the Directed Graph Layering Problem

inferred← citeshttps://doi.org/10.1007/s11390-021-9910-5openalex-snapshot

Inverse Markov Process Based Constrained Dynamic Graph Layout

inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.103openalex-snapshot

Constrained graph layout by stress majorization and gradient projection

inferred← citeshttps://doi.org/10.1057/palgrave.ivs.9500162openalex-snapshot

Designing Semantic Substrates for Visual Network Exploration

inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00156openalex-snapshot

Research on Dynamic Graph Layout by Parallel Computing and Markov Process

inferred← citeshttps://doi.org/10.1109/iv68685.2025.00031openalex-snapshot

Visualization of Node-Centric Hierarchical Structures in Directed Graphs

inferred← citeshttps://doi.org/10.1109/pacificvis68791.2026.00006openalex-snapshot

Constrained Graph Drawing by Stochastic Gradient Descent

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.2006.67openalex-snapshot

Drawing directed graphs using quadratic programming

inferred← citeshttps://doi.org/10.1109/tvcg.2012.236openalex-snapshot

Intelligent Graph Layout Using Many Users' Input

inferred← citeshttps://doi.org/10.1109/tvcg.2017.2744878openalex-snapshot

Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow

inferred← citeshttps://doi.org/10.1109/tvcg.2022.3187425openalex-snapshot

Target Netgrams: An Annulus-Constrained Stress Model for Radial Graph Visualization

inferred← citeshttps://doi.org/10.1109/tvcg.2024.3456167openalex-snapshot

Improved Visual Saliency of Graph Clusters with Orderable Node-Link Layouts

inferred← citeshttps://doi.org/10.1109/tvcg.2026.3694437openalex-snapshot

Graph Drawing Stress Model with Resistance Distances

inferred← citeshttps://doi.org/10.1109/vissoft.2014.23openalex-snapshot

Polyptychon: A Hierarchically-Constrained Classified Dependencies Visualization

inferred← citeshttps://doi.org/10.1111/cgf.13440openalex-snapshot

SetCoLa: High‐Level Constraints for Graph Layout

inferred← citeshttps://doi.org/10.1111/j.1467-8659.2011.01956.xopenalex-snapshot

ImPrEd: An Improved Force‐Directed Algorithm that Prevents Nodes from Crossing Edges

inferred← citeshttps://doi.org/10.21941/kcss/2018/1openalex-snapshot

Sugiyama Layouts for Prescribed Drawing Areas

inferred← citeshttps://doi.org/10.22456/2175-2745.6015openalex-snapshot

Navigation and Interaction in Graph Visualizations

inferred← citeshttps://doi.org/10.70675/09171394z95c9z4dd4zb395zc09a48b8678eopenalex-snapshot

Dessin de graphe distribué par modèle de force : application au Big Data

inferred← citeshttps://doi.org/10.7155/jgaa.00152openalex-snapshot

Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization

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.