IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Givenâ€¦ (More)

BACKGROUND
The implementation of the 'Surgical Safety Checklist' caused a significant reduction in the incidence of complications and mortality among patients undergoing surgery. The aim of theâ€¦ (More)

A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turnsâ€¦ (More)

In smooth orthogonal layouts of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axisaligned tangents. In this paper, we study the problemâ€¦ (More)

We define the visual complexity of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g. you needâ€¦ (More)

Given a set of k-colored points in the plane, we consider the problem of finding k trees such that each tree connects all points of one color class, no two trees cross, and the total edge length ofâ€¦ (More)

Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established near-planarity models in graph drawing, we formulate a newâ€¦ (More)