Michael Hoffmann

activity

20162020

most citedNetrunner Mate-in-1 or -2 is Weakly NP-Hard

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

cs.CG2019

Simple $k$ -Planar Graphs are Simple $(k + 1)$ -Quasiplanar

Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8

A simple topological graph is $k$ -quasiplanar ( $k \geq 2$ ) if it contains no $k$ pairwise crossing edges, and $k$ -planar if no edge is crossed more than $k$ times. In this paper, we…

cs.DS2019

The QuaSEFE Problem

Patrizio Angelini, Henry Förster, Michael Hoffmann +4

We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph ind…

math.CO2019

Minimal Representations of Order Types by Geometric Graphs

Oswin Aichholzer, Martin Balko, Michael Hoffmann +8

In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order ty…

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

The QuaSEFE Problem

Minimal Representations of Order Types by Geometric Graphs

Simple $k$ -Planar Graphs are Simple $(k + 1)$ -Quasiplanar