The data structure SPQR-tree represents the decomposition of a biconnected graph with respect to its triconnected components. SPQR-trees have been introduced by Di Battista and Tamassia [8] and,â€¦ (More)

Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing.â€¦ (More)

We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree d on a (2n ? 5) (3 2 n ? 7 2) grid with at most 5n ? 15 bendsâ€¦ (More)

UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is to display classâ€¦ (More)

Branch-and-cut (-and-price) algorithms belong to the most successful techniques for solving mixed integer linear programs and combinatorial optimization problems to optimality (or, at least, withâ€¦ (More)

A clustered graph C = (G; T ) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G = (V;E). Each vertex c in T corresponds to a subset of theâ€¦ (More)