
Lazy Queue Layouts of Posets
We investigate the queue number of posets in terms of their width, that ...
read it

Rectilinear Planarity Testing of Plane SeriesParallel Graphs in Linear Time
A plane graph is rectilinear planar if it admits an embeddingpreserving...
read it

Four Pages Are Indeed Necessary for Planar Graphs
An embedding of a graph in a book consists of a linear order of its vert...
read it

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs
We present a prototype online system to automate the procedure of comput...
read it

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

On Layered FanPlanar Graph Drawings
In this paper, we study fanplanar drawings that use h layers and are pr...
read it

Coloring outerplanar graphs and planar 3trees with small monochromatic components
In this work, we continue the study of vertex colorings of graphs, in wh...
read it

Addressing Algorithmic Bottlenecks in Elastic Machine Learning with Chicle
Distributed machine learning training is one of the most common and impo...
read it

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

Efficient Generation of Different Topological Representations of Graphs BeyondPlanarity
Beyondplanarity focuses on combinatorial properties of classes of nonp...
read it

Elastic CoCoA: Scaling In to Improve Convergence
In this paper we experimentally analyze the convergence behavior of CoCo...
read it

Queue Layouts of Planar 3Trees
A queue layout of a graph G consists of a linear order of the vertices o...
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

The number of crossings in multigraphs with no empty lens
Let G be a multigraph with n vertices and e>4n edges, drawn in the plane...
read it

On RAC Drawings of Graphs with one Bend per Edge
A kbend rightanglecrossing drawing or (kbend RAC drawing, for short)...
read it

On Dispersable Book Embeddings
In a dispersable book embedding, the vertices of a given graph G must be...
read it

BeyondPlanarity: Density Results for Bipartite Graphs
Beyondplanarity focuses on the study of geometric and topological graph...
read it

3D Visibility Representations of 1planar Graphs
We prove that every 1planar graph G has a zparallel visibility represe...
read it
Michael Kaufmann
is this you? claim profile