On the public citation graph
Force-directed drawing method for intersecting clustered graphs
0 signed · 23 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.1007/0-387-28981-xopenalex-snapshot
Modern multidimensional scaling : theory and applications
inferredcites →https://doi.org/10.1007/3-540-44969-8_8openalex-snapshot
Drawing Clusters and Hierarchies
inferredcites →https://doi.org/10.1007/3-540-62495-3_42openalex-snapshot
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
inferredcites →https://doi.org/10.1109/21.108304openalex-snapshot
Visualization of structural information: automatic drawing of compound digraphs
inferredcites →https://doi.org/10.1109/infovis.2004.18openalex-snapshot
Dynamic Drawing of Clustered Graphs
inferredcites →https://doi.org/10.1109/infvis.2004.18openalex-snapshot
Dynamic Drawing of Clustered Graphs
inferredcites →https://doi.org/10.1109/proc.1967.6027openalex-snapshot
ACCEL: Automated circuit card etching layout
inferredcites →https://doi.org/10.1142/4902openalex-snapshot
Graph Drawing and Applications for Software and Knowledge Engineers
inferredcites →https://doi.org/10.2307/2669710openalex-snapshot
Modern Multidimensional Scaling: Theory and Applications
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-01766-2_157openalex-snapshot
Visualization of Clustered Network Graphs Based on Constrained Optimization Partition Layout
inferred← citeshttps://doi.org/10.1093/ietisy/e90-d.10.1649openalex-snapshot
Method for Visualizing Complicated Structures Based on Unified Simplification Strategy
inferred← citeshttps://doi.org/10.1109/apvis.2007.329278openalex-snapshot
Overlapping cluster planarity
inferred← citeshttps://doi.org/10.1109/cgiv.2013.23openalex-snapshot
Improving the Quality of Clustered Graph Drawing through a Dummy Element Approach
inferred← citeshttps://doi.org/10.1109/icmla.2008.46openalex-snapshot
Force Feature Spaces for Visualization and Classification
inferred← citeshttps://doi.org/10.1109/iv.2014.24openalex-snapshot
Drawing Large Weighted Graphs Using Clustered Force-Directed Algorithm
inferred← citeshttps://doi.org/10.1109/tvcg.2022.3233389openalex-snapshot
Comparative Study and Evaluation of Hybrid Visualizations of Graphs
inferred← citeshttps://doi.org/10.1145/2505515.2508200openalex-snapshot
Detecting and exploring clusters in attributed graphs
inferred← citeshttps://doi.org/10.14201/gredos.76569openalex-snapshot
Visual analysis of gene expression data by means of biclustering
inferred← citeshttps://doi.org/10.3390/sym11010030openalex-snapshot
Applying Graph Centrality Metrics in Visual Analytics of Scientific Standard Datasets
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.