Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

This book is written based on my class notes developed while teaching the undergraduate
graph theory course “Basic Graph Theory” at the Department of Computer Science and …

We investigate the computational complexity of the following problem. Given a planar graph
in which some vertices have already been placed in the plane, place the remaining vertices …

This book surveys the mathematical and computational properties of finite sets of points in
the plane, covering recent breakthroughs on important problems in discrete geometry, and …

Let C be the family of 2D curves described by concave functions, let G be a planar graph,
and let L be a linear ordering of the vertices of G. L is a curve embedding of G if for any given …

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 …

Graph augmentation problems are motivated by network design and have been studied
extensively in optimization. We consider augmentation problems over plane geometric …

In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic
drawing convention. It requires that edges are drawn as interior-disjoint monotone chains of …

In this paper we study the problem of computing an upward straight-line embedding of a
planar DAG (directed acyclic graph) G into a point set S, ie a planar drawing of G such that …

We investigate which planar point sets allow simultaneous straight-line embeddings of all
planar graphs on a fixed number of vertices. We first show that at least (1.293-o (1)) n points …