Given an n-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) betweenâ€¦ (More)

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planarâ€¦ (More)

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Î“ of G in the plane such that the edges of S are notâ€¦ (More)

In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V,Â E) and a function $$\gamma :V \rightarrow \{1,2,\dots ,k\}$$ Î³ : V â†’ { 1 , 2 , â‹¯â€¦ (More)

In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that theâ€¦ (More)

We consider drawings of graphs that contain dense subgraphs. We introduce intersectionlink representations for such graphs, in which each vertex u is represented by a geometric object R(u) and inâ€¦ (More)