On the public citation graph

How to draw a planar clustered graph

https://doi.org/10.1007/bfb0030816
0 signed · 81 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.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
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/21.108304openalex-snapshot
Visualization of structural information: automatic drawing of compound digraphs
inferredcites →https://doi.org/10.1109/fscs.1990.89527openalex-snapshot
Drawing graphs in the plane with high resolution
inferredcites →https://doi.org/10.1109/sfcs.1992.267814openalex-snapshot
Drawing planar graphs using the lmc-ordering
inferredcites →https://doi.org/10.1112/plms/s3-13.1.743openalex-snapshot
How to Draw a Graph
inferredcites →https://doi.org/10.1137/0716027openalex-snapshot
Generalized Nested Dissection
inferredcites →https://doi.org/10.1137/s0895480193242931openalex-snapshot
On the Angular Resolution of Planar Graphs
inferredcites →https://doi.org/10.1142/0922openalex-snapshot
Visualizing Abstract Objects and Relations
inferredcites →https://doi.org/10.1145/129712.129764openalex-snapshot
On the angular resolution of planar graphs
inferredcites →https://doi.org/10.1145/42411.42414openalex-snapshot
On visual formalisms
inferredcites →https://doi.org/10.1145/62212.62254openalex-snapshot
Small sets supporting fary embeddings of planar 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/11618058_5openalex-snapshot
On Embedding a Cycle in a Plane Graph
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_22openalex-snapshot
NP-Completeness of Some Tree-Clustering Problems
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_9openalex-snapshot
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_19openalex-snapshot
FADE: Graph Drawing, Clustering, and Visual Abstraction
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-45848-4_5openalex-snapshot
Planarization of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_19openalex-snapshot
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_30openalex-snapshot
Isomorphic Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_8openalex-snapshot
Higres — Visualization System for Clustered Graphs and Graph Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-61534-2_3openalex-snapshot
Graph drawing methods
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_41openalex-snapshot
Multilevel visualization of clustered 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/3-540-63938-1_58openalex-snapshot
Drawing clustered graphs on an orthogonal grid
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_655openalex-snapshot
Clustered Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_16openalex-snapshot
Crossing Minimization in Perturbed Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_6openalex-snapshot
Fitting Planar Graphs on Planar Maps
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_15openalex-snapshot
Towards the Hanani-Tutte Theorem for Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_9openalex-snapshot
Hanani-Tutte for Radial Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_3openalex-snapshot
Bounded Embeddings of Graphs in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_36openalex-snapshot
Hanani-Tutte for Radial Planarity II
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_8openalex-snapshot
C-Planarity of Embedded Cyclic c-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_23openalex-snapshot
How to Draw a Planarization
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_68openalex-snapshot
Dynamic Tree Cross Products
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_14openalex-snapshot
A Topology-Driven Approach to the Design of Web Meta-search Clustering Engines
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_12openalex-snapshot
Clustering Cycles into Cycles of Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-39884-4_3openalex-snapshot
Communities in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_15openalex-snapshot
Completely Connected Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_9openalex-snapshot
How to Draw a Clustered Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_3openalex-snapshot
Straight-Line Rectangular Drawings of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_655-1openalex-snapshot
Clustered Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_27openalex-snapshot
Multilevel Drawings of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_15openalex-snapshot
Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_11openalex-snapshot
Non-crossing Connectors in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_36openalex-snapshot
Clustered Planarity Testing Revisited
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_12openalex-snapshot
Beyond Clustered Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-004-1144-8openalex-snapshot
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00725-3openalex-snapshot
Embedding Graphs into Embedded Graphs
inferred← citeshttps://doi.org/10.1007/s00454-010-9302-zopenalex-snapshot
Straight-Line Rectangular Drawings of Clustered Graphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00586-0openalex-snapshot
Crossing minimization in perturbed drawings
inferred← citeshttps://doi.org/10.1007/s11042-022-13017-5openalex-snapshot
Graph partitioning and visualization in graph mining: a survey
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.2004.03.014openalex-snapshot
A multi-dimensional approach to force-directed layouts of large graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.001openalex-snapshot
Relaxing the constraints of clustered planarity
inferred← citeshttps://doi.org/10.1016/j.jda.2005.06.002openalex-snapshot
Completely connected clustered graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.015openalex-snapshot
How to draw a clustered tree
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00094-9openalex-snapshot
Planarity-preserving clustering and embedding for large planar graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxw035openalex-snapshot
SEFE = C-Planarity?
inferred← citeshttps://doi.org/10.1109/2945.981849openalex-snapshot
MGV: a system for visualizing massive multidigraphs
inferred← citeshttps://doi.org/10.1109/mmse.1998.722958openalex-snapshot
Structured Graph Viewer: a scalable hypermedia browsing tool
inferred← citeshttps://doi.org/10.1109/tvcg.2006.185openalex-snapshot
Topographic Visualization of Prefix Propagation in the Internet
inferred← citeshttps://doi.org/10.1109/tvcg.2007.40openalex-snapshot
Graph Visualization Techniques for Web Clustering Engines
inferred← citeshttps://doi.org/10.1137/1.9781611975031.20openalex-snapshot
Recognizing Weak Embeddings of Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.175openalex-snapshot
Atomic Embeddability, Clustered Planarity, and Thickenability
inferred← citeshttps://doi.org/10.1145/3502264openalex-snapshot
Atomic Embeddability, Clustered Planarity, and Thickenability
inferred← citeshttps://doi.org/10.1145/3607474openalex-snapshot
Synchronized Planarity with Applications to Constrained Planarity Problems
inferred← citeshttps://doi.org/10.1201/b15385-4openalex-snapshot
- Planarity Testing and Embedding
inferred← citeshttps://doi.org/10.1201/b16132-53openalex-snapshot
Graphs and Finite Geometries
inferred← citeshttps://doi.org/10.1201/b16132-73openalex-snapshot
Drawings of Graphs
inferred← citeshttps://doi.org/10.1515/jib-2019-0026openalex-snapshot
Mental-Map Preserving Visualisation of Partitioned Networks in Vanted
inferred← citeshttps://doi.org/10.48550/arxiv.1207.3934openalex-snapshot
Relaxing the Constraints of Clustered Planarity
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6175openalex-snapshot
Deepening the Relationship between SEFE and C-Planarity
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1006openalex-snapshot
A Survey on Small-Area Planar Graph Drawing
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3022openalex-snapshot
Toward the Hanani-Tutte Theorem for Clustered Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.00921openalex-snapshot
Towards Faithful Graph Visualizations
inferred← citeshttps://doi.org/10.7155/jgaa.00016openalex-snapshot
Drawing Clustered Graphs on an Orthogonal Grid
inferred← citeshttps://doi.org/10.7155/jgaa.00024openalex-snapshot
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00115openalex-snapshot
Clustering Cycles into Cycles of Clusters
inferred← citeshttps://doi.org/10.7155/jgaa.00165openalex-snapshot
C-Planarity of C-Connected Clustered Graphs
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.