Balanced aspect ratio trees and their use for drawing large graphs.
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Bar -visibility graphs.
Binary trees, fringe thickness and minimum path length
Boundaries in digital planes.
Bounds for orthogonal 3-D graph drawing.
Bouquets of circles for lamination languages and complexities
Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination...
Building blocks of upward planar digraphs.