On the public citation graph

How to draw a planar graph on a grid

https://doi.org/10.1007/bf02122694
0 signed · 575 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/bf00353652openalex-snapshot
Planar graphs and poset dimension
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.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0012-365x(83)90128-0openalex-snapshot
Representing a planar graph by vertical lines joining different levels
inferredcites →https://doi.org/10.1109/sfcs.1985.51openalex-snapshot
Slimming down search structures: A functional approach to algorithm design
inferredcites →https://doi.org/10.1109/tc.1981.6312176openalex-snapshot
Universality considerations in VLSI circuits
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22470.xopenalex-snapshot
Embedding in the Plane With Orientation Constraints: The Angle Graph
inferredcites →https://doi.org/10.1112/plms/s3-13.1.743openalex-snapshot
How to Draw a Graph
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/9781118033203.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/jgt.20214openalex-snapshot
Simultaneous diagonal flips in plane triangulations
inferred← citeshttps://doi.org/10.1006/inco.1997.2635openalex-snapshot
Triangulating Planar Graphs While Minimizing the Maximum Degree
inferred← citeshttps://doi.org/10.1006/inco.2001.3031openalex-snapshot
Incremental Convex Planarity Testing
inferred← citeshttps://doi.org/10.1006/jagm.2000.1115openalex-snapshot
A Framework for Drawing Planar Graphs with Curves and Polylines
inferred← citeshttps://doi.org/10.1006/jvlc.1998.0093openalex-snapshot
Performance of Layout Algorithms: Comprehension, not Computation
inferred← citeshttps://doi.org/10.1007/10692760_11openalex-snapshot
Drawing Planar Partitions II: HH-Drawings
inferred← citeshttps://doi.org/10.1007/11618058_27openalex-snapshot
Convex Drawings of Plane Graphs of Minimum Outer Apices
inferred← citeshttps://doi.org/10.1007/11618058_41openalex-snapshot
An Application of Well-Orderly Trees in Graph Drawing
inferred← citeshttps://doi.org/10.1007/11618058_9openalex-snapshot
Small Area Drawings of Outerplanar Graphs
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-36136-7_50openalex-snapshot
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_17openalex-snapshot
Compact Encodings of Planar Orthogonal Drawings
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_5openalex-snapshot
Path-Width and Three-Dimensional Straight-Line Grid Drawings of 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-36206-1_31openalex-snapshot
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
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-36494-3_3openalex-snapshot
Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_12openalex-snapshot
A Framework for Drawing Planar Graphs with Curves and Polylines
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_13openalex-snapshot
Planar Polyline Drawings with Good Angular Resolution
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-44541-2_12openalex-snapshot
Fast Layout Methods for Timetable Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44969-8_11openalex-snapshot
Software Packages
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_89openalex-snapshot
Wagner’s Theorem on Realizers
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_8openalex-snapshot
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_24openalex-snapshot
Constructing Plane Spanners of Bounded Degree and Low Weight
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-45848-4_29openalex-snapshot
Floor-Planning via Orderly Spanning Trees
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_32openalex-snapshot
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_45openalex-snapshot
JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms
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_24openalex-snapshot
Graph Drawing Algorithm Engineering with AGD
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_12openalex-snapshot
Drawing Planar Graphs with Circular Arcs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_14openalex-snapshot
Graph Planarity and Related Topics
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-46648-7_19openalex-snapshot
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_33openalex-snapshot
Geometric Realization of Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_36openalex-snapshot
A Force-Directed Algorithm that Preserves Edge Crossing Properties
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_37openalex-snapshot
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_36openalex-snapshot
Efficient Generation of Plane Triangulations without Repetitions
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_22openalex-snapshot
Triangulating planar graphs while minimizing the maximum degree
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_53openalex-snapshot
Hexagonal grid drawings
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_261openalex-snapshot
Parallel construction of canonical ordering and convex drawing of triconnected planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_2openalex-snapshot
Advances in graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_69openalex-snapshot
Two algorithms for finding rectangular duals of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_70openalex-snapshot
A more compact visibility representation
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_351openalex-snapshot
Three-dimensional graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_360openalex-snapshot
Regular edge labelings and drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_361openalex-snapshot
Minimum-width grid drawings of plane graphs extend abstract
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_385openalex-snapshot
Upward planarity testing of outerplanar dags (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_389openalex-snapshot
Proximity constraints and representable trees (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_390openalex-snapshot
Recognizing rectangle of influence drawable graphs (extended abstract)
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/3-540-62495-3_45openalex-snapshot
2-Visibility drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_66openalex-snapshot
Nice drawings for planar bipartite graphs
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_49openalex-snapshot
Three-dimensional grid drawings of graphs
inferred← citeshttps://doi.org/10.1007/978-1-4471-2804-5_7openalex-snapshot
How to Draw a Graph, Revisited
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_10openalex-snapshot
The Crossing-Angle Resolution in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_17openalex-snapshot
Plane Geometric Graph Augmentation: A Generic Perspective
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_650openalex-snapshot
Canonical Orders and Schnyder Realizers
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_10openalex-snapshot
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_19openalex-snapshot
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_6openalex-snapshot
Universal Slope Sets for Upward Planar Drawings
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_21openalex-snapshot
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_15openalex-snapshot
Reaching 3-Connectivity via Edge-Edge Additions
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_13openalex-snapshot
On the Edge-Length Ratio of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_27openalex-snapshot
A Note on Universal Point Sets for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_36openalex-snapshot
Homotopy Height, Grid-Major Height and Graph-Drawing Height
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_41openalex-snapshot
Graph Stories in Small Area
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_9openalex-snapshot
Balanced Schnyder Woods for Planar Triangulations: An Experimental Study with Applications to Graph Drawing and Graph Separators
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_1openalex-snapshot
Drawing Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-51051-0_17openalex-snapshot
On the Treewidth of Planar Minor Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_14openalex-snapshot
Universal Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_25openalex-snapshot
Drawing Graphs as Spanners
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_27openalex-snapshot
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_15openalex-snapshot
A Tipping Point for the Planarity of Small and Medium Sized Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_16openalex-snapshot
Feedback Vertex Set on Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_13openalex-snapshot
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_25openalex-snapshot
Limitations on Realistic Hyperbolic Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_8openalex-snapshot
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs
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-22203-0_29openalex-snapshot
Visibility Representations of Toroidal and Klein-bottle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_15openalex-snapshot
Outerplanar and Forest Storyplans
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_5openalex-snapshot
Drawing Reeb Graphs
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_16openalex-snapshot
A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_19openalex-snapshot
Superpatterns and Universal Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_8openalex-snapshot
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_6openalex-snapshot
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_2openalex-snapshot
Contact Representations of Graphs in 3D
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_13openalex-snapshot
Small-Area Orthogonal Drawings of 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_25openalex-snapshot
Recognizing and Drawing IC-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_27openalex-snapshot
The Utility of Untangling
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_34openalex-snapshot
A Universal Point Set for 2-Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_35openalex-snapshot
Linear-Size Universal Point Sets for One-Bend Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_39openalex-snapshot
Pixel and Voxel Representations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-29971-6_6openalex-snapshot
A Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_10openalex-snapshot
Some Research Topics
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_6openalex-snapshot
Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-49475-3_9openalex-snapshot
Special Classes of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_11openalex-snapshot
Non-aligned Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_12openalex-snapshot
Snapping Graph Drawings to the Grid Optimally
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_14openalex-snapshot
Drawing Graphs on Few Lines and Few Planes
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_18openalex-snapshot
Bitonic st-orderings for Upward Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_21openalex-snapshot
The Partial Visibility Representation Extension Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_27openalex-snapshot
On the Density of Non-simple 3-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_11openalex-snapshot
An Experimental Study on the Ply Number of Straight-Line Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-59108-7_10openalex-snapshot
Algorithms for Stable Matching and Clustering in a Grid
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_13openalex-snapshot
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_24openalex-snapshot
Drawing Planar Graphs with Few Geometric Primitives
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_24openalex-snapshot
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_6openalex-snapshot
Obstacle Numbers of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_7openalex-snapshot
Grid-Obstacle Representations with Connections to Staircase Guarding
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_6openalex-snapshot
10 Reasons to Get Interested in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_12openalex-snapshot
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
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-24595-7_12openalex-snapshot
Area-Efficient Drawings of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_25openalex-snapshot
More Efficient Generation of Plane Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_37openalex-snapshot
Radial Level Planarity Testing and Embedding in Linear Time
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-24749-4_42openalex-snapshot
On Visibility Representation of Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_3openalex-snapshot
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids
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-30551-4_44openalex-snapshot
On the Complexity of Network Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_28openalex-snapshot
Planar Straight-Line Drawing in an $\mathcal{O}(n)\times \mathcal{O}(n)$ Grid with Angular Resolution $\it \Omega$ (1/n)
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_14openalex-snapshot
Really Straight Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_21openalex-snapshot
Simultaneous Embedding of Planar Graphs with Few Bends
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_34openalex-snapshot
Long Alternating Paths in Bicolored Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_43openalex-snapshot
New Theoretical Bounds of Visibility Representation 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-39890-5_17openalex-snapshot
Drawing Planar Graphs on a Curve
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-45078-8_22openalex-snapshot
On Simultaneous Planar Graph Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_25openalex-snapshot
Drawing Graphs with Large Vertices and Thick Edges
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-70904-6_12openalex-snapshot
Embedding Graphs Simultaneously with Fixed Edges
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_15openalex-snapshot
Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_23openalex-snapshot
Straight-Line Drawing of Quadrangulations
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_34openalex-snapshot
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_41openalex-snapshot
Partitions of Graphs into Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_26openalex-snapshot
Colored Simultaneous Geometric Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_15openalex-snapshot
Representation of Planar Hypergraphs by Contacts of Triangles
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_19openalex-snapshot
Matched Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_21openalex-snapshot
Minimizing the Area for Planar Straight-Line Grid Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_33openalex-snapshot
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_34openalex-snapshot
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_8openalex-snapshot
Cyclic Level Planarity Testing and Embedding
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_13openalex-snapshot
Four-Connected Spanning Subgraphs of Doughnut Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_20openalex-snapshot
Listing All Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_12openalex-snapshot
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_14openalex-snapshot
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
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/978-3-642-00202-1_27openalex-snapshot
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_16openalex-snapshot
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_26openalex-snapshot
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_3openalex-snapshot
Succinct Greedy Graph Drawing in the Hyperbolic Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_4openalex-snapshot
An Algorithm to Construct Greedy Drawings of Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_40openalex-snapshot
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_10openalex-snapshot
Edge-Intersection Graphs of k-Bend Paths in Grids
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-11440-3_4openalex-snapshot
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_5openalex-snapshot
Small Grid Drawings of Planar Graphs with Balanced Bipartition
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_16openalex-snapshot
Leftist Canonical Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_27openalex-snapshot
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_28openalex-snapshot
Drawing Trees in a Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_30openalex-snapshot
Drawing Planar 3-Trees with Given Face-Areas
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_41openalex-snapshot
4-Labelings and Grid Embeddings of Plane Quadrangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_5openalex-snapshot
On the Perspectives Opened by Right Angle Crossing Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_6openalex-snapshot
Drawing 3-Polytopes with Good Vertex Resolution
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_7openalex-snapshot
Planar Drawings of Higher-Genus Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_37openalex-snapshot
Optimal Polygonal Representation of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_1openalex-snapshot
Regular Labelings and Geometric Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_12openalex-snapshot
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_16openalex-snapshot
On Graphs Supported by Line Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_20openalex-snapshot
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_27openalex-snapshot
Drawing Planar Graphs of Bounded Degree with Few Slopes
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_29openalex-snapshot
Point-Set Embeddings of Plane 3-Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_33openalex-snapshot
Universal Pointsets for 2-Coloured Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_34openalex-snapshot
The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
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-22300-6_9openalex-snapshot
Orthogonal Cartograms with Few Corners Per Face
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_17openalex-snapshot
Approximate Proximity Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_4openalex-snapshot
Proportional Contact Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_7openalex-snapshot
On Point-Sets That Support Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_8openalex-snapshot
Small Point Sets for Simply-Nested Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_650-1openalex-snapshot
Canonical Orders and Schnyder Realizers
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_16openalex-snapshot
On the Hardness of Point-Set Embeddability
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_22openalex-snapshot
Domatic Partition on Several Classes of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_29openalex-snapshot
Fáry’s Theorem for 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_18openalex-snapshot
Drawing Planar Graphs on Points Inside a Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_16openalex-snapshot
Compact Grid Representation of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_19openalex-snapshot
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_12openalex-snapshot
h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
showing the first 200 of 565 · page through all 565
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.