We use basic results from graph theory to design two algorithms for constructing 3-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. Our first algorithmâ€¦ (More)

We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previousâ€¦ (More)

We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V,E) so that the total number of crossings among pairs of paths is minimized. Thisâ€¦ (More)

We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is minimized. Thisâ€¦ (More)

This paper shows how to stably merge two sequences A and B of sizesm and n, m n, respectively, with OÂ…mÂ‡ nÂ† assignments,OÂ…m logÂ…n=mÂ‡ 1Â†Â† comparisons and using only a constant amount of additionalâ€¦ (More)

In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader length is minimized. Weâ€¦ (More)