5 citations · 7 across the 20 of their papers we have counts for
19 papers · 1 filter
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…
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…
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani +1
We continue the study of the area requirement of convex straight-line grid drawings of 3-connected plane graphs, which has been intensively investigated in the last decades. Motiva…
Graph Product Structure for h-Framed Graphs
Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný +1
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding struc…
The Mixed Page Number of Graphs
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, call…
On the Queue Number of Planar Graphs
Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou
A k-queue layout is a special type of a linear layout, in which the linear order avoids (k+1)-rainbows, i.e., k+1 independent edges that pairwise form a nested pair. The optimizati…