On the public citation graph
Three-dimensional graph drawing
0 signed · 92 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.4380200705openalex-snapshot
A node‐positioning algorithm for general trees
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferredcites →https://doi.org/10.1016/0146-664x(82)90117-4openalex-snapshot
Fundamentals of interactive computer graphics
inferredcites →https://doi.org/10.1016/0925-7721(92)90021-jopenalex-snapshot
A note on optimal area algorithms for upward drawings of binary trees
inferredcites →https://doi.org/10.1109/iscas.1990.112025openalex-snapshot
Planar orthogonal drawings of graphs
inferredcites →https://doi.org/10.1112/plms/s3-10.1.304openalex-snapshot
Convex Representations of Graphs
inferredcites →https://doi.org/10.1142/s0218195993000099openalex-snapshot
TWO TREE DRAWING CONVENTIONS
inferredcites →https://doi.org/10.1145/160985.161165openalex-snapshot
Area-efficient upward tree drawings
inferredcites →https://doi.org/10.1145/73833.73839openalex-snapshot
Area requirement and symmetry display in drawing graphs
inferredcites →https://doi.org/10.2307/2005728openalex-snapshot
Systematic Programming: An Introduction
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11618058_10openalex-snapshot
Volume Requirements of 3D Upward Drawings
inferred← citeshttps://doi.org/10.1007/11618058_49openalex-snapshot
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
inferred← citeshttps://doi.org/10.1007/11618058_8openalex-snapshot
Drawing K n in Three Dimensions with One Bend Per Edge
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-36206-1_31openalex-snapshot
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_16openalex-snapshot
Approximation Algorithms for Finding Best Viewpoints
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_25openalex-snapshot
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
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-44541-2_26openalex-snapshot
Orthogonal Drawings of Cycles in 3D Space
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_7openalex-snapshot
Embedding Problems for Paths with Direction Constrained Edges
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_26openalex-snapshot
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_53openalex-snapshot
Finding the best viewpoints for three-dimensional graph drawings
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_656openalex-snapshot
Three-Dimensional Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_1openalex-snapshot
Graph Product Structure Theory with Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_15openalex-snapshot
Achieving Good Angular Resolution in 3D Arc Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_31openalex-snapshot
Vertical Visibility Among Parallel Polygons in Three Dimensions
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-24595-7_20openalex-snapshot
Track Drawings of Graphs with Constant Queue Number
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
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-540-39890-5_18openalex-snapshot
Tree-Partitions of k-Trees with Applications in Graph Layout
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_25openalex-snapshot
No l Grid-Points in Spaces of Small Dimension
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_10openalex-snapshot
Three-Dimensional Drawings of Bounded Degree Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_19openalex-snapshot
Optimal 3D Angular Resolution for Low-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_656-1openalex-snapshot
Three-Dimensional Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_57openalex-snapshot
Theory and Practice of Graph Drawing
inferred← citeshttps://doi.org/10.1007/s11083-006-9028-yopenalex-snapshot
Upward Three-Dimensional Grid Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/s11432-011-4208-9openalex-snapshot
A fast successive over-relaxation algorithm for force-directed network graph drawing
inferred← citeshttps://doi.org/10.1007/s42354-019-0241-4openalex-snapshot
Nash embedding: a road map to realizing quantum hardware
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.1016/j.comgeo.2004.04.004openalex-snapshot
Linkless symmetric drawings of series parallel digraphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.11.003openalex-snapshot
Computing straight-line 3D grid drawings of graphs in linear volume
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.061openalex-snapshot
Volume requirements of 3D upward drawings
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00408-xopenalex-snapshot
Embedding problems for paths with direction constrained edges
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00044-0openalex-snapshot
Optimal three-dimensional orthogonal graph drawing in the general position model
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00287-xopenalex-snapshot
Optimal three-dimensional layout of interconnection networks
inferred← citeshttps://doi.org/10.1080/09296174.2025.2583941openalex-snapshot
Topology-Preserving Topographic Representation for Implementation of Linguistic Intentionality
inferred← citeshttps://doi.org/10.1103/physrevx.8.041043openalex-snapshot
Functional Control of Network Dynamics Using Designed Laplacian Spectra
inferred← citeshttps://doi.org/10.1109/focs.2010.42openalex-snapshot
On the Queue Number of Planar Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.38openalex-snapshot
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring
inferred← citeshttps://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs have Bounded Queue-Number
inferred← citeshttps://doi.org/10.1117/12.404814openalex-snapshot
Complexity of computing nice viewpoints of objects in space
inferred← citeshttps://doi.org/10.1137/130908051openalex-snapshot
On the Queue Number of Planar Graphs
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.1140/epjst/e2016-60266-2openalex-snapshot
Learning network representations
inferred← citeshttps://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferred← citeshttps://doi.org/10.11606/d.55.2007.tde-08052007-100008openalex-snapshot
Uma ferramenta para a visualização de ESTs
inferred← citeshttps://doi.org/10.1186/s12859-018-2393-xopenalex-snapshot
3D Network exploration and visualisation for lifespan data
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8613openalex-snapshot
Bounding the Cost of Stability in Games over Interaction Networks
inferred← citeshttps://doi.org/10.3390/computers13080189openalex-snapshot
Force-Directed Immersive 3D Network Visualization
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.37236/6429openalex-snapshot
On the Queue-Number of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.46298/dmtcs.346openalex-snapshot
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6730openalex-snapshot
Achieving Good Angular Resolution in 3D Arc Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.1902.01108openalex-snapshot
2-D Embedding of Large and High-dimensional Data with Minimal Memory and Computational Time Requirements
inferred← citeshttps://doi.org/10.5281/zenodo.179044openalex-snapshot
FIGURE 1 in Six new species of Te t r a Keifer (Acari: Eriophyidae: Phyllocoptinae) from China
inferred← citeshttps://doi.org/10.7148/2008-0227openalex-snapshot
3D Visualization Of Simulation Data In A Network Context: A Case Study From Systems Biology
inferred← citeshttps://doi.org/10.7155/jgaa.00019openalex-snapshot
Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
inferred← citeshttps://doi.org/10.7155/jgaa.00027openalex-snapshot
A Split&Push Approach to 3D Orthogonal Drawing
inferred← citeshttps://doi.org/10.7155/jgaa.00075openalex-snapshot
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
inferred← citeshttps://doi.org/10.7155/jgaa.00079openalex-snapshot
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
inferred← citeshttps://doi.org/10.7155/jgaa.00095openalex-snapshot
Three-Dimensional 1-Bend Graph Drawings
inferred← citeshttps://doi.org/10.7155/jgaa.00151openalex-snapshot
A 2.5D Hierarchical Drawing of Directed Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00355openalex-snapshot
Point-Set Embedding in Three Dimensions
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.