On the public citation graph
Drawing high degree graphs with low bend numbers
0 signed · 140 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/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferredcites →https://doi.org/10.1007/978-3-322-92106-2openalex-snapshot
Combinatorial Algorithms for Integrated Circuit Layout
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1007/bfb0021809openalex-snapshot
Drawing high degree graphs with low bend numbers
inferredcites →https://doi.org/10.1016/0164-1212(84)90006-2openalex-snapshot
Computer aided layout of entity relationship diagrams
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/32.67575openalex-snapshot
Towards the automatic generation of software diagrams
inferredcites →https://doi.org/10.1109/tse.1986.6312901openalex-snapshot
A layout algorithm for data flow diagrams
inferredcites →https://doi.org/10.1109/wvl.1989.77060openalex-snapshot
Automatic layout of PERT diagrams with X-PERT
inferredcites →https://doi.org/10.1137/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1145/167088.167207openalex-snapshot
Angles of planar triangular graphs
inferredcites →https://doi.org/10.1145/800141.804667openalex-snapshot
The node cost measure for embedding graphs on the planar grid (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2001.1161openalex-snapshot
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/11618058_36openalex-snapshot
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_1openalex-snapshot
Sketch-Driven Orthogonal Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_31openalex-snapshot
Some Applications of Orderly Spanning Trees in Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_33openalex-snapshot
Semi-dynamic Orthogonal Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_6openalex-snapshot
Drawing Outer-Planar Graphs in O(n log n )Area
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_4openalex-snapshot
Optimal Area Algorithm for Planar Polyline Drawings
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_10openalex-snapshot
On Improving Orthogonal Drawings: The 4M-Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_28openalex-snapshot
Improved Force-Directed Layouts
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_3openalex-snapshot
Three Approaches to 3D-Orthogonal Box-Drawings
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_14openalex-snapshot
Visualization of the Autonomous Systems Interconnections with Hermes
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_5openalex-snapshot
An Experimental Comparison of Orthogonal Compaction Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_22openalex-snapshot
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_33openalex-snapshot
Minimum Depth Graph Embedding
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_52openalex-snapshot
Bend Minimization in Orthogonal Drawings Using Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_11openalex-snapshot
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_12openalex-snapshot
Labeling Heuristics for Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_42openalex-snapshot
yFiles: Visualization and Automatic Layout of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_5openalex-snapshot
Planarization of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_52openalex-snapshot
AGD: A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-45875-1_22openalex-snapshot
Chapter 4 Graphs in Software Visualization
inferred← citeshttps://doi.org/10.1007/3-540-45875-1_24openalex-snapshot
Graph Drawing Algorithm Engineering with AGD
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_2openalex-snapshot
Turn-Regularity and Planar Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_3openalex-snapshot
Combining Graph Labeling and Compaction
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_31openalex-snapshot
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_32openalex-snapshot
Multi-dimensional Orthogonal Graph Drawing with Small Boxes
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_7openalex-snapshot
On the Complexity of Orthogonal Compaction
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_23openalex-snapshot
Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_11openalex-snapshot
Dynamic Grid Embedding with Few Bends and Changes
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_45openalex-snapshot
2-Visibility drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_72openalex-snapshot
Computing orthogonal drawings with the minimum number of bends
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_74openalex-snapshot
Orthogonal drawing of high degree graphs with small area and few bends
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_4openalex-snapshot
Area-efficient static and incremental graph drawings
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_52openalex-snapshot
Orthogonal 3-D graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_57openalex-snapshot
Algorithms and area bounds for nonplanar orthogonal drawings
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_58openalex-snapshot
Drawing clustered graphs on an orthogonal grid
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_79openalex-snapshot
GraVis — System demonstration
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_84openalex-snapshot
The three-phase method: A unified approach to orthogonal graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_88openalex-snapshot
Graph-drawing contest report
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_651openalex-snapshot
Bend Minimization for Orthogonal Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_17openalex-snapshot
Planar L-Drawings of Bimodal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_21openalex-snapshot
Extending Partial Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_9openalex-snapshot
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_37openalex-snapshot
Slanted Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_22openalex-snapshot
Graph Compact Orthogonal Layout Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_27openalex-snapshot
The Effect of Almost-Empty Faces on Planar Kandinsky Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_15openalex-snapshot
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_36openalex-snapshot
Planar L-Drawings of Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_33openalex-snapshot
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_13openalex-snapshot
Non-planar Orthogonal Drawings with Fixed Topology
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_24openalex-snapshot
Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_39openalex-snapshot
A Note on the Self-similarity of Some Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_33openalex-snapshot
A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_1openalex-snapshot
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_48openalex-snapshot
Graph Drawing Contest Report
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_15openalex-snapshot
Topology-Driven Force-Directed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_31openalex-snapshot
Confluent Drawing Algorithms Using Rectangular Dualization
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_7openalex-snapshot
AGD — A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_12openalex-snapshot
Accelerated Bend Minimization
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_651-1openalex-snapshot
Bend Minimization for Orthogonal Drawings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_14openalex-snapshot
Smooth Orthogonal Layouts
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_33openalex-snapshot
Square-Orthogonal Drawing with Few Bends per Edge
inferred← citeshttps://doi.org/10.1007/978-3-642-55537-4_4openalex-snapshot
A Combinatorial Approach to Orthogonal Placement Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-55753-8_46openalex-snapshot
Automatic Layout and Labelling of State Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_14openalex-snapshot
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_10openalex-snapshot
Orthogonal Layout with Optimal Face Complexity
inferred← citeshttps://doi.org/10.1007/978-3-7091-6783-0_6openalex-snapshot
Drawing Relational Schemas
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_11openalex-snapshot
Crossing Layout in Non-planar Graph Drawings
inferred← citeshttps://doi.org/10.1007/s00224-008-9115-0openalex-snapshot
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
inferred← citeshttps://doi.org/10.1007/s00453-018-0523-5openalex-snapshot
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
inferred← citeshttps://doi.org/10.1007/s004539910006openalex-snapshot
Efficient Orthogonal Drawings of High Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00454-023-00593-yopenalex-snapshot
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing
inferred← citeshttps://doi.org/10.1007/s12650-019-00582-5openalex-snapshot
A novel centrality-based method for visual analytics of small-world networks
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.008openalex-snapshot
How to draw the minimum cuts of a planar graph
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.001openalex-snapshot
Orthogonal drawings of graphs with vertex and edge labels
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.04.003openalex-snapshot
Orthogeodesic point-set embedding of trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.02.005openalex-snapshot
Orthogonal layout with optimal face complexity
inferred← citeshttps://doi.org/10.1016/j.ipm.2025.104343openalex-snapshot
Towards structure-aware data augmentation for high-degree graph neural networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.012openalex-snapshot
Non-planar square-orthogonal drawing with few-bend edges
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.004openalex-snapshot
Good spanning trees in graph drawing
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00207-xopenalex-snapshot
Relating bends and size in orthogonal graph drawings
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00270-9openalex-snapshot
Graph layout for applications in compiler construction
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00006-2openalex-snapshot
The DFS-heuristic for orthogonal graph drawing☆☆Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference…
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00010-4openalex-snapshot
On the complexity of orthogonal compaction☆☆Research supported in part by the CNR Project “Geometria Computazionale Robusta con Applicazioni alla Grafica ed al CAD”, by the ESPRIT LTR Project 20244 (ALCOM-IT), and by “Progetto Algoritmi per Grandi Insiemi di Dati: Scienza e Ingegneria”, MURST…
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00026-6openalex-snapshot
A better heuristic for orthogonal graph drawings
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00054-1openalex-snapshot
Turn-regularity and optimal area drawings of orthogonal representations
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80118-0openalex-snapshot
Orthogonal Drawings Based On The Stratification Of Planar Graphs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80534-1openalex-snapshot
A Software System for Computing Labeled Orthogonal Drawings of Graphs
inferred← citeshttps://doi.org/10.1057/palgrave.ivs.9500078openalex-snapshot
Automatic Layout of UML Class Diagrams in Orthogonal Style
inferred← citeshttps://doi.org/10.1080/00222933008673226openalex-snapshot
XXXVIII.—Cardiocondyla bicolor, sp. n. (Hymenoptera, Formicidæ), a species of Myrmecine ant new to science
inferred← citeshttps://doi.org/10.1093/bib/bby099openalex-snapshot
Human-like layout algorithms for signalling hypergraphs: outlining requirements
inferred← citeshttps://doi.org/10.1109/access.2020.3047616openalex-snapshot
The State of the Art in Empirical User Evaluation of Graph Visualizations
inferred← citeshttps://doi.org/10.1109/iisa.2014.6878731openalex-snapshot
Perfect smooth orthogonal drawings
inferred← citeshttps://doi.org/10.1109/iisa.2014.6878777openalex-snapshot
How to visualize directed graphs: A user study
inferred← citeshttps://doi.org/10.1109/iisa.2015.7388121openalex-snapshot
Sloginsky drawings of graphs
inferred← citeshttps://doi.org/10.1137/040614086openalex-snapshot
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming
inferred← citeshttps://doi.org/10.1142/s0218195901000687openalex-snapshot
TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING
inferred← citeshttps://doi.org/10.1145/2838736openalex-snapshot
Optimal Orthogonal Graph Drawing with Convex Bend Costs
inferred← citeshttps://doi.org/10.1145/345513.345357openalex-snapshot
Relevance of graph-drawing algorithms to graph-based interfaces
inferred← citeshttps://doi.org/10.1145/774833.774860openalex-snapshot
A topology-shape-metrics approach for the automatic layout of UML class diagrams
inferred← citeshttps://doi.org/10.1201/b15385-20openalex-snapshot
- The Open Graph Drawing Framework (OGDF)
inferred← citeshttps://doi.org/10.13130/lin-jianyi_phd2012-03-09openalex-snapshot
EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING
inferred← citeshttps://doi.org/10.2312/compaesth/compaesth09/049-056openalex-snapshot
Comparing the Readability of Graph Layouts using Eyetracking and Task-oriented Analysis
inferred← citeshttps://doi.org/10.3390/info9070153openalex-snapshot
More Compact Orthogonal Drawings by Allowing Additional Bends †
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2073openalex-snapshot
MIMTool: A Tool for Drawing Molecular Interaction Maps
inferred← citeshttps://doi.org/10.48550/arxiv.1903.05048openalex-snapshot
Efficient Algorithms for Ortho-Radial Graph Drawing
inferred← citeshttps://doi.org/10.5555/338219.338225openalex-snapshot
Orthogonal graph drawing with constraints
inferred← citeshttps://doi.org/10.70675/9839b5d1z7786z4d9dza0a1zb1cc016d9abcopenalex-snapshot
Système de recommandation basé sur les réseaux pour l'interprétation de résultats de métabolomique
inferred← citeshttps://doi.org/10.7155/jgaa.00016openalex-snapshot
Drawing Clustered Graphs on an Orthogonal Grid
inferred← citeshttps://doi.org/10.7155/jgaa.00018openalex-snapshot
Bounds For Orthogonal 3-D Graph Drawing
inferred← citeshttps://doi.org/10.7155/jgaa.00055openalex-snapshot
Visualization of the High Level Structure of the Internet with Hermes
inferred← citeshttps://doi.org/10.7155/jgaa.00316openalex-snapshot
1-Bend Orthogonal Partial Edge Drawing
inferred← citeshttps://doi.org/10.7155/jgaa.00332openalex-snapshot
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations
inferred← citeshttps://doi.org/10.7155/jgaa.00391openalex-snapshot
Algorithms and Bounds for Overloaded Orthogonal Drawings
inferred← citeshttps://doi.org/10.7155/jgaa.00596openalex-snapshot
Planar L-Drawings of Bimodal Graphs
showing the first 126 of 127 · page through all 127
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.