Stack layouts and queue layouts of undirected graphs have been used to model problems in
fault tolerant computing and in parallel process scheduling. However, problems in parallel …

A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly
outward drawing on k concentric levels without crossings. Radial level planarity extends …

Planarity is an important concept in graph drawing. It is generally accepted that planar
drawings are well understandable. Recently, several variations of planarity have been …

Arc-connected sets A, B⊂ E 2 are called noncrossing if both AB and BA are arc-connected.
A graph is called an NCAC graph if it has an intersection representation in which vertices …

Every planar graph has a concentric representation based on a breadth first search, see
[21]. The vertices are placed on concentric circles and the edges are routed as curves …

A track graph is a graph with its vertex set partitioned into horizontal levels. It is track planar if
there are permutations of the vertices on each level such that all edges can be drawn as …

Workflow definition languages are evolving rapidly. However, there is not any agreed-upon
standard for such languages. In this paper we address the problem of how to develop a …

In this dissertation we generalise the notion of level planar graphs in two directions: track
planarity and radial planarity. Our main results are linear time algorithms both for the …

Clustered graphs are an enhanced graph model with a recursive clustering of the vertices
according to a given nesting relation. This prime technique for expressing coherence of …

Level planarity and upward planarity are two natural planarity notions for directed graphs
that enrich the notion of planarity of ordinary graphs by imposing additional requirements …