A circular-arc model â„³ is a circle C together with a collection $\mathcal{A}$ of arcs of C. If $\mathcal{A}$ satisfies the Helly Property then â„³ is a Helly circular-arc model. A (Helly) circular-arcâ€¦ (More)

Consider a set P of n points in the plane and n radars located at these points. The radars are rotating perpetually (around their centre) with identical constant speeds, continuously emitting pulsesâ€¦ (More)

Ma and Spinrad have shown that every transitive orientation of a chordal comparability graph is the intersection of four linear orders. That is, chordal comparability graphs are comparability graphsâ€¦ (More)

In the early 1980â€™s, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been givenâ€¦ (More)

Given a set of points in the plane each colored either red or blue, we find non-self-intersecting geometric spanning cycles of the red points and of the blue points such that each edge of the redâ€¦ (More)

A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. Given a digraph G, a partially complemented digraph GÌƒ is a digraphâ€¦ (More)