Advances in the theory and practice of graph drawing

Related Items (3)

An annotated bibliography on 1-planarity ⋮ Crossing and intersecting families of geometric graphs on point sets ⋮ Radial drawings of graphs: geometric constraints and trade-offs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A framework for solving VLSI graph layout problems
How to draw a planar graph on a grid
General theoretical results on rectilinear embeddability of graphs
A unified approach to visibility representations of planar graphs
Fundamentals of planar ordered sets
Algorithms for plane representations of acyclic digraphs
Rigidity and energy
Lower bounds for planar orthogonal drawings of graphs
A paradigm for robust geometric algorithms
Constrained visibility representations of graphs
Area requirement and symmetry display of planar upward drawings
A note on optimal area algorithms for upward drawings of binary trees
Theoretical results on at most 1-bend embeddability of graphs
Algorithms for drawing graphs: An annotated bibliography
A quantitative Steinitz' theorem
Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings
Graph drawing. Symposium, GD '96, Berkeley, CA, USA, September 18--20, 1996. Proceedings
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
Algorithms for area-efficient orthogonal drawing
Geometric representations of graphs
A better heuristic for orthogonal graph drawings
Upward planarity testing
Special issue: graph drawing
Drawing planar graphs using the canonical ordering
Maximum planar subgraphs and nice embeddings: Practical layout tools
An experimental comparison of four graph drawing algorithms.
Drawing Graphs in the Plane with High Resolution
Convex Representations of Graphs
On Embedding a Graph in the Grid with the Minimum Number of Bends
DAG—a program that draws directed graphs
Universality considerations in VLSI circuits
The Area-Time Complexity of Binary Multiplication
A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
Efficient Planarity Testing
Planar Lattices
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
On the Angular Resolution of Planar Graphs
HOW TO DRAW A SERIES-PARALLEL DIGRAPH
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
Guest Editors' Introduction
A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA
Dividing a Graph into Triconnected Components
Computing proximity drawings of trees in the 3-dimensional space
PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
How to Draw a Graph

This page was built for publication: Advances in the theory and practice of graph drawing