Michael Kaufmann

activity

20232026

most citedLinear Layouts of Bipartite Planar Graphs

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

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs

Aaron Büngener, Michael Kaufmann

The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m ^{3}}{n ^{2}}$ for the number of crossings in any drawing of a given graph…

math.CO2024

On $k$ -planar Graphs without Short Cycles

Michael A. Bekos, Prosenjit Bose, Aaron Büngener +6

We study the impact of forbidding short cycles to the edge density of $k$ -planar graphs; a $k$ -planar graph is one that can be drawn in the plane with at most $k$ crossings per edg…

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs

On k-planar Graphs without Short Cycles

On $k$ -planar Graphs without Short Cycles