An annotated review on graph drawing and its applications

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

Graph Drawing
Straight-line monotone grid drawings of series–parallel graphs
Planarity Algorithms via PQ-Trees (Extended Abstract)
Trémaux Trees and Planarity
1-Bend Orthogonal Partial Edge Drawing
The Planar Slope Number of Subcubic Graphs
Smooth Orthogonal Drawings of Planar Graphs
Orthogonal Drawings for Plane Graphs with Specified Face Areas
INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
Automata Theory with Modern Applications
TRÉMAUX TREES AND PLANARITY
Graph Drawing
Graph Drawing
How to Draw a Graph
Convex Maps
Monotone Drawings of Graphs
Accelerated Bend Minimization
Graph Drawing
Drawing planar graphs with circular arcs
A multi-scale algorithm for drawing graphs nicely
Rectangular drawings of plane graphs without designated corners
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
Unit-length rectangular drawings of graphs
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A note on 1-planar graphs
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Monotone drawings of graphs with few directions
A linear-time algorithm for drawing a planar graph on a grid
Curve-constrained drawings of planar graphs
Drawing plane graphs nicely
How to draw a planar graph on a grid
Convex drawings of 3-connected plane graphs
Good spanning trees in graph drawing
A theory of rectangular dual graphs
Octagonal drawings of plane graphs with prescribed face areas
Drawing slicing graphs with face areas
A linear algorithm for embedding planar graphs using PQ-trees
A linear algorithm to find a rectangular dual of a planar triangulated graph
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Minimum-width grid drawings of plane graphs
Algorithms for drawing graphs: An annotated bibliography
Algorithms for area-efficient orthogonal drawing
A better heuristic for orthogonal graph drawings
An algorithm for straight-line drawing of planar graphs
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Rectangular grid drawings of plane graphs
Drawing plane triangulations with few segments
Drawing planar graphs with few geometric primitives
Bend-optimal orthogonal drawings of triconnected plane graphs
A force-directed algorithm for drawing directed graphs symmetrically
Bend-minimum orthogonal drawings in quadratic time
Drawing graphs on rectangular grids
Drawing planar graphs using the canonical ordering
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
A new planarity test
Drawing planar graphs with few segments on a polynomial grid
Polyline drawings with topological constraints
No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract)
Monotone drawings of graphs with fixed embedding
Minimum-segment convex drawings of 3-connected cubic plane graphs
Drawings of planar graphs with few slopes and segments
On RAC drawings of 1-planar graphs
Book embeddability of series-parallel digraphs
A Planarity Test via Construction Sequences
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
Graphs That Admit Polyline Drawings with Few Crossing Angles
Fáry’s Theorem for 1-Planar Graphs
Trade-Offs in Planar Polyline Drawings
On Monotone Drawings of Trees
Small-Area Orthogonal Drawings of 3-Connected Graphs
How to Draw a Planarization
Orthogonal Graph Drawing with Flexibility Constraints
Drawing Graphs in the Plane with High Resolution
Minimum-Area Drawings of Plane 3-Trees
Force-Directed Lombardi-Style Graph Drawing
Convex Representations of Graphs
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
Straight-Line Drawability of a Planar Graph Plus an Edge
SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
VLSI Physical Design: From Graph Partitioning to Timing Closure
Rectangular duals of planar graphs
On Embedding a Graph in the Grid with the Minimum Number of Bends
Universality considerations in VLSI circuits
New lower bound techniques for VLSI
Efficient Planarity Testing
A forced directed component placement procedure for printed circuit boards
Spirality and Optimal Orthogonal Drawings
A Fast Multi-Scale Method for Drawing Large Graphs
GRIP: Graph Drawing with Intelligent Placement
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
Using Graph Layout to Visualize Train Interconnection Data
A Framework for Drawing Planar Graphs with Curves and Polylines
Graph Drawing and Applications for Software and Knowledge Engineers
Computing orthogonal drawings with the minimum number of bends
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
Orthogonal Drawings of Plane Graphs Without Bends
Dividing a Graph into Triconnected Components
Rectangular drawings of planar graphs
Smooth Orthogonal Layouts
Testing Simultaneous Planarity when the Common Graph is 2-Connected
Testing Planarity of Partially Embedded Graphs
Crossing Layout in Non-planar Graph Drawings
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
On Turn-Regular Orthogonal Representations
Extending Partial Orthogonal Drawings
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends