On the public citation graph

Drawing plane graphs nicely

https://doi.org/10.1007/bf00264230
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.
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/spe.4380100706openalex-snapshot
Pretty‐printing of trees
inferredcites →https://doi.org/10.1007/bf00289576openalex-snapshot
The complexity of drawing trees nicely
inferredcites →https://doi.org/10.1016/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
inferredcites →https://doi.org/10.1016/0095-8956(80)90083-0openalex-snapshot
Planarity and duality of finite and infinite graphs
inferredcites →https://doi.org/10.1109/tse.1979.234212openalex-snapshot
Tidy Drawings of Trees
inferredcites →https://doi.org/10.1109/tse.1981.234519openalex-snapshot
Tidier Drawings of Trees
inferredcites →https://doi.org/10.1112/plms/s3-10.1.304openalex-snapshot
Convex Representations of Graphs
inferredcites →https://doi.org/10.1112/plms/s3-13.1.743openalex-snapshot
How to Draw a Graph
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0716027openalex-snapshot
Generalized Nested Dissection
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/ecjc.4430750501openalex-snapshot
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex‐ and edge‐weights on the exterior window
inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1007/11940128_15openalex-snapshot
Convex Grid Drawings of Plane Graphs with Rectangular Contours
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_10openalex-snapshot
Upward drawings of acyclic digraphs
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_8openalex-snapshot
Problems of posting sentries: Variations on the art gallery theorem
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_22openalex-snapshot
Convex Grid Drawings of Four-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_15openalex-snapshot
Grid Drawings of Four-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/3-540-52698-6_1openalex-snapshot
Nice drawings of graphs are computationally hard
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_52openalex-snapshot
On-line convex planarity testing
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_142openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_42openalex-snapshot
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-4121-9_13openalex-snapshot
Networks and Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_652openalex-snapshot
Convex Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_26openalex-snapshot
Convexity-Increasing Morphs of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_12openalex-snapshot
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_2openalex-snapshot
Drawing Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_1openalex-snapshot
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_34openalex-snapshot
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_11openalex-snapshot
On Open Rectangle-of-Influence Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_77openalex-snapshot
Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_21openalex-snapshot
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_2openalex-snapshot
Monotone Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_652-1openalex-snapshot
Convex Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_3openalex-snapshot
Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/bf00930616openalex-snapshot
Calculus of space-optimal mappings of systolic algorithms on processor arrays
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferred← citeshttps://doi.org/10.1007/bfb0032956openalex-snapshot
Mapping systolic algorithms on distributed memory computers
inferred← citeshttps://doi.org/10.1007/s00453-013-9790-3openalex-snapshot
Monotone Drawings of Graphs with Fixed Embedding
inferred← citeshttps://doi.org/10.1007/s00454-001-0004-4openalex-snapshot
Grid Drawings of 4-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s10878-011-9390-6openalex-snapshot
Minimum-segment convex drawings of 3-connected cubic plane graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90142-kopenalex-snapshot
Connectivity of plane triangulations
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00020-dopenalex-snapshot
A linear-time algorithm for drawing a planar graph on a grid
inferred← citeshttps://doi.org/10.1016/0094-114x(94)90029-9openalex-snapshot
Automatic sketching of planar kinematic chains
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot
Algorithms for plane representations of acyclic digraphs
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
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.2023.102036openalex-snapshot
Straight-line drawings of 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102242openalex-snapshot
Rectangular drawing of cubic graphs on an annulus and a Möbius band
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.06.009openalex-snapshot
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.016openalex-snapshot
Polyline drawings with topological constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114290openalex-snapshot
Convex grid drawings of planar graphs with constant edge-vertex resolution
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70553-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-8396(96)00031-3openalex-snapshot
Parametrization and smooth approximation of surface triangulations
inferred← citeshttps://doi.org/10.1016/s0734-189x(86)80059-7openalex-snapshot
Picture processing: 1985
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00005-3openalex-snapshot
An experimental comparison of four graph drawing algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00003-0openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00016-9openalex-snapshot
Minimum-width grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1016/s1045-926x(05)80049-7openalex-snapshot
Visual logic programming
inferred← citeshttps://doi.org/10.1051/ita/1991250302191openalex-snapshot
Solides non organisés : définition, implantation et plongement
inferred← citeshttps://doi.org/10.1080/00207169008803875openalex-snapshot
How to draw a hypergraph
inferred← citeshttps://doi.org/10.1080/07408179308964333openalex-snapshot
A HEURISTIC METHOD FOR THE AUTOMATIC DRAWING OF SYSTEM MODELING GRAPHS
inferred← citeshttps://doi.org/10.1080/09728600.2023.2218459openalex-snapshot
An annotated review on graph drawing and its applications
inferred← citeshttps://doi.org/10.1109/21.87055openalex-snapshot
Automatic graph drawing and readability of diagrams
inferred← citeshttps://doi.org/10.1109/32.403790openalex-snapshot
Parametric graph drawing
inferred← citeshttps://doi.org/10.1109/32.67575openalex-snapshot
Towards the automatic generation of software diagrams
inferred← citeshttps://doi.org/10.1109/asap.1990.145438openalex-snapshot
Calculus of space-optimal mappings of systolic algorithms on processor arrays
inferred← citeshttps://doi.org/10.1109/icis.2010.124openalex-snapshot
An Attribute Graph Grammar Enabling Narrower Drawings of Trees
inferred← citeshttps://doi.org/10.1109/lfa.1988.24961openalex-snapshot
Akrti: a system for drawing data structure
inferred← citeshttps://doi.org/10.1109/snpd.2012.109openalex-snapshot
O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams
inferred← citeshttps://doi.org/10.1109/snpd.2013.76openalex-snapshot
Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams
inferred← citeshttps://doi.org/10.1109/wvl.1991.238848openalex-snapshot
A tailorable and extensible automatic layout facility
inferred← citeshttps://doi.org/10.1137/s0895480192242006openalex-snapshot
Drawing Graphs on Surfaces
inferred← citeshttps://doi.org/10.1142/s0129054105002905openalex-snapshot
CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s012905410600425xopenalex-snapshot
CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s1793830909000257openalex-snapshot
ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS
inferred← citeshttps://doi.org/10.1142/s179383091000070xopenalex-snapshot
CONVEX DRAWINGS OF INTERNALLY TRICONNECTED PLANE GRAPHS ON O(n2) GRIDS
inferred← citeshttps://doi.org/10.1145/129712.129764openalex-snapshot
On the angular resolution of planar graphs
inferred← citeshttps://doi.org/10.1145/220279.220312openalex-snapshot
An experimental comparison of three graph drawing algorithms (extended abstract)
inferred← citeshttps://doi.org/10.1145/237218.237401openalex-snapshot
Convex drawings of graphs in two and three dimensions (preliminary version)
inferred← citeshttps://doi.org/10.1145/51909.51960openalex-snapshot
Annotator: an AI approach to engineering drawing annotation
inferred← citeshttps://doi.org/10.1145/73833.73839openalex-snapshot
Area requirement and symmetry display in drawing graphs
inferred← citeshttps://doi.org/10.1201/b15385-9openalex-snapshot
- Planar Straight-Line Drawing Algorithms
inferred← citeshttps://doi.org/10.14288/1.0051670openalex-snapshot
Interactive topological drawing
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0011openalex-snapshot
Convex Grid Drawings of Plane Graphs with Pentagonal Contours on O(n2) Grids
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.413openalex-snapshot
Convex Grid Drawings of Plane Graphs with Pentagonal Contours
inferred← citeshttps://doi.org/10.26493/1855-3974.1109.6feopenalex-snapshot
Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces
inferred← citeshttps://doi.org/10.37394/23209.2020.17.13openalex-snapshot
Graph Drawing Approaches for Petri Net Models
inferred← citeshttps://doi.org/10.37394/23209.2021.18.10openalex-snapshot
Graph Drawing Approaches for Petri Net Visualisation and Representation
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.