1 citations · 2 across the 7 of their papers we have counts for
5 papers · 1 filter
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…