
Simplifying NonSimple FanPlanar Drawings
A drawing of a graph is fanplanar if the edges intersecting a common ed...
read it

Adjacency Graphs of Polyhedral Surfaces
We study whether a given graph can be realized as an adjacency graph of ...
read it

On the edgevertex ratio of maximal thrackles
A drawing of a graph in the plane is a thrackle if every pair of edges i...
read it

The Partition Spanning Forest Problem
Given a set of colored points in the plane, we ask if there exists a cro...
read it

ConvexityIncreasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given an...
read it

LinearTime Algorithms for MaximumWeight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
A bipartite graph G=(U,V,E) is convex if the vertices in V can be linear...
read it

Ordered Level Planarity, Geodesic Planarity and BiMonotonicity
We introduce and study the problem Ordered Level Planarity which asks fo...
read it
Boris Klemz
is this you? claim profile