On the public citation graph

Stress Majorization with Orthogonal Ordering Constraints

https://doi.org/10.1007/11618058_14
0 signed · 30 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.1006/jvlc.1995.1010openalex-snapshot
Layout Adjustment and the Mental Map
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/978-3-540-31843-9_50openalex-snapshot
The Metro Map Layout Problem
inferredcites →https://doi.org/10.1007/b98874openalex-snapshot
Numerical Optimization
inferredcites →https://doi.org/10.1016/0020-0190(89)90102-6openalex-snapshot
An algorithm for drawing general undirected graphs
inferredcites →https://doi.org/10.1017/9781108993456.011openalex-snapshot
Numerical optimization
inferredcites →https://doi.org/10.1023/a:1009771921595openalex-snapshot
Constrained Graph Layout
inferredcites →https://doi.org/10.1109/infovis.2005.10openalex-snapshot
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization
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/263407.263521openalex-snapshot
An interactive constraint-based system for drawing graphs

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-031-51765-5_3openalex-snapshot
Network Analysis: A Mathematical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-89646-3_3openalex-snapshot
A Fast and Simple Heuristic for Metro Map Path Simplification
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_25openalex-snapshot
On the Hardness of Orthogonal-Order Preserving Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_27openalex-snapshot
Path Schematization for Route Sketches
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_22openalex-snapshot
On d-Regular Schematization of Embedded Paths
inferred← citeshttps://doi.org/10.1016/j.neucom.2010.11.015openalex-snapshot
Visualization of Riemannian-manifold-valued elements by multidimensional scaling
inferred← citeshttps://doi.org/10.1109/access.2019.2932412openalex-snapshot
Visualization of the Image Geometric Transformation Group Based on Riemannian Manifold
inferred← citeshttps://doi.org/10.1109/icsai.2016.7811084openalex-snapshot
Visualization of the geometric transformation group based on the Riemannian metric
inferred← citeshttps://doi.org/10.1109/infovis.2005.10openalex-snapshot
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization
inferred← citeshttps://doi.org/10.1109/infvis.2005.1532130openalex-snapshot
Dig-CoLa: directed graph layout through constrained energy minimization
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.2020.3030447openalex-snapshot
DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction
inferred← citeshttps://doi.org/10.1111/cgf.13199openalex-snapshot
Minimum‐Displacement Overlap Removal for Geo‐referenced Data Visualization
inferred← citeshttps://doi.org/10.1177/1473871612455749openalex-snapshot
A survey of two-dimensional graph layout techniques for information visualisation
inferred← citeshttps://doi.org/10.1186/s13362-020-00092-2openalex-snapshot
Data-driven graph drawing techniques with applications for conveyor systems
inferred← citeshttps://doi.org/10.7155/jgaa.00281openalex-snapshot
Orthogonal-Ordering Constraints are Tough
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.