Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of
combinatorial objects are represented by non-Gaussian Grassmann integrals. As a special …

We use Schnyder woods of 3-connected planar graphs to produce convex straight-line
drawings on a grid of size (n-2-Δ)*(n-2-Δ). The parameter Δ≧0 depends on the Schnyder …

Selected Open Problems in Graph Drawing | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …

The family of well-orderly maps is a family of planar maps with the property that every
connected planar graph has at least one plane embedding which is a well-orderly map. We …

In this paper, we present boundary labeling, a new approach for labeling point sets with
large labels. We first place disjoint labels around an axis-parallel rectangle that contains the …

Graph Drawing Algorithms Page 1 6 Graph Drawing Algorithms Peter Eades University of
Sydney Carsten Gutwenger Dortmund University of Technology Seok-Hee Hong University of …

Despite a long research effort, finding the minimum area for straight-line grid drawings of
planar graphs is still an elusive goal. A long-standing lower bound on the area requirement …

A plane graph is a planar graph with a fixed planar embedding. In this paper we define a
special spanning tree of a plane graph which we call a good spanning tree. Not every plane …

Let G be an n-node planar graph. In a visibility representation of G, each node of G is
represented by a horizontal line segment such that the line segments representing any two …