The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...