Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and
studies geometric representations of nonplanar graphs in terms of forbidden crossing …

The notion of 1-planarity is among the most natural and most studied generalizations of
graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at …

The field of computational geometry is a relatively recent addition to the mathematical
landscape. Over the past ten years, a substantial number of papers and technical reports in …

When dealing with special graph classes and algorithmic problems on them, a main source
is the classical book of Golumbic, Algorithmic Graph Theory and Perfect Graphs [454]. The …

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 …

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with n
vertices has a Fáry embedding (ie, straight-line embedding) on the 2 n− 4 by n− 2 grid and …

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 …

Graph drawing comprises all aspects of visualizing structural relations between objects. The
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …

Two points in a polygon are called if the straight line between them lies entirely inside the
polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P …

The state of the art in automatic graph drawing is reviewed, with special attention to the
readability of information system diagrams. Existing results in the literature are compared …