In this paper, we design the first polynomial time approximation schemes for the Set Cover
and Dominating Set problems when the underlying sets are non-piercing regions (which …

A mixed graph has both directed and undirected edges. We study how to compute a
crossing-free drawing of an embedded planar mixed graph, such that it is upward 'as much …

In this paper, we study the point-set-embeddability-problem, ie, given a planar graph and a
set of points, is there a mapping of the vertices to the points such that the resulting straight …

We study the problem of characterizing the directed graphs with an upward straight-line
embedding into every point set in general or in convex position. We solve two questions …

We study upward pointset embeddings (UPSEs) of planar $ st $-graphs. Let $ G $ be a
planar $ st $-graph and let $ S\subset\mathbb {R}^ 2$ be a pointset with $| S|=| V (G)| $. An …

We describe a unified approach for studying book, point-set, and simultaneous
embeddability problems of upward planar digraphs. The approach is based on a linear time …

We study the upward point-set embeddability of digraphs on one-sided convex point sets
with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point …

We prove that every n-vertex oriented path admits an upward planar embedding on every
general set of (n− 1) 2+ 1 points on the plane. This result improves the previously known …

A point set S ⊆ R^ 2 S⊆ R 2 is universal for a class\mathcal GG of planar graphs if every
graph of GG has a planar straight-line embedding on S S. It is well-known that the integer …

We study the problem of upward point set embeddability, that is the problem to decide
whether an n-vertex directed graph has an upward planar drawing when its vertices have to …