We study the complexity of testing whether a biconnected graph G=(V, E) is planar with the
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

We study the complexity of testing whether a biconnected graph is planar with the additional
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

In a of a directed graph (digraph) vertices are drawn as points in the plane and edges as
orthogonal polylines starting with a vertical segment and ending with a horizontal segment …

A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing
edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its …

The problem of deciding whether a biconnected planar digraph $ G=(V, E) $ can be
augmented to become an $ st $-planar graph by adding a set of oriented edges …

A plane digraph G is a directed planar graph with a given planar embedding. In particular,
the embedding of G defines the circular ordering of the edges incident to each vertex. A …