Graph layout problems are a particular class of combinatorial optimization problems whose
goal is to find a linear layout of an input graph in such way that a certain objective cost is …

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

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

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 …

A complete, self-contained introduction to a powerful and resurging mathematical discipline
Combinatorial Geometry presents and explains with complete proofs some of the most …

Crossing Numbers of Graphs is the first book devoted to the crossing number, an
increasingly popular object of study with surprising connections. The field has matured into a …

This paper deals with the Minimum Linear Arrangement problem from an experimental point
of view. Using a testsuite of sparse graphs, we experimentally compare several algorithms to …

An amorphous computing medium is a system of irregularly placed, asynchronous, locally
interacting computing elements. I have demonstrated that amorphous media can be …

Quasi-planar graphs have a linear number of edges Page 1 COMBINATORICA Bolyai Society
- Springer-Verlag COMBINATOR.ICA 17 (I) (1997) 1--9 QUASI-PLANAR GRAPHS HAVE A …

Let G be a planar graph of n vertices, v 1,…, vn, and let {p 1,…, pn} be a set of n points in the
plane. We present an algorithm for constructing in O (n 2) time a planar embedding of G …