1 citations · 2 across the 7 of their papers we have counts for
11 papers
Product Structure Meets Track Layouts
Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný +1
A track layout of a graph is a partition of its vertices into linearly ordered independent sets, called tracks, such that no two edges between the same pair of tracks cross. Given…
On t-colorable k-plane drawings
Miriam Goetze, Michael Kaufmann, Soeren Terziadis
In this work, we introduce -colorable -plane drawings, that is, drawings of graphs with a -edge-coloring where every edge is crossed by at most edges of each color. We…
On the Recognition of Outerplanar Graphs with Queue Number 1
Michael A. Bekos, Thomas Depian, Stefan Felsner +7
A linear layout of a graph is defined as a total order of the vertices and a partition of the edges to pages. In a stack (queue) layout, no two edges on the same page may cross (ne…
A first view on the density of 5-planar graphs
Aaron Büngener, Jakob Franz, Michael Kaufmann +1
A key concept for many graph layout algorithms is planarity, a graph property that allows to draw vertices and edges crossing-free in the plane. Important is the generalization to…
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 for the number of crossings in any drawing of a given graph…
On -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 -planar graphs; a -planar graph is one that can be drawn in the plane with at most crossings per edg…
The Density Formula: One Lemma to Bound Them All
Michael Kaufmann, Boris Klemz, Kristin Knorr +3
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in t…
Min--planar Drawings of Graphs
Carla Binucci, Aaron Büngener, Giuseppe Di Battista +7
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. On…
Axis-Parallel Right Angle Crossing Graphs
Patrizio Angelini, Michael A. Bekos, Julia Katheder +3
A RAC graph is one admitting a RAC drawing, that is, a polyline drawing in which each crossing occurs at a right angle. Originally motivated by psychological studies on readability…
On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs
Michael A. Bekos, Michael Kaufmann, Maria Eleni Pavlidi +1
Several types of linear layouts of graphs are obtained by leveraging known data structures; the most notable representatives are the stack and the queue layouts. In this content, g…
Linear Layouts of Bipartite Planar Graphs
Henry Förster, Michael Kaufmann, Laura Merker +2
A linear layout of a graph consists of a linear order of the vertices and a partition of the edges. A part is called a queue (stack) if no two edges nest (cross), tha…