
Local Complexity of Polygons
Many problems in Discrete and Computational Geometry deal with simple po...
read it

Efficient Segment Folding is Hard
We introduce a computational origami problem which we call the segment f...
read it

CrossingOptimal Extension of Simple Drawings
In extension problems of partial graph drawings one is given an incomple...
read it

Saturated kPlane Drawings with Few Edges
A drawing of a graph is kplane if no edge is crossed more than k times....
read it

Extending Nearly Complete 1Planar Drawings in Polynomial Time
The problem of extending partial geometric graph representations such as...
read it

Extending Partial 1Planar Drawings
Algorithmic extension problems of partial graph representations such as ...
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

Balanced Independent and Dominating Sets on Colored Interval Graphs
We study two new versions of independent and dominating set problems on ...
read it

Finding large matchings in 1planar graphs of minimum degree 3
A matching is a set of edges without common endpoint. It was recently sh...
read it

Exploring SemiAutomatic Map Labeling
Label placement in maps is a very challenging task that is critical for ...
read it

Extending simple drawings with one edge is hard
A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
read it

Mixed Linear Layouts: Complexity, Heuristics, and Experiments
A kpage linear graph layout of a graph G = (V,E) draws all vertices alo...
read it

Maximizing Ink in Partial Edge Drawings of kplane Graphs
Partial edge drawing (PED) is a drawing style for nonplanar graphs, in ...
read it

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

Minimizing Crossings in Constrained TwoSided Circular Graph Layouts
Circular layouts are a popular graph drawing style, where vertices are p...
read it
Fabian Klute
is this you? claim profile