
Recognizing and Embedding Simple Optimal 2Planar Graphs
In the area of beyondplanar graphs, i.e. graphs that can be drawn with ...
read it

2Layer kPlanar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
The 2layer drawing model is a wellestablished paradigm to visualize bi...
read it

Drawing Shortest Paths in Geodetic Graphs
Motivated by the fact that in a space where shortest paths are unique, n...
read it

Monotone Arc Diagrams with few Biarcs
We show that every planar graph can be represented by a monotone topolog...
read it

Drawing Graphs with Circular Arcs and RightAngle Crossings
In a RAC drawing of a graph, vertices are represented by points in the p...
read it

The QuaSEFE Problem
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
read it

On Strict (Outer)Confluent Graphs
A strict confluent (SC) graph drawing is a drawing of a graph with verti...
read it

On Arrangements of Orthogonal Circles
In this paper, we study arrangements of orthogonal circles, that is, arr...
read it

Planar Graphs of Bounded Degree have Constant Queue Number
A queue layout of a graph consists of a linear order of its vertices and...
read it

Orthogonal and Smooth Orthogonal Layouts of 1Planar Graphs with Low Edge Complexity
While orthogonal drawings have a long history, smooth orthogonal drawing...
read it

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
The crossing resolution of a nonplanar drawing of a graph is the value ...
read it

On RAC Drawings of Graphs with one Bend per Edge
A kbend rightanglecrossing drawing or (kbend RAC drawing, for short)...
read it
Henry Förster
is this you? claim profile