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 …

In this survey/introductory article, we first present the basics of the field of Parameterized
Complexity, made accessible to readers without background on the subject. Afterwards, we …

A queue layout of a graph consists of a total order of the vertices, and a partition of the edges
into queues, such that no two edges in the same queue are nested. The minimum number of …

Given a graph G and an integer b, OrthogonalPlanarity is the problem of testing whether G
admits a planar orthogonal drawing with at most b bends. OrthogonalPlanarity is known to …

This paper investigates the following question: Given a grid ϕ, where ϕ is a proper subset of
the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with …

This paper surveys parameterized complexity results for hard geometric algorithmic
problems. It includes fixed-parameter tractable problems in graph drawing, geometric …

Parameterized Algorithmics: A Graph-Theoretic Approach Page 1 Parameterized Algorithmics:
A Graph-Theoretic Approach Henning Fernau Universität Tübingen, WSI für Informatik, Sand …

Abstract The Vertex Separation problem (VSP) is an NP-hard problem with practical
applications in VLSI design, graph drawing and computer language compiler design. VSP …

We investigate two types of graph layouts, track layouts and layered path decompositions,
and the relations between their associated parameters track-number and layered pathwidth …

A\emph (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total
order of each vertex colour class, and a (non-proper) edge k-colouring such that between …