On the public citation graph

Grid Embedding of 4-Connected Plane Graphs

https://doi.org/10.1007/pl00009290
0 signed · 47 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/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferredcites →https://doi.org/10.1007/3-540-58950-3_361openalex-snapshot
Minimum-width grid drawings of plane graphs extend abstract
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf00353652openalex-snapshot
Planar graphs and poset dimension
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1016/0020-0190(95)00020-dopenalex-snapshot
A linear-time algorithm for drawing a planar graph on a grid
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/s0925-7721(98)00016-9openalex-snapshot
Minimum-width grid drawings of plane graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1951-0041425-5openalex-snapshot
Convex maps
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1988.21972openalex-snapshot
Fully dynamic techniques for point location and transitive closure in planar structures
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/s0895480191221453openalex-snapshot
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
inferredcites →https://doi.org/10.1142/s0218195997000144openalex-snapshot
Convex Grid Drawings of 3-Connected Planar Graphs
inferredcites →https://doi.org/10.1145/140901.141933openalex-snapshot
O( n log log n )-work parallel algorithms for straight-line grid embeddings of planar graphs
inferredcites →https://doi.org/10.1145/62212.62254openalex-snapshot
Small sets supporting fary embeddings of planar graphs
inferredcites →https://doi.org/10.5555/320176.320191openalex-snapshot
Embedding planar graphs on the grid

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_17openalex-snapshot
Transversal Structures on Triangulations, with Application to Straight-Line Drawing
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-61332-3_142openalex-snapshot
Rectangular grid drawings of plane graphs
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-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-031-22203-0_11openalex-snapshot
Strictly-Convex Drawings of 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_8openalex-snapshot
A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations
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-27798-9_34openalex-snapshot
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_8openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_43openalex-snapshot
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_15openalex-snapshot
A Lower Bound on the Area Requirements of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/s00453-008-9215-xopenalex-snapshot
Planar Polyline Drawings via Graph Transformations
inferred← citeshttps://doi.org/10.1007/s00454-001-0004-4openalex-snapshot
Grid Drawings of 4-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00454-004-1154-yopenalex-snapshot
Canonical Ordering Trees and Their Applications in Graph Drawing
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
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.2023.114290openalex-snapshot
Convex grid drawings of planar graphs with constant edge-vertex resolution
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00003-0openalex-snapshot
Rectangular grid drawings of plane graphs
inferred← citeshttps://doi.org/10.1023/a:1010604726900openalex-snapshot
Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes
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.1587/transfun.2021dmp0010openalex-snapshot
Grid Drawings of Five-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1587/transfun.2023dmp0004openalex-snapshot
Rectangle-of-Influence Drawings of Five-Connected Plane Graphs
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.math/0602163openalex-snapshot
Transversal structures on triangulations: a combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.70675/915790c9z1594z4e9czab64zab385caa09d0openalex-snapshot
Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations
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.